A superlinearly convergent strongly sub-feasible SSLE-type algorithm with working set for nonlinearly constrained optimization

DOI10.1016/j.cam.2008.07.017zbMath1162.65032OpenAlexW2130835075MaRDI QIDQ1004010

Jin-Bao Jian, Wei-Xin Cheng

Publication date: 2 March 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.07.017

zbMATH Keywords

nonlinear optimizationglobal and superlinear convergenceinequality constraintssequential systems of linear equationsworking set

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Methods of quasi-Newton type (90C53) Numerical methods based on nonlinear programming (49M37)

Related Items (6)

A globally convergent QP-free algorithm for inequality constrained minimax optimization ⋮ AN INFEASIBLE SSLE FILTER ALGORITHM FOR GENERAL CONSTRAINED OPTIMIZATION WITHOUT STRICT COMPLEMENTARITY ⋮ On the accurate identification of active set for constrained minimax problems ⋮ The use of QP-free algorithm in the limit analysis of slope stability ⋮ A Filter Active-Set Algorithm for Ball/Sphere Constrained Optimization Problem ⋮ New active set identification for general constrained optimization and minimax problems

Uses Software

• CUTEr
• CUTE

Cites Work

• Unnamed Item
• Unnamed Item
• Sequential systems of linear equations method for general constrained optimization without strict complementarity
• Globally and superlinearly convergent QP-free algorithm for nonlinear constrained optimization
• 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 QP-free constrained Newton-type method for variational inequality problems
• Sequential systems of linear equations algorithm for nonlinear optimization problems with general constraints
• A robust sequential quadratic programming method
• On combining feasibility, descent and superlinear convergence in inequality constrained optimization
• A New QP-Free, Globally Convergent, Locally Superlinearly Convergent Algorithm 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 QP-Free, Globally Convergent, Locally Superlinearly Convergent Algorithm for Inequality Constrained Optimization
• Strongly Regular Generalized Equations
• A surperlinearly convergent algorithm for constrained optimization problems
• On the Accurate Identification of Active Constraints
• CUTE
• A Feasible Sequential Linear Equation Method for Inequality Constrained Optimization
• On the Constant Positive Linear Dependence Condition and Its Application to SQP Methods

This page was built for publication: A superlinearly convergent strongly sub-feasible SSLE-type algorithm with working set for nonlinearly constrained optimization