An effective global algorithm for worst-case linear optimization under polyhedral uncertainty

Cites Work

Unnamed Item
A nonlinear semidefinite optimization relaxation for the worst-case linear optimization under uncertainties
Robust location transportation problems under uncertain demands
Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations
On the power and limitations of affine policies in two-stage adaptive optimization
Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound
Jointly constrained bilinear programs and related problems: An overview
Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
A new reformulation-linearization technique for bilinear programming problems
Robust solutions of uncertain linear programs
Adjustable robust solutions of uncertain linear programs
Approximating quadratic programming with bound and quadratic constraints
A symmetrical linear maxmin approach to disjoint bilinear programming
Enhancing semidefinite relaxation for quadratically constrained quadratic programming via penalty methods
New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation
Globally solving nonconvex quadratic programming problems via completely positive programming
A branch-and-cut algorithm for nonconvex quadratic programs with box constraints
\(\alpha BB\): A global optimization method for general constrained nonconvex problems
Some results on the strength of relaxations of multilinear functions
An efficient global algorithm for worst-case linear optimization under uncertainties based on nonlinear semidefinite relaxation
Multivariate McCormick relaxations
Cutting plane versus compact formulations for uncertain (integer) linear programs
Solving two-stage robust optimization problems using a column-and-constraint generation method
Accelerating convergence of cutting plane algorithms for disjoint bilinear programming
A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
Semi-definite programming relaxation of quadratic assignment problems based on nonredundant matrix splitting
Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations
Dynamic Container Deployment: Two-Stage Robust Model, Complexity, and Computational Results
Systemic Risk in Financial Systems
Theory and Applications of Robust Optimization
On the Power of Robust Solutions in Two-Stage Stochastic and Adaptive Optimization Problems
Liability Concentration and Systemic Losses in Financial Networks
Two-Stage Robust Network Flow and Design Under Demand Uncertainty
Cutting-set methods for robust convex optimization with pessimizing oracles
The Price of Robustness
Jointly Constrained Biconvex Programming
Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
A cutting plane algorithm for solving bilinear programs
Introduction to Stochastic Programming
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
Semidefinite relaxation and nonconvex quadratic optimization
Complexity Results and Effective Algorithms for Worst-Case Linear Optimization Under Uncertainties
Concavity cuts for disjoint bilinear programming