A fast convergent sequential linear equation method for inequality constrained optimization without strict complementarity

DOI10.1016/j.amc.2014.03.026zbMath1334.90166OpenAlexW2080251822MaRDI QIDQ273251

Qing Juan Xu, Dao Lan Han, Jin-Bao Jian

Publication date: 21 April 2016

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

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

zbMATH Keywords

global convergencenonlinear optimizationsuperlinear convergenceinequality constraintssequential linear equation algorithm

Mathematics Subject Classification ID

Nonlinear programming (90C30) Numerical optimization and variational techniques (65K10)

Related Items (1)

Prescribed-time robust ZNN models for solving equality and inequality systems

Uses Software

• CUTEr
• CUTE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An improved strongly sub-feasible SSLE method for optimization problems and numerical experiments
• Sequential systems of linear equations method for general constrained optimization without strict complementarity
• A new sequential systems of linear equations algorithm of feasible descent for inequality constrained optimization
• More test examples for nonlinear programming codes
• Test examples for nonlinear programming codes
• A generalized projection-successive linear equations algorithm for nonlinearly equality and inequality constrained optimization and its rate of convergence
• Sequential systems of linear equations algorithm for nonlinear optimization problems with general constraints
• A new SQP method of feasible directions for nonlinear programming.
• An efficient sequential quadratic programming algorithm for nonlinear programming
• A new feasible descent algorithm combining SQP with generalized projection for optimization problems without strict complementarity
• Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems
• An improved feasible QP-free algorithm for inequality constrained optimization
• Exact penalty function algorithm with simple updating of the penalty parameter
• 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
• CUTE
• A Feasible Sequential Linear Equation Method for Inequality Constrained Optimization
• On the Constant Positive Linear Dependence Condition and Its Application to SQP Methods
• A superlinearly convergent method of feasible directions.
• A QP-free and superlinearly convergent algorithm for inequality constrained optimizations

This page was built for publication: A fast convergent sequential linear equation method for inequality constrained optimization without strict complementarity