A generalized gradient projection algorithm for a mathematical program with complementarity constraints
From MaRDI portal
Publication:3109656
Recommendations
- A generalized gradient projection penalty algorithm for mathematical programming problems with complementarity constraints
- A generalized project metric algorithm for mathematical programs with equilibrium constraints
- A generalized strongly sub-feasible algorithm for mathematical programs with nonlinear complementarity constraints
- A conjugate gradient projection algorithm for mathematical programs with equilibrium constraints
- A generalized gradient projection algorithm of optimization with nonlinear constraints
Cited in
(8)- A generalized gradient projection method for optimization problems with equality and inequality constraints about arbitrary initial point
- A project variable metric algorithm for mathematical programs with equilibrium constraints
- A linear combinatorial projection method for a class of generalized implicit complementarity problems
- A generalized project metric algorithm for mathematical programs with equilibrium constraints
- A generalized strongly sub-feasible algorithm for mathematical programs with nonlinear complementarity constraints
- A conjugate gradient projection algorithm for mathematical programs with equilibrium constraints
- A generalized gradient projection penalty algorithm for mathematical programming problems with complementarity constraints
- A generalized gradient projection method based on a new working set for minimax optimization problems with inequality constraints
This page was built for publication: A generalized gradient projection algorithm for a mathematical program with complementarity constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3109656)