A Globally Convergent LCL Method for Nonlinear Optimization

Simple item page
dc.creatorFriedlander, Michael P.
dc.creatorSaunders, Michael A
dc.date2003-01-10
dc.date.accessioned2026-07-07T04:54:23Z
dc.date.available2026-07-07T04:54:23Z
dc.descriptionFor optimization problems with nonlinear constraints, linearly constrained Lagrangian (LCL) methods sequentially minimize a Lagrangian function subject to linearized constraints. These methods converge rapidly near a solution but may not be reliable from arbitrary starting points. The well known example \MINOS\ has proven effective on many large problems. Its success motivates us to propose a globally convergent variant. Our stabilized LCL method possesses two important properties: the subproblems are always feasible, and they may be solved inexactly. These features are present in \MINOS only as heuristics. The new algorithm has been implemented in \Matlab, with the option to use either the \MINOS or \SNOPT Fortran codes to solve the linearly constrained subproblems. Only first derivatives are required. We present numerical results on a nonlinear subset of the \COPS, \CUTE, and HS test-problem sets, which include many large examples. The results demonstrate the robustness and efficiency of the stabilized LCL procedure.
dc.description34 pages
dc.identifierhttps://arxiv.org/abs/math/0301109
dc.identifierhttp://arxiv.org/abs/math/0301109
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/66232
dc.subjectOptimization and Control
dc.subject49M37; 65K05; 90C30
dc.titleA Globally Convergent LCL Method for Nonlinear Optimization
dc.typetext

Files

Collections

arXiv