An improved strongly sub-feasible SSLE method for optimization problems and numerical experiments

DOI10.1016/j.amc.2011.02.012zbMath1220.65070OpenAlexW2122230127MaRDI QIDQ531641

Su-Min Yang, Xing-De Mo, Jin-Bao Jian

Publication date: 19 April 2011

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

Full work available at URL: https://doi.org/10.1016/j.amc.2011.02.012

zbMATH Keywords

convergenceconstrained optimizationnumerical experimentsbidirectional Armijo linemethod of strongly sub-feasible directionssequential systems of linear equations (SSLE)

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Related Items (2)

A fast convergent sequential linear equation method for inequality constrained optimization without strict complementarity ⋮ A superlinearly convergent SQP method without boundedness assumptions on any of the iterative sequences

Uses Software

• CUTEr
• CUTE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• More test examples for nonlinear programming codes
• Test examples for nonlinear programming codes
• Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems
• 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
• CUTE

This page was built for publication: An improved strongly sub-feasible SSLE method for optimization problems and numerical experiments