A modified SLP algorithm and its global convergence

DOI10.1016/j.cam.2011.03.030zbMath1218.65058OpenAlexW1993238201MaRDI QIDQ548334

Meihua Wang, Cheng-Xian Xu, Ai-Qun Huang

Publication date: 28 June 2011

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.2011.03.030

zbMATH Keywords

global convergencenonlinear programmingfilterSLP

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Methods of successive quadratic programming type (90C55)

Related Items

A Jacobi spectral collocation method for solving multi-dimensional nonlinear fractional sub-diffusion equations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Log-sigmoid nonlinear Lagrange method for nonlinear optimization problems over second-order cones
• Test examples for nonlinear programming codes
• Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds
• Feasible directions algorithms for optimization problems with equality and inequality constraints
• A necessary and sufficient regularity condition to have bounded multipliers in nonconvex programming
• A Trust Region Method for Solving Generalized Complementarity Problems
• On the Global Convergence of a Filter--SQP Algorithm
• Nonlinear programming without a penalty function.