A new sequential systems of linear equations algorithm of feasible descent for inequality constrained optimization

DOI10.1007/s10114-010-7432-0zbMath1233.90256OpenAlexW2062557110MaRDI QIDQ627582

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

Publication date: 2 March 2011

Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10114-010-7432-0

zbMATH Keywords

global convergencenonlinear optimizationsuperlinear convergenceinequality constraintssystems of linear equations

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical optimization and variational techniques (65K10) Numerical methods based on nonlinear programming (49M37)

Related Items (5)

A SSLE-Type Algorithm of Quasi-Strongly Sub-Feasible Directions for Inequality Constrained Minimax Problems ⋮ A fast convergent sequential linear equation method for inequality constrained optimization without strict complementarity ⋮ A globally convergent QP-free algorithm for inequality constrained minimax optimization ⋮ An improved feasible QP-free algorithm for inequality constrained optimization ⋮ A QP-free algorithm for finite minimax problems

Uses Software

• CUTEr
• CUTE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• An SQP method for general nonlinear programs using only equality constrained subproblems
• An efficient sequential quadratic programming algorithm for nonlinear programming
• On combining feasibility, descent and superlinear convergence in inequality constrained optimization
• An SQP feasible descent algorithm for nonlinear inequality constrained optimization without strict complementarity
• A new norm-relaxed method of strongly sub-feasible direction for 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
• 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
• A Robust Algorithm for Optimization with General Equality and Inequality Constraints
• A superlinearly convergent method of feasible directions.

This page was built for publication: A new sequential systems of linear equations algorithm of feasible descent for inequality constrained optimization