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

DOI10.1016/J.CAM.2008.07.017zbMATH Open1162.65032OpenAlexW2130835075MaRDI QIDQ1004010FDOQ1004010

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

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
• 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

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)

Cites Work

• CUTE
• Strongly Regular Generalized Equations
• On the Accurate Identification of Active Constraints
• 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 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
• A surperlinearly convergent algorithm for constrained optimization problems
• Title not available (Why is that?)
• A Feasible Sequential Linear Equation Method for Inequality Constrained Optimization
• On the Constant Positive Linear Dependence Condition and Its Application to SQP Methods
• Sequential systems of linear equations method for general constrained optimization without strict complementarity
• A robust sequential quadratic programming method
• On combining feasibility, descent and superlinear convergence in inequality constrained optimization
• 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
• A superlinearly and quadratically convergent SQP algorithm for inequality constrained optimization.

Cited In (13)

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

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)