A new SQP method of feasible directions for nonlinear programming.

DOI10.1016/S0096-3003(02)00832-9zbMath1174.90894OpenAlexW2088228560MaRDI QIDQ1415268

Ke-Cun Zhang, Zhi Bin Zhu

Publication date: 3 December 2003

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0096-3003(02)00832-9

zbMATH Keywords

convergencenonlinear programmingsuperlinear convergenceSQP methodglobalmethod of feasible directions

Mathematics Subject Classification ID

Nonlinear programming (90C30) Methods of successive quadratic programming type (90C55)

Related Items

A fast convergent sequential linear equation method for inequality constrained optimization without strict complementarity, A superlinearly convergent norm-relaxed SQP method of strongly sub-feasible directions for constrained optimization without strict complementarity, 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 new superlinearly convergent norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization, A strongly convergent norm-relaxed method of strongly sub-feasible direction for optimization with nonlinear equality and inequality constraints, The theoretical analysis and algorithm on a class of optimal curve fitting problems, A superlinearly convergent method of quasi-strongly sub-feasible directions with active set identifying for constrained optimization, A norm-relaxed method of feasible directions for finely discretized problems from semi-infinite programming, A superlinearly convergent norm-relaxed method of quasi-strongly sub-feasible direction for inequality constrained minimax problems, A new norm-relaxed SQP algorithm with global convergence, A decomposition algorithm for solving large-scale quadratic programming problems, A new norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A generalization of the norm-relaxed method of feasible directions
• Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems
• On combining feasibility, descent and superlinear convergence in inequality constrained optimization
• A Superlinearly Convergent Feasible Method for the Solution of Inequality Constrained Optimization Problems
• A surperlinearly convergent algorithm for constrained optimization problems
• Avoiding the Maratos Effect by Means of a Nonmonotone Line Search. II. Inequality Constrained Problems—Feasible Iterates
• Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear-programming algorithms
• Superlinearly convergent variable metric algorithms for general nonlinear programming problems
• Nonlinear leastpth optimization and nonlinear programming
• On the Convergence of Some Feasible Direction Algorithms for Nonlinear Programming
• On the rate of convergence of certain methods of centers
• A superlinearly convergent method of feasible directions.