Pages that link to "Item:Q1756794"
From MaRDI portal
The following pages link to Generalized Lagrangian duality for nonconvex polynomial programs with polynomial multipliers (Q1756794):
Displaying 6 items.
- Generalized Farkas' lemma and gap-free duality for minimax DC optimization with polynomials and robust quadratic optimization (Q280088) (← links)
- A new algorithm for concave quadratic programming (Q2010088) (← links)
- A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs (Q2010098) (← links)
- Lagrangian quadratic bounds in polynomial nonconvex and Boolean models with superfluous constraints (Q2768043) (← links)
- On duality gap with polynomial multipliers for polynomial optimization problems (Q5879569) (← links)
- Strong duality in lasserre's hierarchy for polynomial optimization (Q5963686) (← links)