The following pages link to (Q4215008):
Displaying 7 items.
- Semismooth Newton method for the lifted reformulation of mathematical programs with complementarity constraints (Q434165) (← links)
- A new branch and bound algorithm for solving quadratic programs with linear complementarity constraints (Q697548) (← links)
- A globally convergent approximately active search algorithm for solving mathematical programs with linear complementarity constraints (Q704808) (← links)
- A superlinearly convergent implicit smooth SQP algorithm for mathematical programs with nonlinear complementarity constraints (Q812423) (← links)
- Nonlinear robust optimization via sequential convex bilevel programming (Q2434994) (← links)
- Merit-function piecewise SQP algorithm for mathematical programs with equilibrium constraints (Q2483036) (← links)
- A robust SQP method for mathematical programs with linear complementarity constraints (Q2506190) (← links)
