Exact dual semi-definite programs for affinely adjustable robust SOS-convex polynomial optimization problems
From MaRDI portal
Publication:5045170
Recommendations
- Robust SOS-convex polynomial optimization problems: exact SDP relaxations
- Tight SDP relaxations for a class of robust SOS-convex polynomial programs without the Slater condition
- Exact SDP reformulations of adjustable robust linear programs with box uncertainties under separable quadratic decision rules via SOS representations of non-negativity
- Generalized Farkas lemma with adjustable variables and two-stage robust linear programs
- Sums of squares polynomial program reformulations for adjustable robust linear optimization problems with separable polynomial decision rules
Cites work
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- A complete characterization of the gap between convexity and sos-convexity
- A convex polynomial that is not sos-convex
- Adjustable robust solutions of uncertain linear programs
- Convex Analysis
- Deriving robust counterparts of nonlinear uncertain inequalities
- Exact second-order cone programming relaxations for some nonconvex minimax quadratic optimization problems
- Generating random vectors uniformly distributed inside and on the surface of different regions
- Graph implementations for nonsmooth convex programs
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- On general minimax theorems
- On the approximability of adjustable robust convex optimization under uncertainty
- Polynomial optimization, sums of squares, and applications
- Robust SOS-convex polynomial optimization problems: exact SDP relaxations
- Robust convex optimization
- Robust convex quadratically constrained programs
- Robust optimization
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- SOS-convex semialgebraic programs and its applications to robust optimization: a tractable class of nonsmooth convex optimization
- Semidefinite representation of convex sets
- Some geometric results in semidefinite programming
- Sums of squares, moment matrices and optimization over polynomials
- Theory and applications of robust optimization
- Tight SDP relaxations for a class of robust SOS-convex polynomial programs without the Slater condition
- When are static and adjustable robust optimization problems with constraint-wise uncertainty equivalent?
Cited in
(9)- Generalized Farkas lemma with adjustable variables and two-stage robust linear programs
- Robust SOS-convex polynomial optimization problems: exact SDP relaxations
- Tight SDP relaxations for a class of robust SOS-convex polynomial programs without the Slater condition
- Characterizing a class of robust vector polynomial optimization via sum of squares conditions
- Exact SDP reformulations of adjustable robust linear programs with box uncertainties under separable quadratic decision rules via SOS representations of non-negativity
- Sums of squares polynomial program reformulations for adjustable robust linear optimization problems with separable polynomial decision rules
- Exact SDP reformulations for adjustable robust quadratic optimization with affine decision rules
- A distributional Farkas' lemma and moment optimization problems with no-gap dual semi-definite programs
- Quadratically adjustable robust linear optimization with inexact data via generalized S-lemma: exact second-order cone program reformulations
This page was built for publication: Exact dual semi-definite programs for affinely adjustable robust SOS-convex polynomial optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5045170)
