An efficient global algorithm for worst-case linear optimization under uncertainties based on nonlinear semidefinite relaxation
From MaRDI portal
Publication:2044572
DOI10.1007/S10589-021-00289-0zbMath1473.90178OpenAlexW3174059216MaRDI QIDQ2044572
Hezhi Luo, Huixian Wu, Xiaodong Ding, Jianzhen Liu
Publication date: 9 August 2021
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-021-00289-0
branch-and-boundworst-case linear optimizationnonlinear semidefinite relaxationsuccessive convex optimization
Related Items (4)
A new global algorithm for factor-risk-constrained mean-variance portfolio selection ⋮ An effective global algorithm for worst-case linear optimization under polyhedral uncertainty ⋮ Effective algorithms for separable nonconvex quadratic programming with one quadratic and box constraints ⋮ Effective algorithms for optimal portfolio deleveraging problem with cross impact
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Representing quadratically constrained quadratic programs as generalized copositive programs
- A nonlinear semidefinite optimization relaxation for the worst-case linear optimization under uncertainties
- Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation
- Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations
- 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
- Global optimization algorithms for linearly constrained indefinite quadratic problems
- Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound
- Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- Robust solutions of uncertain linear programs
- Solving a class of linearly constrained indefinite quadratic problems by DC algorithms
- Semidefinite programming relaxations for semialgebraic problems
- Adjustable robust solutions of uncertain linear programs
- Approximating quadratic programming with bound and quadratic constraints
- 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
- 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
- Computable representations for convex hulls of low-dimensional quadratic forms
- Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations
- Global Optimization with Polynomials and the Problem of Moments
- Robust Convex Optimization
- 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
- A Robust Optimization Perspective on Stochastic Programming
- Optimization and nonsmooth analysis
- Introduction to Stochastic Programming
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Semidefinite relaxation and nonconvex quadratic optimization
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- Robust sensitivity analysis of the optimal value of linear programming
- Complexity Results and Effective Algorithms for Worst-Case Linear Optimization Under Uncertainties
This page was built for publication: An efficient global algorithm for worst-case linear optimization under uncertainties based on nonlinear semidefinite relaxation
