Pages that link to "Item:Q2506190"
From MaRDI portal
The following pages link to A robust SQP method for mathematical programs with linear complementarity constraints (Q2506190):
Displaying 13 items.
- Three modeling paradigms in mathematical programming (Q607499) (← links)
- A trust-region filter-SQP method for mathematical programs with linear complementarity constraints (Q656460) (← links)
- Lifting mathematical programs with complementarity constraints (Q662308) (← links)
- A primal-dual interior-point method capable of rapidly detecting infeasibility for nonlinear programs (Q781112) (← links)
- Convexification techniques for linear complementarity constraints (Q2045009) (← links)
- A strongly and superlinearly convergent SQP algorithm for optimization problems with linear complementarity constraints (Q2432613) (← links)
- Multiplier convergence in trust-region methods with application to convergence of decomposition methods for MPECs (Q2465653) (← links)
- An SQP method for mathematical programs with complementarity constraints with strong convergence properties. (Q2810178) (← links)
- (Q4901324) (← links)
- MPEC Methods for Bilevel Optimization Problems (Q5014634) (← links)
- (Q5399903) (← links)
- A novel augmented Lagrangian method of multipliers for optimization with general inequality constraints (Q5879119) (← links)
- A survey of nonlinear robust optimization (Q5882395) (← links)
