Optimization under uncertainty and risk: quadratic and copositive approaches
From MaRDI portal
Publication:6113346
DOI10.1016/j.ejor.2022.11.020MaRDI QIDQ6113346
Markus Gabl, Immanuel M. Bomze
Publication date: 11 July 2023
Published in: European Journal of Operational Research (Search for Journal in Brave)
conic programming and interior point methodsdistributionally robust optimizationadjustable robust optimizationquadratically constrained quadratic problemstwo-stage stochastic standard quadratic problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets
- Moment approximations for set-semidefinite polynomials
- Copositive optimization -- recent developments and applications
- Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization
- An improved algorithm to test copositivity
- On the computational complexity of membership problems for the completely positive cone and its dual
- On reduced semidefinite programs for second order moment bounds with applications
- On the power and limitations of affine policies in two-stage adaptive optimization
- Extended trust-region problems with one or two balls: exact copositive and Lagrangian relaxations
- Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
- Quadratic programming with one negative eigenvalue is NP-hard
- Adjustable robust solutions of uncertain linear programs
- On the Slater condition for the SDP relaxations of nonconvex sets
- Quadratic programs with hollows
- Data-driven robust optimization
- A survey of adjustable robust optimization
- A copositive approach for two-stage adjustable robust optimization with uncertain right-hand sides
- Data-driven distributionally robust optimization using the Wasserstein metric: performance guarantees and tractable reformulations
- Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
- On convex relaxations for quadratically constrained quadratic programming
- Strong duality and minimal representations for cone optimization
- Exact conic programming reformulations of two-stage adjustable robust linear programs with new quadratic decision rules
- Two-stage stochastic standard quadratic optimization
- Frameworks and results in distributionally robust optimization
- A factorization method for completely positive matrices
- A tractable approach for designing piecewise affine policies in two-stage adjustable robust optimization
- Exploiting partial correlations in distributionally robust optimization
- A gentle, geometric introduction to copositive optimization
- Narrowing the difficulty gap for the Celis-Dennis-Tapia problem
- On the copositive representation of binary and continuous nonconvex quadratic programs
- Data-driven risk-averse stochastic optimization with Wasserstein metric
- Algorithmic copositivity detection by simplicial partition
- D.C. versus copositive bounds for standard QP
- Computable representations for convex hulls of low-dimensional quadratic forms
- Interplay of non-convex quadratically constrained problems with adjustable robust optimization
- Conic formulation of QPCCs applied to truly sparse QPs
- Global Optimization with Polynomials and the Problem of Moments
- Approximation of the Stability Number of a Graph via Copositive Programming
- A Note on Polynomial Solvability of the CDT Problem
- A Two-Variable Approach to the Two-Trust-Region Subproblem
- Copositive Programming
- Scheduling Arrivals to a Stochastic Service Delivery System Using Copositive Cones
- On the accuracy of uniform polyhedral approximations of the copositive cone
- Distributionally Robust Convex Optimization
- An improved characterisation of the interior of the completely positive cone
- Constructing Uncertainty Sets for Robust Linear Optimization
- Mixed 0-1 Linear Programs Under Objective Uncertainty: A Completely Positive Representation
- Theory and Applications of Robust Optimization
- Optimality of Affine Policies in Multistage Robust Optimization
- Robust Quadratic Programming with Mixed-Integer Uncertainty
- Disjunctive Programming
- Conic Programming Reformulations of Two-Stage Distributionally Robust Linear Programs over Wasserstein Balls
- Trust Your Data or Not—StQP Remains StQP: Community Detection via Robust Standard Quadratic Optimization
- Disjoint Bilinear Optimization: A Two-Stage Robust Optimization Perspective
- Finding Minimum Volume Circumscribing Ellipsoids Using Generalized Copositive Programming
- An Analytic Center Cutting Plane Method to Determine Complete Positivity of a Matrix
- A Geometrical Analysis on Convex Conic Reformulations of Quadratic and Polynomial Optimization Problems
- Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques
- Supermodularity and Affine Policies in Dynamic Robust Optimization
- An Adaptive Linear Approximation Algorithm for Copositive Programs
- Min-max control of constrained uncertain discrete-time linear systems
- Second-Order-Cone Constraints for Extended Trust-Region Subproblems
- Computing the Stability Number of a Graph Via Linear and Semidefinite Programming
- Copositive Relaxation Beats Lagrangian Dual Bounds in Quadratically and Linearly Constrained Quadratic Optimization Problems
- On Cones of Nonnegative Quadratic Functions
- A Survey of the S-Lemma
- On copositive programming and standard quadratic optimization problems
- Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems
- Quadratically adjustable robust linear optimization with inexact data via generalized S-lemma: exact second-order cone program reformulations
This page was built for publication: Optimization under uncertainty and risk: quadratic and copositive approaches