A generalized project metric algorithm for mathematical programs with equilibrium constraints
From MaRDI portal
Publication:2349543
DOI10.1016/j.cam.2015.04.007zbMath1325.90087OpenAlexW2053614580MaRDI QIDQ2349543
Publication date: 22 June 2015
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2015.04.007
global convergencesuperlinear convergencemathematical programs with equilibrium constraintsgeneralized project metric algorithm
Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A superlinearly convergent implicit smooth SQP algorithm for mathematical programs with nonlinear complementarity constraints
- An SQP algorithm for mathematical programs with nonlinear complementarity constraints
- Nonsmooth approach to optimization problems with equilibrium constraints. Theory, applications and numerical results
- A smoothing method for mathematical programs with equilibrium constraints
- A globally convergent sequential quadratic programming algorithm for mathematical programs with linear complementarity constraints
- A numerical approach to optimization problems with variational inequality constraints
- A superlinearly convergent SQP algorithm for mathematical programs with linear complementarity constraints
- An Implementable Active-Set Algorithm for Computing a B-Stationary Point of a Mathematical Program with Linear Complementarity Constraints
- A Superlinearly Convergent Feasible Method for the Solution of Inequality Constrained Optimization Problems
- Smooth SQP Methods for Mathematical Programs with Nonlinear Complementarity Constraints
This page was built for publication: A generalized project metric algorithm for mathematical programs with equilibrium constraints
