Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.