A three-dimension null-space approach for mathematical programs with equilibrium constraints.
From MaRDI portal
Recommendations
- On the solution of mathematical programming problems with equilibrium constraints
- A project variable metric algorithm for mathematical programs with equilibrium constraints
- Mathematical programs with equilibrium constraints: A brief survey of methods and optimality conditions
- A new smoothing technique for mathematical programs with equilibrium constraints
- A generalized project metric algorithm for mathematical programs with equilibrium constraints
Cites work
- A globally convergent sequential quadratic programming algorithm for mathematical programs with linear complementarity constraints
- A Trust Region Algorithm for Equality Constrained Minimization: Convergence Properties and Implementation
- A trust region method based on interior point techniques for nonlinear programming.
- A Trust Region Method for Nonlinear Programming Based on Primal Interior-Point Techniques
- An only 2-step Q-superlinear convergence example for some algorithms that use reduced hessian approximations
- Local Convergence of SQP Methods for Mathematical Programs with Equilibrium Constraints
- New relaxation method for mathematical programs with complementarity constraints
- On the Implementation of an Algorithm for Large-Scale Equality Constrained Optimization
- Some Feasibility Issues in Mathematical Programs with Equilibrium Constraints
- The penalty interior-point method fails to converge
Cited in
(2)
This page was built for publication: A three-dimension null-space approach for mathematical programs with equilibrium constraints.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1427909)