Two-stage stochastic standard quadratic optimization
From MaRDI portal
Publication:2077956
DOI10.1016/j.ejor.2021.10.056zbMath1495.90114OpenAlexW3211625051MaRDI QIDQ2077956
Georg Ch. Pflug, Francesca Maggioni, Immanuel M. Bomze, Markus Gabl
Publication date: 23 February 2022
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2021.10.056
Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20) Stochastic programming (90C15)
Related Items
Optimization under uncertainty and risk: quadratic and copositive approaches, Sparse conic reformulation of structured QCQPs based on copositive optimization with applications in stochastic optimization, A Decomposition Algorithm for Two-Stage Stochastic Programs with Nonconvex Recourse Functions
Cites Work
- Unnamed Item
- Unnamed Item
- Sparse solutions to random standard quadratic optimization problems
- Copositivity and constrained fractional quadratic problems
- Copositive optimization -- recent developments and applications
- Bounds in multistage linear stochastic programming
- Infection and immunization: a new class of evolutionary game dynamics
- New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability
- A clique algorithm for standard quadratic programming
- On standard quadratic optimization problems
- Improving aggregation bounds for two-stage stochastic programs
- Monotonic bounds in multistage mixed-integer stochastic programming
- Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
- Generalized bounds for convex multistage stochastic programs.
- A hierarchy of bounds for stochastic mixed-integer programs
- Global solutions of nonconvex standard quadratic programs via mixed integer linear programming reformulations
- Frank-Wolfe and friends: a journey into projection-free first-order optimization methods
- On the copositive representation of binary and continuous nonconvex quadratic programs
- Aggregation and discretization in multistage stochastic programming
- Quartic formulation of standard quadratic optimization problems
- Inequalities for Stochastic Linear Programming Problems
- Bounds and Approximations for Multistage Stochastic Programs
- Copositive Programming
- Multistage Stochastic Optimization
- Modeling with Stochastic Programming
- Barycentric Bounds in Stochastic Programming: Theory and Application
- Introduction to Stochastic Programming
- Bounds on the value of information in uncertain decision problems II
- New Analysis on Sparse Solutions to Random Standard Quadratic Optimization Problems and Extensions
- Aggregation bounds in stochastic linear programming
- Solving SLP Recourse Problems with Arbitrary Multivariate Distributions—The Dependent Case
- Bounds on the Expectation of a Convex Function of a Random Variable: With Applications to Stochastic Programming
- Sharp Bounds on the Value of Perfect Information
- Approximations for Probability Distributions and Stochastic Optimization Problems
- Guaranteed Bounds for General Nondiscrete Multistage Risk-Averse Stochastic Optimization Programs
- A new branch-and-bound algorithm for standard quadratic programming problems
- Trust Your Data or Not—StQP Remains StQP: Community Detection via Robust Standard Quadratic Optimization
- Active Set Complexity of the Away-Step Frank--Wolfe Algorithm
- The Complexity of Simple Models—A Study of Worst and Typical Hard Cases for the Standard Quadratic Optimization Problem
- First-order Methods for the Impatient: Support Identification in Finite Time with Convergent Frank--Wolfe Variants
- Second-Order-Cone Constraints for Extended Trust-Region Subproblems
- On copositive programming and standard quadratic optimization problems
