AN INFEASIBLE SSLE FILTER ALGORITHM FOR GENERAL CONSTRAINED OPTIMIZATION WITHOUT STRICT COMPLEMENTARITY

DOI10.1142/S0217595911003284zbMath1230.90183OpenAlexW2155856472MaRDI QIDQ3013564

Wenjuan Xue, Pu, Dingguo, Chungen Shen

Publication date: 18 July 2011

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0217595911003284

zbMATH Keywords

global convergencesuperlinear convergenceline search

Mathematics Subject Classification ID

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

Related Items (1)

A Filter Active-Set Algorithm for Ball/Sphere Constrained Optimization Problem

Cites Work

• A feasible descent SQP algorithm for general constrained optimization without strict complemen\-tar\-ity
• Sequential systems of linear equations method for general constrained optimization without strict complementarity
• A superlinearly convergent strongly sub-feasible SSLE-type algorithm with working set for nonlinearly constrained optimization
• A QP-free constrained Newton-type method for variational inequality problems
• Stability in the presence of degeneracy and error estimation
• Local analysis of Newton-type methods for variational inequalities and nonlinear programming
• An algorithm of sequential systems of linear equations for nonlinear optimization problems with arbitrary initial point
• Sequential systems of linear equations algorithm for nonlinear optimization problems with general constraints
• Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems
• Minimization of \(SC^ 1\) functions and the Maratos effect
• A New QP-Free, Globally Convergent, Locally Superlinearly Convergent Algorithm For Inequality Constrained Optimization
• A Feasible Active Set QP-Free Method for Nonlinear Programming
• Active Set Identification in Nonlinear Programming
• A QP-Free, Globally Convergent, Locally Superlinearly Convergent Algorithm for Inequality Constrained Optimization
• On the Accurate Identification of Active Constraints
• Trust Region Methods
• Degenerate Nonlinear Programming with a Quadratic Growth Condition
• A Truncated Newton Algorithm for Large Scale Box Constrained Optimization
• On the Global Convergence of a Filter--SQP Algorithm
• Global Convergence of a Trust-Region SQP-Filter Algorithm for General Nonlinear Programming
• Line Search Filter Methods for Nonlinear Programming: Motivation and Global Convergence
• Line Search Filter Methods for Nonlinear Programming: Local Convergence
• CUTEr and SifDec
• Benchmarking optimization software with performance profiles.
• Nonlinear programming without a penalty function.

This page was built for publication: AN INFEASIBLE SSLE FILTER ALGORITHM FOR GENERAL CONSTRAINED OPTIMIZATION WITHOUT STRICT COMPLEMENTARITY