Pages that link to "Item:Q2796798"

The following pages link to Convergent Semidefinite Programming Relaxations for Global Bilevel Polynomial Optimization Problems (Q2796798):

Displayed 10 items.

• Exact conic programming relaxations for a class of convex polynomial cone programs (Q511965) ‎ (← 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)
• 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)