Infeasibility Detection and SQP Methods for Nonlinear Optimization
From MaRDI portal
Publication:3083287
DOI10.1137/080738222zbMath1211.90179OpenAlexW2006449495MaRDI QIDQ3083287
Byrd, Richard H., Nocedal, Jorge, Frank E. Curtis
Publication date: 21 March 2011
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/080738222
Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Methods of successive quadratic programming type (90C55)
Related Items (35)
An inexact first-order method for constrained nonlinear optimization ⋮ Using Interior-Point Methods within an Outer Approximation Framework for Mixed Integer Nonlinear Programming ⋮ A superlinearly convergent hybrid algorithm for solving nonlinear programming ⋮ A stabilized filter SQP algorithm for nonlinear programming ⋮ A competitive inexact nonmonotone filter SQP method: convergence analysis and numerical results ⋮ A primal-dual augmented Lagrangian penalty-interior-point filter line search algorithm ⋮ A penalty-interior-point algorithm for nonlinear constrained optimization ⋮ An interior point method for nonlinear programming with infeasibility detection capabilities ⋮ On the augmented subproblems within sequential methods for nonlinear programming ⋮ An Exact Penalty Method for Nonconvex Problems Covering, in Particular, Nonlinear Programming, Semidefinite Programming, and Second-Order Cone Programming ⋮ A Nonmonotone Filter SQP Method: Local Convergence and Numerical Results ⋮ An augmented Lagrangian method for equality constrained optimization with rapid infeasibility detection capabilities ⋮ Multiobjective optimization with least constraint violation: optimality conditions and exact penalization ⋮ Study on convex optimization with least constraint violation under a general measure ⋮ The augmented Lagrangian method can approximately solve convex optimization with least constraint violation ⋮ A Newton-CG Based Augmented Lagrangian Method for Finding a Second-Order Stationary Point of Nonconvex Equality Constrained Optimization with Complexity Guarantees ⋮ An overview of nonlinear optimization ⋮ Handling infeasibility in a large-scale nonlinear optimization algorithm ⋮ Optimal control problems with incomplete and different integral time domains in the objective and constraints ⋮ A modified filter SQP method as a tool for optimal control of nonlinear systems with spatio-temporal dynamics ⋮ Global convergence of a robust filter SQP algorithm ⋮ Two-phase-SQP method with higher-order convergence property ⋮ Rapid infeasibility detection in a mixed logarithmic barrier-augmented Lagrangian method for nonlinear optimization ⋮ An infeasibility certificate for nonlinear programming based on Pareto criticality condition ⋮ A new superlinearly convergent algorithm of combining QP subproblem with system of linear equations for nonlinear optimization ⋮ A feasible filter SQP algorithm with global and local convergence ⋮ A globally convergent primal-dual interior-point relaxation method for nonlinear programs ⋮ Augmented Lagrangian methods for nonlinear programming with possible infeasibility ⋮ A superlinear convergence feasible sequential quadratic programming algorithm for bipedal dynamic walking robot via discrete mechanics and optimal control ⋮ A primal-dual interior-point method capable of rapidly detecting infeasibility for nonlinear programs ⋮ An infeasible-start framework for convex quadratic optimization, with application to constraint-reduced interior-point and other methods ⋮ An Active-Set Method for Quadratic Programming Based On Sequential Hot-Starts ⋮ An inexact ℓ1penalty SQP algorithm for PDE-constrained optimization with an application to shape optimization in linear elasticity ⋮ Optimality properties of an augmented Lagrangian method on infeasible problems ⋮ A novel augmented Lagrangian method of multipliers for optimization with general inequality constraints
Uses Software
This page was built for publication: Infeasibility Detection and SQP Methods for Nonlinear Optimization
