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

DOI10.1016/J.CAM.2008.07.017MaRDI QIDQ1004010zbMATHOpenAlexFDO

Authors Jinbao Jian, Weixin 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 optimizationinequality constraintsglobal and superlinear convergencesequential systems of linear equationsworking set

Mathematics Subject Classification ID

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

Recommendations

• A superlinearly convergent SSLE algorithm for optimization problems with linear complementarity constraints
• scientific article; zbMATH DE number 5898052
• scientific article; zbMATH DE number 851560
• A superlinearly convergent FSSLE algorithm for inequality constrained optimization
• scientific article; zbMATH DE number 1159542
• A superlinearly convergent method of quasi-strongly sub-feasible directions with active set identifying for constrained optimization
• scientific article; zbMATH DE number 4154228
• A superlinearly convergent SSDP algorithm for nonlinear semidefinite programming
• An improved strongly sub-feasible SSLE method for optimization problems and numerical experiments
• A new superlinearly convergent norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization

Cites work

• scientific article; zbMATH DE number 3583207 (Why is no real title available?)
• A Feasible Sequential Linear Equation Method for Inequality Constrained Optimization
• A QP-Free, Globally Convergent, Locally Superlinearly Convergent Algorithm for Inequality Constrained Optimization
• A QP-free constrained Newton-type method for variational inequality problems
• A Superlinearly Convergent Feasible Method for the Solution of Inequality Constrained Optimization Problems
• A computationally efficient feasible sequential quadratic programming algorithm
• A new QP-free, globally convergent, locally superlinearly convergent algorithm for inequality constrained optimization
• A new superlinearly convergent norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization
• A robust sequential quadratic programming method
• A superlinearly and quadratically convergent SQP algorithm for inequality constrained optimization.
• A surperlinearly convergent algorithm for constrained optimization problems
• CUTE
• Globally and superlinearly convergent QP-free algorithm for nonlinear constrained optimization
• More test examples for nonlinear programming codes
• On combining feasibility, descent and superlinear convergence in inequality constrained optimization
• On the Accurate Identification of Active Constraints
• On the Constant Positive Linear Dependence Condition and Its Application to SQP Methods
• Sequential systems of linear equations algorithm for nonlinear optimization problems with general constraints
• Sequential systems of linear equations method for general constrained optimization without strict complementarity
• Strongly Regular Generalized Equations
• Test examples for nonlinear programming codes

Cited in

(14)

• A superlinearly convergent FSSLE algorithm for inequality constrained optimization
• An improved strongly sub-feasible SSLE method for optimization problems and numerical experiments
• AN INFEASIBLE SSLE FILTER ALGORITHM FOR GENERAL CONSTRAINED OPTIMIZATION WITHOUT STRICT COMPLEMENTARITY
• The use of QP-free algorithm in the limit analysis of slope stability
• A Feasible Sequential Linear Equation Method for Inequality Constrained Optimization
• A SSLE-Type Algorithm of Quasi-Strongly Sub-Feasible Directions for Inequality Constrained Minimax Problems
• New active set identification for general constrained optimization and minimax problems
• scientific article; zbMATH DE number 5898052 (Why is no real title available?)
• An active constraints identification technique-based SSLE algorithm and its convergence analysis
• On the accurate identification of active set for constrained minimax problems
• A new sequential systems of linear equations algorithm of feasible descent for inequality constrained optimization
• A Filter Active-Set Algorithm for Ball/Sphere Constrained Optimization Problem
• An improved infeasible SSLE method for constrained optimization without strict complementarity
• A globally convergent QP-free algorithm for inequality constrained minimax optimization

Describes a project that uses

Uses Software

• CUTEr
• CUTE

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1004010)