• xmlui.mirage2.page-structure.header.title
    • français
    • English
  • Help
  • Login
  • Language 
    • Français
    • English
View Item 
  •   BIRD Home
  • CEREMADE (UMR CNRS 7534)
  • CEREMADE : Publications
  • View Item
  •   BIRD Home
  • CEREMADE (UMR CNRS 7534)
  • CEREMADE : Publications
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Browse

BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesTypeThis CollectionBy Issue DateAuthorsTitlesType

My Account

LoginRegister

Statistics

Most Popular ItemsStatistics by CountryMost Popular Authors
Thumbnail - Request a copy

Global line search strategies for nonlinear least squares problems based on curvature and projected curvature

Al Khoury, Philippe; Chavent, Guy (2006), Global line search strategies for nonlinear least squares problems based on curvature and projected curvature, Inverse Problems, Design and Optimization (IPDO-2004) Symposium, 2006-03, Rio de Janeiro, Brésil

Type
Communication / Conférence
Date
2006
Conference title
Inverse Problems, Design and Optimization (IPDO-2004) Symposium
Conference date
2006-03
Conference city
Rio de Janeiro
Conference country
Brésil
Journal name
Inverse Problems in Science and Engineering
Volume
14
Number
5
Publisher
Taylor & Francis
Pages
495-509
Publication identifier
http://dx.doi.org/10.1080/17415970600573684
Metadata
Show full item record
Author(s)
Al Khoury, Philippe
Chavent, Guy
Abstract (EN)
In this article, we introduce global line search strategies based on the maximum projected curvature step (MPCS). This step is developed from the maximum curvature step (MCS), defined in [Chavent, G., 2004, Curvature steps and geodesic moves for nonlinear least squares descent algorithms. Inverse Problems in Science and Engineering.] and [Chavent, G., 2002, Curvature steps and geodesic moves for nonlinear least squares descent algorithms, INRIA Report.]. At a point in a descent curve, we introduce the optimization plan, on which we project the acceleration in order to obtain the projected curvature. For a search curve with bounded projected curvature, we compute the lower bound to the arc length of the first stationary point, which defines the MPCS. The convergence of the global strategies based on MPCSs and MCSs is studied for different common descent directions. Preliminary numerical results show that algorithms using the new strategies with steepest descent, Gauss–Newton or Levenberg–Marquardt direction are more efficient than the corresponding ones based on the unit step-size.
Subjects / Keywords
Optimization; Nonlinear least squares; Line search; Curvature step\-sizes

Related items

Showing items related by title and author.

  • Thumbnail
    On the uniqueness of local minima for general abstract nonlinear least-squares problems 
    Chavent, Guy (1988) Article accepté pour publication ou publié
  • Thumbnail
    A geometrical theory for nonlinear least squares problems 
    Chavent, Guy (1991) Communication / Conférence
  • Thumbnail
    Regularization of linear least squares problems by total bounded variation 
    Chavent, Guy; Kunisch, Karl (1997) Article accepté pour publication ou publié
  • Thumbnail
    Quasi-convex sets and size × curvature condition, application to nonlinear inversion 
    Chavent, Guy (1991) Article accepté pour publication ou publié
  • Thumbnail
    Generalized sentinels defined via least squares 
    Chavent, Guy (1995) Article accepté pour publication ou publié
Dauphine PSL Bibliothèque logo
Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16
Phone: 01 44 05 40 94
Contact
Dauphine PSL logoEQUIS logoCreative Commons logo