An algorithm of sequential systems of linear equations for nonlinear optimization problems with arbitrary initial point
From MaRDI portal
Publication:1367215
DOI10.1007/BF02876059zbMath0886.90132OpenAlexW2047677171MaRDI QIDQ1367215
Fang Wu, Guo-Ping He, Zi-You Gao
Publication date: 10 May 1998
Published in: Science in China. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02876059
global convergenceconstrained optimizationsequential quadratic programming\(\varepsilon\)-active set
Related Items
An infeasible nonmonotone SSLE algorithm for nonlinear programming, 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 Filter Active-Set Algorithm for Ball/Sphere Constrained Optimization Problem, An infeasible active-set QP-free algorithm for general nonlinear programming, A smooth QP-free algorithm without a penalty function or a filter for mathematical programs with complementarity constraints
Cites Work
- Unnamed Item
- Unnamed Item
- A superlinearly convergent algorithm of the sequential systems of linear equations for nonlinear optimization problems
- A robust sequential quadratic programming method
- Exact penalty function algorithm with simple updating of the penalty parameter
- A successive quadratic programming algorithm with global and superlinear convergence properties
- 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
- The watchdog technique for forcing convergence in algorithms for constrained optimization
- Superlinearly convergent variable metric algorithms for general nonlinear programming problems
