A simply sequential quadratically constrained quadratic programming method of strongly sub-feasible directions for constrained optimization
From MaRDI portal
Publication:2841139
DOI10.1080/02331934.2011.611514zbMath1273.90202OpenAlexW2022619808MaRDI QIDQ2841139
Su-Min Yang, Jin-Bao Jian, Chun-Ming Tang
Publication date: 24 July 2013
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2011.611514
rate of convergenceglobal convergencesystems of linear equationsstrongly sub-feasible directionssecond-order approximate conditionsequential quadratically constrained quadratic programming
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)
Related Items
A method combining norm-relaxed QCQP subproblems with active set identification for inequality constrained optimization, A sequential quadratic programming algorithm without a penalty function, a filter or a constraint qualification for inequality constrained optimization, A QP-free algorithm without a penalty function or a filter for nonlinear general-constrained optimization
Uses Software
Cites Work
- A type of efficient feasible SQP algorithms for inequality constrained optimization
- A sequential quadratically constrained quadratic programming method with an augmented Lagrangian line search function
- Sequential quadratically constrained quadratic programming norm-relaxed algorithm of strongly sub-feasible directions
- Norm-relaxed method of feasible directions for solving nonlinear programming problems
- Convergence analysis of norm-relaxed method of feasible directions
- New sequential quadratically-constrained quadratic programming method of feasible directions and its convergence rate
- A method combining norm-relaxed QP subproblems with systems of linear equations for constrained optimization
- A sequential quadratically constrained quadratic programming method of feasible directions
- A new norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization
- A Computationally Efficient Feasible Sequential Quadratic Programming Algorithm
- A surperlinearly convergent algorithm for constrained optimization problems
- A Sequential Quadratically Constrained Quadratic Programming Method for Differentiable Convex Minimization
- Rate of Convergence of a Class of Methods of Feasible Directions
- On the Sequential Quadratically Constrained Quadratic Programming Methods
- A superlinearly convergent method of feasible directions.