A superlinearly and quadratically convergent SQP type feasible method for constrained optimization
From MaRDI portal
Publication:1589812
DOI10.1007/S11766-000-0057-9zbMATH Open0988.90051OpenAlexW2320608532MaRDI QIDQ1589812FDOQ1589812
Authors: Shengjia Xue, Jinbao Jian, Kecun Zhang 
Publication date: 16 July 2002
Published in: Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11766-000-0057-9
Recommendations
- A feasible SQP algorithm with superlinear convergence for inequality constrained optimization
- A superlinearly and quadratically convergent SQP algorithm for inequality constrained optimization.
- A type of efficient feasible SQP algorithms for inequality constrained optimization
- A simple feasible SQP algorithm for inequality constrained optimization
- A simple feasible SQP method for inequality constrained optimization with global and superlinear convergence
Numerical mathematical programming methods (65K05) Methods of successive quadratic programming type (90C55) Nonlinear programming (90C30)
Cites Work
- A Superlinearly Convergent Feasible Method for the Solution of Inequality Constrained Optimization Problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Robust recursive quadratic programming algorithm model with global and superlinear convergence properties
- New Results on a Continuously Differentiable Exact Penalty Function
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (24)
- Title not available (Why is that?)
- A modified SQP algorithm for minimax problems
- A feasible descent SQP algorithm for general constrained optimization without strict complemen\-tar\-ity
- A superlinearly convergent method of feasible directions.
- A method combining norm-relaxed QP subproblems with systems of linear equations for constrained optimization
- A strongly convergent norm-relaxed method of strongly sub-feasible direction for optimization with nonlinear equality and inequality constraints
- Loss of Superlinear Convergence for an SQP-Type Method with Conic Constraints
- Asymptotic rates of convergence of SQP-type methods of feasible directions.
- A feasible SQP algorithm with superlinear convergence for inequality constrained optimization
- A new feasible descent algorithm combining SQP with generalized projection for optimization problems without strict complementarity
- New sequential quadratically-constrained quadratic programming method of feasible directions and its convergence rate
- A globally and superlinearly convergent feasible SQP algorithm for degenerate constrained optimization
- A sequential quadratic programming algorithm for nonlinear minimax problems
- A sequential quadratically constrained quadratic programming method of feasible directions
- An active set sequential quadratic programming algorithm for nonlinear optimisation
- A New Superlinearly Convergent Strongly Subfeasible Sequential Quadratic Programming Algorithm for Inequality-Constrained Optimization
- A superlinearly and quadratically convergent SQP algorithm for inequality constrained optimization.
- Two-step and three-step Q-superlinear convergence of SQP methods
- A new superlinearly convergent norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization
- An SQP feasible descent algorithm for nonlinear inequality constrained optimization without strict complementarity
- A Superlinearly Convergent Feasible Method for the Solution of Inequality Constrained Optimization Problems
- A superlinearly convergent splitting feasible sequential quadratic optimization method for two-block large-scale smooth optimization
- The superlinear convergence of a new quasi-Newton-SQP method for constrained optimization
- Title not available (Why is that?)
This page was built for publication: A superlinearly and quadratically convergent SQP type feasible method for constrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1589812)
