Globally and superlinearly convergent QP-free algorithm for nonlinear constrained optimization
From MaRDI portal
Publication:700746
DOI10.1023/A:1014882909302zbMATH Open1027.90089OpenAlexW1899476613MaRDI QIDQ700746FDOQ700746
Authors: Liqun Qi, Yufei Yang 
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
Recommendations
- A globally and superlinearly convergent SQP algorithm for nonlinear constrained optimization.
- A globally and superlinearly convergent feasible QP-free method for nonlinear programming
- A QP-Free, Globally Convergent, Locally Superlinearly Convergent Algorithm for Inequality Constrained Optimization
- A QP-free algorithm without a penalty function or a filter for nonlinear general-constrained optimization
- A new QP-free, globally convergent, locally superlinearly convergent algorithm for inequality constrained optimization
constrained optimizationglobal convergencesuperlinear convergenceactive set strategiesQP-free method
Cites Work
- Computing a Trust Region Step
- Title not available (Why is that?)
- A nonsmooth version of Newton's method
- Strongly Regular Generalized Equations
- A QP-free constrained Newton-type method for variational inequality problems
- Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems
- A new QP-free, globally convergent, locally superlinearly convergent algorithm for inequality constrained optimization
- A Superlinearly Convergent Feasible Method for the Solution of Inequality Constrained Optimization Problems
- A QP-Free, Globally Convergent, Locally Superlinearly Convergent Algorithm for Inequality Constrained Optimization
- Recursive quadratic programming methods based on the augmented lagrangian
- Title not available (Why is that?)
- A Truncated Newton Algorithm for Large Scale Box Constrained Optimization
- A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods
- A robust sequential quadratic programming method
- An SQP method for general nonlinear programs using only equality constrained subproblems
- On the Characterization of q-Superlinear Convergence of Quasi-Newton Methods for Constrained Optimization
- On the Local Convergence of Quasi-Newton Methods for Constrained Optimization
- Minimization of \(SC^ 1\) functions and the Maratos effect
- Robust recursive quadratic programming algorithm model with global and superlinear convergence properties
- New Results on a Continuously Differentiable Exact Penalty Function
- A multiplier method with automatic limitation of penalty growth
- On the Convergence of Some Constrained Minimization Algorithms Based on Recursive Quadratic Programming
Cited In (16)
- A sequential equality constrained quadratic programming algorithm for inequality constrained optimization
- Title not available (Why is that?)
- A feasible SQP method for nonlinear programming
- Sequential systems of linear equations method for general constrained optimization without strict complementarity
- An infeasible nonmonotone SSLE algorithm for nonlinear programming
- A globally and superlinearly convergent feasible QP-free method for nonlinear programming
- An improved interior-type feasible QP-free algorithm for inequality constrained optimization problems
- Sequential penalty algorithm for nonlinear constrained optimization
- A globally and superlinearly convergent SQP algorithm for nonlinear constrained optimization.
- 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 infeasible QP-free method without a penalty function for nonlinear inequality constrained optimization
- An infeasible active-set QP-free algorithm for general nonlinear programming
- A quadratically approximate framework for constrained optimization, global and local convergence
- A superlinearly convergent strongly sub-feasible SSLE-type algorithm with working set for nonlinearly constrained optimization
- Title not available (Why is that?)
Uses Software
This page was built for publication: Globally and superlinearly convergent QP-free algorithm for nonlinear constrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q700746)
