Exact SDP reformulations for adjustable robust quadratic optimization with affine decision rules
From MaRDI portal
Publication:6655784
DOI10.1007/S10957-023-02371-5MaRDI QIDQ6655784FDOQ6655784
Authors: Huan Zhang, X. K. Sun, Kok Lay Teo 
Publication date: 27 December 2024
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Recommendations
- Exact SDP reformulations of adjustable robust linear programs with box uncertainties under separable quadratic decision rules via SOS representations of non-negativity
- Exact conic programming reformulations of two-stage adjustable robust linear programs with new quadratic decision rules
- Quadratically adjustable robust linear optimization with inexact data via generalized S-lemma: exact second-order cone program reformulations
- Exact dual semi-definite programs for affinely adjustable robust SOS-convex polynomial optimization problems
- Sums of squares polynomial program reformulations for adjustable robust linear optimization problems with separable polynomial decision rules
quadratic optimizationadjustable robust optimizationsemidefinite programming reformulationspectrahedral uncertain sets
Cites Work
- Recent advances in robust optimization: an overview
- Robust optimization
- Robust solutions of uncertain linear programs
- On robust optimization. Relations between scalar robust optimization and unconstrained multicriteria optimization
- Robust optimization-methodology and applications
- A primal-dual regularized interior-point method for convex quadratic programs
- Adjustable robust solutions of uncertain linear programs
- What is \dots a spectrahedron?
- A polynomial arc-search interior-point algorithm for convex quadratic programming
- Robust convex quadratically constrained programs
- Some geometric results in semidefinite programming
- Uncertain linear programs: extended affinely adjustable robust counterparts
- Exact second-order cone programming relaxations for some nonconvex minimax quadratic optimization problems
- Complex Quadratic Optimization and Semidefinite Programming
- Exterior point algorithms for nearest points and convex quadratic programs
- Robust quadratic programming with mixed-integer uncertainty
- An unconstrained convex programming approach to solving convex quadratic programming problems
- A survey of adjustable robust optimization
- Solving fractional multicriteria optimization problems with sum of squares convex polynomial data
- Optimality conditions and duality for robust nonsmooth multiobjective optimization problems with constraints
- Exact conic programming reformulations of two-stage adjustable robust linear programs with new quadratic decision rules
- Characterizations for optimality conditions of general robust optimization problems
- On approximate solutions and saddle point theorems for robust convex optimization
- Some characterizations of approximate solutions for robust semi-infinite optimization problems
- Duality in two-stage adaptive linear optimization: faster computation and stronger bounds
- Generalized Farkas lemma with adjustable variables and two-stage robust linear programs
- Radius of robust feasibility of system of convex inequalities with uncertain data
- Exact SDP reformulations of adjustable robust linear programs with box uncertainties under separable quadratic decision rules via SOS representations of non-negativity
- Robust Pareto solutions for convex quadratic multiobjective optimization problems under data uncertainty
- Characterizing a class of robust vector polynomial optimization via sum of squares conditions
- Exact dual semi-definite programs for affinely adjustable robust SOS-convex polynomial optimization problems
- On second-order conic programming duals for robust convex quadratic optimization problems
- Fractional optimization problems with support functions: exact SDP relaxations
- A graph-based decomposition method for convex quadratic optimization with indicators
Cited In (1)
This page was built for publication: Exact SDP reformulations for adjustable robust quadratic optimization with affine decision rules
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6655784)
