A type of efficient feasible SQP algorithms for inequality constrained optimization
DOI10.1016/J.AMC.2009.10.055zbMATH Open1192.65078OpenAlexW2054346894MaRDI QIDQ846474FDOQ846474
Authors: Zhong Jin, Yuqing Wang
Publication date: 9 February 2010
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2009.10.055
Recommendations
- An efficient feasible SQP algorithm for inequality constrained optimization
- A simple feasible SQP algorithm for inequality constrained optimization
- An improved SQP algorithm for inequality constrained optimization
- A feasible SQP algorithm with superlinear convergence for inequality constrained optimization
- A variant of feasible descent SQP method for inequality constrained optimization
- A feasible equality constrained SQP algorithm for nonlinear optimization
- A feasible SQP descent method for inequality constrained optimization problems and its convergence
- A SQP method for inequality constrained optimization.
- An SQP algorithm with equality constrained subproblems for nonlinear inequality constrained optimization
- An Inexact SQP Method for Equality Constrained Optimization
global convergencesuperlinear convergenceinequality constrained optimizationsuccessive quadratic programming (SQP)
Numerical mathematical programming methods (65K05) Methods of successive quadratic programming type (90C55) Nonlinear programming (90C30)
Cites Work
- Superlinearly convergent variable metric algorithms for general nonlinear programming problems
- Test examples for nonlinear programming codes
- Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems
- A computationally efficient feasible sequential quadratic programming algorithm
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- On combining feasibility, descent and superlinear convergence in inequality constrained optimization
- On the Local Convergence of Quasi-Newton Methods for Constrained Optimization
- A recursive quadratic programming algorithm that uses differentiable exact penalty functions
- A note on quasi-newton formulae for sparse second derivative matrices
- An improved SQP algorithm for inequality constrained optimization
- An efficient feasible SQP algorithm for inequality constrained optimization
Cited In (13)
- A sequential equality constrained quadratic programming algorithm for inequality constrained optimization
- A simply sequential quadratically constrained quadratic programming method of strongly sub-feasible directions for constrained optimization
- An improved sequential quadratic programming algorithm for solving general nonlinear programming problems
- A simple feasible SQP method for inequality constrained optimization with global and superlinear convergence
- An efficient feasible SQP algorithm for inequality constrained optimization
- A superlinearly and quadratically convergent SQP type feasible method for constrained optimization
- A feasible SQP algorithm with superlinear convergence for inequality constrained optimization
- A feasible trust region SQP method with nonmonotone line search for inequality constrained optimization
- A simple feasible SQP algorithm for inequality constrained optimization
- A New Superlinearly Convergent Strongly Subfeasible Sequential Quadratic Programming Algorithm for Inequality-Constrained Optimization
- A Superlinearly Convergent Feasible Method for the Solution of Inequality Constrained Optimization Problems
- A Robust Algorithm for Optimization with General Equality and Inequality Constraints
- Title not available (Why is that?)
This page was built for publication: A type of efficient feasible SQP algorithms for inequality constrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q846474)