A Globally Convergent Linearly Constrained Lagrangian Method for Nonlinear Optimization

From MaRDI portal
Publication:5317526

DOI10.1137/S1052623402419789zbMath1077.90065MaRDI QIDQ5317526

Michael P. Friedlander, Michael A. Saunders

Publication date: 16 September 2005

Published in: SIAM Journal on Optimization (Search for Journal in Brave)




Related Items (16)

Complexity of an inexact proximal-point penalty method for constrained smooth non-convex optimizationOn R-linear convergence of semi-monotonic inexact augmented Lagrangians for bound and equality constrained quadratic programming problems with applicationParameter range reduction for ODE models using cumulative backward differentiation formulasA practical relative error criterion for augmented LagrangiansOptimal management of a bioreactor for eutrophicated water treatment: a numerical approachOn attraction of linearly constrained Lagrangian methods and of stabilized and quasi-Newton SQP methods to critical multipliersA new Lagrangian-based first-order method for nonconvex constrained optimizationA primal-dual augmented LagrangianNewton-type methods: a broader viewInexact Josephy-Newton framework for generalized equations and its applications to local analysis of Newtonian methods for constrained optimizationConvergence properties of modified and partially-augmented Lagrangian methods for mathematical programs with complementarity constraintsAn Augmented Lagrangian Based Algorithm for Distributed NonConvex OptimizationA Sequential Method for a Class of Stable Mathematical Programming ProblemsNumerical optimization for constrained image registrationCritical Lagrange multipliers: what we currently know about them, how they spoil our lives, and what we can do about itSequential Linearization Method for Bound-Constrained Mathematical Programs with Complementarity Constraints


Uses Software



This page was built for publication: A Globally Convergent Linearly Constrained Lagrangian Method for Nonlinear Optimization