Globally and superlinearly convergent QP-free algorithm for nonlinear constrained optimization
From MaRDI portal
Publication:700746
DOI10.1023/A:1014882909302zbMath1027.90089OpenAlexW1899476613MaRDI QIDQ700746
Publication date: 8 October 2002
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1014882909302
global convergenceconstrained optimizationsuperlinear convergenceactive set strategiesQP-free method
Related Items (10)
An infeasible nonmonotone SSLE algorithm for nonlinear programming ⋮ An infeasible QP-free algorithm without a penalty function or a filter for nonlinear inequality-constrained optimization ⋮ An improved feasible QP-free algorithm for inequality constrained optimization ⋮ An improved interior-type feasible QP-free algorithm for inequality constrained optimization problems ⋮ A sequential equality constrained quadratic programming algorithm for inequality constrained optimization ⋮ A feasible SQP method for nonlinear programming ⋮ Sequential systems of linear equations method for general constrained optimization without strict complementarity ⋮ A superlinearly convergent strongly sub-feasible SSLE-type algorithm with working set for nonlinearly constrained optimization ⋮ An infeasible active-set QP-free algorithm for general nonlinear programming ⋮ An infeasible QP-free method without a penalty function for nonlinear inequality constrained optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- An SQP method for general nonlinear programs using only equality constrained subproblems
- A QP-free constrained Newton-type method for variational inequality problems
- Robust recursive quadratic programming algorithm model with global and superlinear convergence properties
- A robust sequential quadratic programming method
- Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems
- Minimization of \(SC^ 1\) functions and the Maratos effect
- A nonsmooth version of Newton's method
- A New QP-Free, Globally Convergent, Locally Superlinearly Convergent Algorithm For Inequality Constrained Optimization
- A multiplier method with automatic limitation of penalty growth
- Computing a Trust Region Step
- On the Characterization of q-Superlinear Convergence of Quasi-Newton Methods for Constrained Optimization
- A Superlinearly Convergent Feasible Method for the Solution of Inequality Constrained Optimization Problems
- Recursive quadratic programming methods based on the augmented lagrangian
- A QP-Free, Globally Convergent, Locally Superlinearly Convergent Algorithm for Inequality Constrained Optimization
- Strongly Regular Generalized Equations
- On the Local Convergence of Quasi-Newton Methods for Constrained Optimization
- New Results on a Continuously Differentiable Exact Penalty Function
- On the Convergence of Some Constrained Minimization Algorithms Based on Recursive Quadratic Programming
- A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods
- A Truncated Newton Algorithm for Large Scale Box Constrained Optimization
This page was built for publication: Globally and superlinearly convergent QP-free algorithm for nonlinear constrained optimization
