Pages that link to "Item:Q5348472"
From MaRDI portal
The following pages link to Bilevel Polynomial Programs and Semidefinite Relaxation Methods (Q5348472):
Displaying 11 items.
- Border basis relaxation for polynomial optimization (Q898268) (← links)
- Separating tight metric inequalities by bilevel programming (Q1939716) (← links)
- Difference of convex algorithms for bilevel programs with applications in hyperparameter selection (Q2693651) (← links)
- BOLIB: Bilevel Optimization LIBrary of Test Problems (Q5014641) (← links)
- Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography (Q5014642) (← links)
- Generic Property of the Partial Calmness Condition for Bilevel Programming Problems (Q5072592) (← links)
- A Lagrange Multiplier Expression Method for Bilevel Polynomial Optimization (Q5158762) (← links)
- Exact Semidefinite Programming Relaxations with Truncated Moment Matrix for Binary Polynomial Optimization Problems (Q5737720) (← links)
- Convergences for robust bilevel polynomial programmes with applications (Q6078425) (← links)
- A study of mixed discrete bilevel programs using semidefinite and semi-infinite programming (Q6161288) (← links)
- Hierarchy relaxations for robust equilibrium constrained polynomial problems and applications to electric vehicle charging scheduling (Q6631573) (← links)