Pages that link to "Item:Q2796798"
From MaRDI portal
The following pages link to Convergent semidefinite programming relaxations for global bilevel polynomial optimization problems (Q2796798):
Displaying 17 items.
- A computational study for bilevel quadratic programs using semidefinite relaxations (Q323274) (← links)
- Exact conic programming relaxations for a class of convex polynomial cone programs (Q511965) (← links)
- A bilevel Farkas lemma to characterizing global solutions of a class of bilevel polynomial programs (Q1785391) (← links)
- Optimality conditions for nonsmooth multiobjective bilevel optimization problems (Q2177790) (← links)
- Finding robust global optimal values of bilevel polynomial programs with uncertain linear constraints (Q2363578) (← links)
- (Q4557933) (← links)
- Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography (Q5014642) (← links)
- On the Role of a Market Maker in Networked Cournot Competition (Q5108233) (← links)
- A Lagrange Multiplier Expression Method for Bilevel Polynomial Optimization (Q5158762) (← links)
- Bilevel Polynomial Programs and Semidefinite Relaxation Methods (Q5348472) (← 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 utopia point method-based robust vector polynomial optimization scheme (Q6154404) (← links)
- A study of mixed discrete bilevel programs using semidefinite and semi-infinite programming (Q6161288) (← links)
- Semi-definite programming and quantum information (Q6561827) (← links)
- Hierarchy relaxations for robust equilibrium constrained polynomial problems and applications to electric vehicle charging scheduling (Q6631573) (← links)
- Generalized semi-infinite polynomial optimization and semidefinite programming relaxations (Q6650707) (← links)
