SOS-convex semialgebraic programs and its applications to robust optimization: a tractable class of nonsmooth convex optimization

DOI10.1007/s11228-017-0456-1zbMath1393.90083arXiv1702.02299OpenAlexW2587051736MaRDI QIDQ1653325

Y. Aharonov

Publication date: 3 August 2018

Published in: Set-Valued and Variational Analysis (Search for Journal in Brave)

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

zbMATH Keywords

nonsmooth optimizationconvex optimizationrobust optimizationsemidefinite programSOS-convex polynomial

Mathematics Subject Classification ID

Semidefinite programming (90C22) Convex programming (90C25) Sensitivity, stability, parametric optimization (90C31)

Related Items (7)

Further results on sum-of-squares tensors ⋮ Finding efficient solutions in robust multiple objective optimization with SOS-convex polynomial data ⋮ Exact dual semi-definite programs for affinely adjustable robust SOS-convex polynomial optimization problems ⋮ Second-order cone programming relaxations for a class of multiobjective convex polynomial problems ⋮ Conic relaxations with stable exactness conditions for parametric robust convex polynomial problems ⋮ Sum-of-squares relaxations in robust DC optimization and feature selection ⋮ Characterizing a class of robust vector polynomial optimization via sum of squares conditions

Uses Software

• CVX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Stability and genericity for semi-algebraic compact programs
• Robust linear semi-infinite programming duality under uncertainty
• Dual semidefinite programs without duality gaps for a class of convex minimax programs
• Robust conjugate duality for convex optimization under uncertainty with application to data classification
• Semidefinite representation of convex sets
• Robust convex quadratically constrained programs
• A Frank--Wolfe type theorem for convex polynomial programs
• A unifying approach to robust convex infinite optimization duality
• Exact SDP relaxations for classes of nonlinear semidefinite programming problems
• Robust SOS-convex polynomial optimization problems: exact SDP relaxations
• A robust von Neumann minimax theorem for zero-sum games under bounded payoff uncertainty
• Lectures on Modern Convex Optimization
• A Complete Characterization of the Gap between Convexity and SOS-Convexity
• Graph Implementations for Nonsmooth Convex Programs
• Strong Duality in Robust Convex Programming: Complete Characterizations
• Theory and Applications of Robust Optimization
• The Price of Robustness
• Convexity in SemiAlgebraic Geometry and Polynomial Optimization
• A new class of alternative theorems for SOS-convex inequalities and robust optimization
• Regularization and Variable Selection Via the Elastic Net

This page was built for publication: SOS-convex semialgebraic programs and its applications to robust optimization: a tractable class of nonsmooth convex optimization