An efficient global algorithm for worst-case linear optimization under uncertainties based on nonlinear semidefinite relaxation
type: Item
instance of: scholarly article
title: An efficient global algorithm for worst-case linear optimization under uncertainties based on nonlinear semidefinite relaxation
zbMATH Open document ID: 1473.90178
author: Xiaodong Ding
author: Hezhi Luo
author: Huixian Wu
author: Jianzhen Liu
published in: Computational Optimization and Applications
publication date: 2021-08-09T00:00:00Z
Mathematics Subject Classification ID: 90C47
Mathematics Subject Classification ID: 90C22
zbMATH DE Number: 7379934
zbMATH Keywords: worst-case linear optimization
zbMATH Keywords: nonlinear semidefinite relaxation
zbMATH Keywords: branch-and-bound
zbMATH Keywords: successive convex optimization
describes a project that uses: ADMBB
describes a project that uses: CPLEX
describes a project that uses: QuadProgBB
describes a project that uses: SDPT3
describes a project that uses: CVX
MaRDI profile type: Publication
full work available at URL: s10589-021-00289-0
OpenAlex ID: W3174059216
cites work: Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
cites work: Computable representations for convex hulls of low-dimensional quadratic forms
cites work: Robust convex optimization
cites work: Q3182207
cites work: Adjustable robust solutions of uncertain linear programs
cites work: Robust solutions of uncertain linear programs
cites work: Theory and Applications of Robust Optimization
cites work: On the Power of Robust Solutions in Two-Stage Stochastic and Adaptive Optimization Problems
cites work: On the power and limitations of affine policies in two-stage adaptive optimization
cites work: Introduction to Stochastic Programming
cites work: Representing quadratically constrained quadratic programs as generalized copositive programs
cites work: A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
cites work: Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound
cites work: Globally solving nonconvex quadratic programming problems via completely positive programming
cites work: A Robust Optimization Perspective on Stochastic Programming
cites work: Optimization and nonsmooth analysis
cites work: Systemic Risk in Financial Systems
cites work: Q4833806
cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
cites work: Global optimization with polynomials and the problem of moments
cites work: Solving a class of linearly constrained indefinite quadratic problems by DC algorithms
cites work: Enhancing semidefinite relaxation for quadratically constrained quadratic programming via penalty methods
cites work: New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation
cites work: Complexity Results and Effective Algorithms for Worst-Case Linear Optimization Under Uncertainties
cites work: Semidefinite relaxation and nonconvex quadratic optimization
cites work: Global optimization algorithms for linearly constrained indefinite quadratic problems
cites work: Semidefinite programming relaxations for semialgebraic problems
cites work: A nonlinear semidefinite optimization relaxation for the worst-case linear optimization under uncertainties
cites work: Semi-definite programming relaxation of quadratic assignment problems based on nonredundant matrix splitting
cites work: Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations
cites work: Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations
cites work: A reformulation-linearization technique for solving discrete and continuous nonconvex problems
cites work: SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
cites work: A branch-and-cut algorithm for nonconvex quadratic programs with box constraints
cites work: Robust sensitivity analysis of the optimal value of linear programming
cites work: Approximating quadratic programming with bound and quadratic constraints
cites work: Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation
cites work: Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations
DOI: 10.1007/S10589-021-00289-0
description: scientific article; zbMATH DE number 7379934