A superlinearly convergent SQP algorithm for mathematical programs with linear complementarity constraints
From MaRDI portal
Publication:2369090
DOI10.1016/j.amc.2005.01.141zbMath1098.65072MaRDI QIDQ2369090
Publication date: 28 April 2006
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2005.01.141
global convergence; superlinear convergence; successive quadratic programming; mathematical programs with complementarity constraints; SQP algorithm
65K05: Numerical mathematical programming methods
90C30: Nonlinear programming
90C33: Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)
90C55: Methods of successive quadratic programming type
Related Items
A superlinearly convergent QP-free algorithm for mathematical programs with equilibrium constraints, An SQP algorithm for mathematical programs with nonlinear complementarity constraints, A generalized project metric algorithm for mathematical programs with equilibrium constraints, A smooth QP-free algorithm without a penalty function or a filter for mathematical programs with complementarity constraints
Cites Work
- Unnamed Item
- A smoothing method for mathematical programs with equilibrium constraints
- A globally convergent sequential quadratic programming algorithm for mathematical programs with linear complementarity constraints
- A smoothing method for a mathematical program with P-matrix linear complementarity constraints
- A numerical approach to optimization problems with variational inequality constraints
- Extension of quasi-Newton methods to mathematical programs with complementarity con\-straints
- Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems
- A Newton-type method for positive-semidefinite linear complementarity problems
- Exact penalization and stationarity conditions of mathematical programs with equilibrium constraints
- A successive quadratic programming algorithm with global and superlinear convergence properties
- A Superlinearly Convergent Feasible Method for the Solution of Inequality Constrained Optimization Problems
- Superlinearly convergent variable metric algorithms for general nonlinear programming problems
- A special newton-type optimization method
- Smooth SQP Methods for Mathematical Programs with Nonlinear Complementarity Constraints
- A Globally Convergent Successive Approximation Method for Severely Nonsmooth Equations
