A method combining norm-relaxed QP subproblems with systems of linear equations for constrained optimization
DOI10.1016/j.cam.2008.03.048zbMath1160.90007OpenAlexW1977625243MaRDI QIDQ2378276
Xiao-Yan Ke, Hai-Yan Zheng, Jin-Bao Jian, Chun-Ming Tang
Publication date: 7 January 2009
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2008.03.048
constrained optimizationsystems of linear equationsnorm-relaxed SQP methodmethod of strongly sub-feasible directionsglobal convergence, superlinear convergence
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)
Related Items (9)
Uses Software
Cites Work
- A new superlinearly convergent norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization
- More test examples for nonlinear programming codes
- Test examples for nonlinear programming codes
- A generalization of the norm-relaxed method of feasible directions
- Norm-relaxed method of feasible directions for solving nonlinear programming problems
- A new SQP method of feasible directions for nonlinear programming.
- A mixed superlinearly convergent algorithm with nonmonotone search for constrained optimizations
- A superlinearly and quadratically convergent SQP type feasible method for constrained optimization
- On combining feasibility, descent and superlinear convergence in inequality constrained optimization
- A new norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization
- A Computationally Efficient Feasible Sequential Quadratic Programming Algorithm
- A Superlinearly Convergent Feasible Method for the Solution of Inequality Constrained Optimization Problems
- A Feasible Sequential Linear Equation Method for Inequality Constrained Optimization
- CUTEr and SifDec
- A superlinearly convergent method of feasible directions.
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A method combining norm-relaxed QP subproblems with systems of linear equations for constrained optimization