Sequential systems of linear equations algorithm for nonlinear optimization problems with general constraints
From MaRDI portal
Publication:1372561
DOI10.1023/A:1022639306130zbMath0892.90163MaRDI QIDQ1372561
Fang Wu, Guo-Ping He, Zi-You Gao
Publication date: 15 July 1998
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
optimizationalgorithmssuperlinear convergenceinequality constraintscoefficient matricessequential systems of linear equationsgeneral constraintssuperlinearly convergent algorithm
Related Items (23)
A fast convergent sequential linear equation method for inequality constrained optimization without strict complementarity ⋮ An infeasible nonmonotone SSLE algorithm for nonlinear programming ⋮ A globally convergent QP-free algorithm for inequality constrained minimax optimization ⋮ Primal-dual interior point QP-free algorithm for nonlinear constrained optimization ⋮ An improved feasible QP-free algorithm for inequality constrained optimization ⋮ Parallel SSLE algorithm for large scale constrained optimization ⋮ An improved interior-type feasible QP-free algorithm for inequality constrained optimization problems ⋮ The convergence of equilibrium algorithms with non-monotone line search technique. ⋮ An interior point type QP-free algorithm with superlinear convergence for inequality constrained optimization ⋮ A strongly sub-feasible primal-dual quasi interior-point algorithm for nonlinear inequality constrained optimization ⋮ 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 ⋮ Sequential systems of linear equations method for general constrained optimization without strict complementarity ⋮ A feasible QP-free algorithm combining the interior-point method with active set for constrained optimization ⋮ A new feasible descent primal-dual interior point algorithm for nonlinear inequality constrained optimization ⋮ A QP-free algorithm of quasi-strongly sub-feasible directions for inequality constrained optimization ⋮ A superlinearly convergent strongly sub-feasible SSLE-type algorithm with working set for nonlinearly constrained optimization ⋮ Generalized monotone line search SQP algorithm for constrained minimax problems ⋮ An infeasible active-set QP-free algorithm for general nonlinear programming ⋮ A global QP-free algorithm for mathematical programs with complementarity constraints ⋮ A globally and superlinearly convergent feasible QP-free method for nonlinear programming ⋮ A smooth QP-free algorithm without a penalty function or a filter for mathematical programs with complementarity constraints ⋮ A superlinearly convergent SSLE algorithm for optimization problems with linear complementarity constraints
Cites Work
- The nonlinear programming method of Wilson, Han, and Powell with an augmented Lagrangian type line search function. I. Convergence analysis
- More test examples for nonlinear programming codes
- Test examples for nonlinear programming codes
- A two-stage feasible directions algorithm for nonlinear constrained optimization
- 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
- On the Local Convergence of Quasi-Newton Methods for Constrained Optimization
- Feasible directions algorithms for optimization problems with equality and inequality constraints
This page was built for publication: Sequential systems of linear equations algorithm for nonlinear optimization problems with general constraints
