A Sequential Quadratic Programming Method Without A Penalty Function or a Filter for Nonlinear Equality Constrained Optimization
From MaRDI portal
Publication:3093594
DOI10.1137/080739884zbMath1233.90257OpenAlexW2091442156MaRDI QIDQ3093594
Publication date: 18 October 2011
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/080739884
regularitysequential quadratic programmingfilterpenalty functionglobal and local convergence analysis
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Methods of successive quadratic programming type (90C55)
Related Items (26)
A globally convergent penalty-free method for optimization with equality constraints and simple bounds ⋮ On the global convergence of a projective trust region algorithm for nonlinear equality constrained optimization ⋮ On a globally convergent trust region algorithm with infeasibility control for equality constrained optimization ⋮ A primal-dual augmented Lagrangian penalty-interior-point filter line search algorithm ⋮ An infeasible QP-free algorithm without a penalty function or a filter for nonlinear inequality-constrained optimization ⋮ A sequential quadratic programming algorithm without a penalty function, a filter or a constraint qualification for inequality constrained optimization ⋮ A penalty-free method with superlinear convergence for equality constrained optimization ⋮ A filter sequential adaptive cubic regularization algorithm for nonlinear constrained optimization ⋮ Simultaneous Identification and Denoising of Dynamical Systems ⋮ A penalty-free infeasible approach for a class of nonsmooth optimization problems over the Stiefel manifold ⋮ The regularization continuation method for optimization problems with nonlinear equality constraints ⋮ Global and local convergence of a nonmonotone SQP method for constrained nonlinear optimization ⋮ Penalty-free method for nonsmooth constrained optimization via radial basis functions ⋮ A QP-free algorithm without a penalty function or a filter for nonlinear general-constrained optimization ⋮ An adaptively regularized sequential quadratic programming method for equality constrained optimization ⋮ A Filter Active-Set Algorithm for Ball/Sphere Constrained Optimization Problem ⋮ Two-phase-SQP method with higher-order convergence property ⋮ On the behaviour of constrained optimization methods when Lagrange multipliers do not exist ⋮ A penalty-free method with line search for nonlinear equality constrained optimization ⋮ A trust-region SQP method without a penalty or a filter for nonlinear programming ⋮ A line search SQP method without a penalty or a filter ⋮ Ghost Penalties in Nonconvex Constrained Optimization: Diminishing Stepsizes and Iteration Complexity ⋮ A primal-dual interior-point relaxation method with global and rapidly local convergence for nonlinear programs ⋮ A smooth QP-free algorithm without a penalty function or a filter for mathematical programs with complementarity constraints ⋮ A central path interior point method for nonlinear programming and its local convergence ⋮ A novel augmented Lagrangian method of multipliers for optimization with general inequality constraints
Uses Software
This page was built for publication: A Sequential Quadratic Programming Method Without A Penalty Function or a Filter for Nonlinear Equality Constrained Optimization
