Handling infeasibility in a large-scale nonlinear optimization algorithm
From MaRDI portal
Publication:430999
DOI10.1007/s11075-012-9561-2zbMath1256.65058OpenAlexW1982935349MaRDI QIDQ430999
Leandro da Fonseca Prudente, José Mario Martínez
Publication date: 26 June 2012
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-012-9561-2
convergenceconstrained optimizationnumerical experimentsnonlinear programmingaugmented Lagrangian algorithminfeasible pointsKarush-Kuhn-Tucker pointstrial-and-error process
Related Items
Continuous and discrete Zhang dynamics for real-time varying nonlinear optimization, On the augmented subproblems within sequential methods for nonlinear programming, An augmented Lagrangian method for equality constrained optimization with rapid infeasibility detection capabilities, Modified Newton integration algorithm with noise suppression for online dynamic nonlinear optimization, Rapid infeasibility detection in a mixed logarithmic barrier-augmented Lagrangian method for nonlinear optimization, Augmented Lagrangians with possible infeasibility and finite termination for global nonlinear programming, Augmented Lagrangian methods for nonlinear programming with possible infeasibility, Optimality properties of an augmented Lagrangian method on infeasible problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- 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
- Optimal quadratic programming algorithms. With applications to variational inequalities
- Analysis and implementation of a dual algorithm for constrained optimization
- On the relation between constant positive linear dependence condition and quasinormality constraint qualification
- Large-scale active-set box-constrained optimization method with spectral projected gradients
- Interior-point methods for nonconvex nonlinear programming: Filter methods and merit functions
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Multiplier and gradient methods
- Infeasibility Detection and SQP Methods for Nonlinear Optimization
- A New Sequential Optimality Condition for Constrained Optimization and Algorithmic Consequences
- Improving ultimate convergence of an augmented Lagrangian method
- On Augmented Lagrangian Methods with General Lower-Level Constraints
- Augmented Lagrangians with Adaptive Precision Control for Quadratic Programming with Simple Bounds and Equality Constraints
- 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
- Global Convergence of a Trust-Region SQP-Filter Algorithm for General Nonlinear Programming
- Two New Weak Constraint Qualifications and Applications
- On sequential optimality conditions for smooth constrained optimization
- A trust region method based on interior point techniques for nonlinear programming.
- Nonlinear programming without a penalty function.
