Pages that link to "Item:Q1383834"
From MaRDI portal
The following pages link to A globally convergent sequential quadratic programming algorithm for mathematical programs with linear complementarity constraints (Q1383834):
Displaying 14 items.
- Dynamic programming approach to discrete time dynamic feedback Stackelberg games with independent and dependent followers (Q2569119) (← links)
- Conic formulation of QPCCs applied to truly sparse QPs (Q2696922) (← links)
- Smoothing method for mathematical programs with symmetric cone complementarity constraints (Q2996793) (← links)
- A globally convergent sequential linear programming algorithm for mathematical programs with linear complementarity constraints (Q3008599) (← links)
- (Q3103692) (← links)
- A Strategy for Global Convergence in a Sequential Quadratic Programming Algorithm (Q3210782) (← links)
- Critical sets in one-parametric mathematical programs with complementarity constraints (Q3498595) (← links)
- Improved Convergence Properties of the Relaxation Schemes of Kadrani <i>et al.</i> and Kanzow and Schwartz for MPEC (Q4604922) (← links)
- On the global minimization of the value-at-risk (Q4657710) (← links)
- Solving mathematical programs with complementarity constraints as nonlinear programs (Q4673321) (← links)
- A Sequential Smooth Penalization Approach to Mathematical Programs with Complementarity Constraints (Q5290836) (← links)
- Exact penalty functions for convex bilevel programming problems. (Q5958092) (← links)
- On solving difference of convex functions programs with linear complementarity constraints (Q6166653) (← links)
- Smoothing algorithms for nonsmooth optimization over the Stiefel manifold with applications to the graph Fourier basis problem (Q6580208) (← links)
