Exact solutions of some nonconvex quadratic optimization problems via SDP and SOCP relaxa\-tions
From MaRDI portal
Publication:1415482
DOI10.1023/A:1025794313696zbMATH Open1043.90060OpenAlexW1606052501MaRDI QIDQ1415482FDOQ1415482
Authors: Sunyoung Kim, Masakazu Kojima 
Publication date: 4 December 2003
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1025794313696
Recommendations
- Second order cone programming relaxation of nonconvex quadratic optimization problems
- Exact second-order cone programming relaxations for some nonconvex minimax quadratic optimization problems
- A new SOCP relaxation of nonconvex quadratic programming problems with a few negative eigenvalues
- Semidefinite programming relaxation for nonconvex quadratic programs
- A simultaneous diagonalization based SOCP relaxation for convex quadratic programs with linear complementarity constraints
sparsitysemidefinite programming relaxationnonconvex quadratic optimization problemsecond order cone programming relaxation
Quadratic programming (90C20) Methods of successive quadratic programming type (90C55) Semidefinite programming (90C22)
Cited In (54)
- Polyhedral properties of RLT relaxations of nonconvex quadratic programs and their implications on exact relaxations
- Finding low-rank solutions of sparse linear matrix inequalities using convex optimization
- A new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation
- Title not available (Why is that?)
- SDP relaxation of homogeneous quadratic optimization: approximation bounds and applications
- Exact second-order cone programming relaxations for some nonconvex minimax quadratic optimization problems
- Convexity/nonconvexity certificates for power flow analysis
- On the Slater condition for the SDP relaxations of nonconvex sets
- Strong Duality for the CDT Subproblem: A Necessary and Sufficient Condition
- On zero duality gap in nonconvex quadratic programming problems
- A new SOCP relaxation of nonconvex quadratic programming problems with a few negative eigenvalues
- Second order cone programming relaxation of nonconvex quadratic optimization problems
- SDP relaxations for quadratic optimization problems derived from polynomial optimization problems
- Title not available (Why is that?)
- Exact SDP relaxations of quadratically constrained quadratic programs with forest structures
- A quasi-linear algorithm for calculating the infimal convolution of convex quadratic functions
- Polyhedral approximations of the semidefinite cone and their application
- Enhancing semidefinite relaxation for quadratically constrained quadratic programming via penalty methods
- Conic relaxation approaches for equal deployment problems
- A new technique to derive tight convex underestimators (sometimes envelopes)
- A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs
- Solving pooling problems with time discretization by LP and SOCP relaxations and rescheduling methods
- The geometry of SDP-exactness in quadratic optimization
- Quadratic convex reformulation for nonconvex binary quadratically constrained quadratic programming via surrogate constraint
- On the local stability of semidefinite relaxations
- Efficient solutions of interval programming problems with inexact parameters and second order cone constraints
- Robust budget allocation via continuous submodular functions
- Penalized semidefinite programming for quadratically-constrained quadratic optimization
- Equivalences and differences in conic relaxations of combinatorial quadratic optimization problems
- Quadratic maximization of reachable values of affine systems with diagonalizable matrix
- Invariants of SDP exactness in quadratic programming
- A new global optimization algorithm for mixed-integer quadratically constrained quadratic fractional programming problem
- On exact and inexact RLT and SDP-RLT relaxations of quadratic programs with box constraints
- A simultaneous diagonalization based SOCP relaxation for convex quadratic programs with linear complementarity constraints
- On solving biquadratic optimization via semidefinite relaxation
- Further development in convex conic reformulation of geometric nonconvex conic optimization problems
- Generalized S-lemma and strong duality in nonconvex quadratic programming
- Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations
- Exact SDP relaxations for classes of nonlinear semidefinite programming problems
- Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques
- Optimization over structured subsets of positive semidefinite matrices via column generation
- Exploiting aggregate sparsity in second-order cone relaxations for quadratic constrained quadratic programming problems
- Submodular functions: from discrete to continuous domains
- Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation
- Doubly nonnegative relaxations are equivalent to completely positive reformulations of quadratic optimization problems with block-clique graph structures
- Outcome-space branch-and-bound outer approximation algorithm for a class of non-convex quadratic programming problems
- Exactness criteria for SDP-relaxations of quadratic extremum problems
- (Global) optimization: historical notes and recent developments
- Second Order Cone Programming Relaxation of a Positive Semidefinite Constraint
- Discretization and localization in successive convex relaxation methods for nonconvex quadratic optimization.
- New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation
- Exact computable representation of some second-order cone constrained quadratic programming problems
- Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization
- Exact SDP relaxations for quadratic programs with bipartite graph structures
Uses Software
This page was built for publication: Exact solutions of some nonconvex quadratic optimization problems via SDP and SOCP relaxa\-tions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1415482)
