Some applications of polynomial optimization in operations research and real-time decision making

DOI10.1007/s11590-015-0894-3zbMath1345.90085arXiv1504.06002OpenAlexW1833752784MaRDI QIDQ276318

Amir Ali Ahmadi, Anirudha Majumdar

Publication date: 3 May 2016

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1504.06002

zbMATH Keywords

semidefinite programmingLyapunov methodssecond-order cone programmingpolynomial optimizationalgebraic techniques in optimizationreal-time optimization

Mathematics Subject Classification ID

Semidefinite programming (90C22) Applications of mathematical programming (90C90) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items (14)

Second-order cone programming relaxations for a class of multiobjective convex polynomial problems ⋮ A new approximation hierarchy for polynomial conic optimization ⋮ On the Construction of Converging Hierarchies for Polynomial Optimization Based on Certificates of Global Positivity ⋮ Decompositions of Semidefinite Matrices and the Perspective Reformulation of Nonseparable Quadratic Programs ⋮ Characterizing a class of robust vector polynomial optimization via sum of squares conditions ⋮ On semidefinite programming relaxations for a class of robust SOS-convex polynomial optimization problems ⋮ Robust second order cone conditions and duality for multiobjective problems under uncertainty data ⋮ DSOS and SDSOS Optimization: More Tractable Alternatives to Sum of Squares and Semidefinite Optimization ⋮ Global optimization of polynomials over real algebraic sets ⋮ Optimization over structured subsets of positive semidefinite matrices via column generation ⋮ Time-Varying Semidefinite Programs ⋮ Algorithm 996 ⋮ Solving sparse polynomial optimization problems with chordal structure using the sparse bounded-degree sum-of-squares hierarchy ⋮ A unified framework of SAGE and SONC polynomials and its duality theory

Uses Software

• SeDuMi
• Gurobi
• Mosek
• CVXGEN
• ECOS
• SPOTless

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• CVXGEN: a code generator for embedded convex optimization
• On the complexity of Putinar's Positivstellensatz
• Second-order cone programming
• Semidefinite programming relaxations for semialgebraic problems
• The wireless network jamming problem
• Jamming communication networks under complete uncertainty
• On factor width and symmetric \(H\)-matrices
• A Nullstellensatz and a Positivstellensatz in semialgebraic geometry
• On Curves of Minimal Length with a Constraint on Average Curvature, and with Prescribed Initial and Terminal Positions and Tangents
• Some NP-complete problems in quadratic and nonlinear programming
• Semidefinite Programming
• A Framework for Worst-Case and Stochastic Safety Verification Using Barrier Certificates
• Hybrid Systems: Computation and Control
• DSOS and SDSOS Optimization: More Tractable Alternatives to Sum of Squares and Semidefinite Optimization
• A Survey of the S-Lemma

This page was built for publication: Some applications of polynomial optimization in operations research and real-time decision making