On the behaviour of constrained optimization methods when Lagrange multipliers do not exist
From MaRDI portal
Publication:5746720
DOI10.1080/10556788.2013.841692zbMath1282.90170MaRDI QIDQ5746720
L. T. Santos, Benar Fux Svaiter, José Mario Martínez, Roberto Andreani
Publication date: 7 February 2014
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2013.841692
stopping criteria; constrained optimization; Newton-Lagrange method; sequential optimality conditions
90C30: Nonlinear programming
90C46: Optimality conditions and duality in mathematical programming
90C55: Methods of successive quadratic programming type
Related Items
Optimality Conditions and Constraint Qualifications for Generalized Nash Equilibrium Problems and Their Practical Implications, Complexity and performance of an Augmented Lagrangian algorithm, Comments on: Critical Lagrange multipliers: what we currently know about them, how they spoil our lives, and what we can do about it, On the fulfillment of the complementary approximate Karush-Kuhn-Tucker conditions and algorithmic applications, Newton's method may fail to recognize proximity to optimal points in constrained optimization, The inexact log-exponential regularization method for mathematical programs with vertical complementarity constraints, A Cone-Continuity Constraint Qualification and Algorithmic Consequences
Uses Software
Cites Work
- Unnamed Item
- Stabilized SQP revisited
- Stopping rules and backward error analysis for bound-constrained optimization
- An interior point algorithm with inexact step computation in function space for state constrained optimal control
- A nonmonotone filter method for nonlinear optimization
- A relaxed constant positive linear dependence constraint qualification and applications
- A filter SQP algorithm without a feasibility restoration phase
- Nonlinear programming without a penalty function or a filter
- New theoretical results on recursive quadratic programming algorithms
- Superlinear convergence of a stabilized SQP method to a degenerate solution
- Extended convergence results for the method of multipliers for nonstrictly binding inequality constraints
- A practical optimality condition without constraint qualifications for nonlinear programming
- On the quadratic convergence of the Levenberg-Marquardt method without nonsingularity assumption
- On the relation between constant positive linear dependence condition and quasinormality constraint qualification
- An exact augmented Lagrangian function for nonlinear programming with two-sided con\-straints
- Interior-point methods for nonconvex nonlinear programming: Filter methods and merit functions
- A quasi-Newton strategy for the SSQP method for variational inequality and optimization problems
- Stabilized sequential quadratic programming for optimization and a stabilized Newton-type method for variational problems
- A null-space primal-dual interior-point algorithm for nonlinear optimization with nice convergence properties
- A truncated Newton method in an augmented Lagrangian framework for nonlinear programming
- Constrained optimization and image space analysis. Vol. 1: Separation of sets and optimality conditions
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- An Augmented Lagrangian Function with Improved Exactness Properties
- Algorithm 896
- An exact penalty-Lagrangian approach for large-scale nonlinear programming
- A New Sequential Optimality Condition for Constrained Optimization and Algorithmic Consequences
- A Sequential Quadratic Programming Method Without A Penalty Function or a Filter for Nonlinear Equality Constrained Optimization
- Dynamic Control of Infeasibility in Equality Constrained Optimization
- On Augmented Lagrangian Methods with General Lower-Level Constraints
- Recursive quadratic programming methods based on the augmented lagrangian
- Numerical Optimization
- Trust Region Methods
- On the Constant Positive Linear Dependence Condition and Its Application to SQP Methods
- On the Global Convergence of a Filter--SQP Algorithm
- Modifying SQP for Degenerate Problems
- Global Convergence of a Trust-Region SQP-Filter Algorithm for General Nonlinear Programming
- Two New Weak Constraint Qualifications and Applications
- Interior point methods for large-scale nonlinear programming
- On sequential optimality conditions for smooth constrained optimization
