Pages that link to "Item:Q1415482"
From MaRDI portal
The following pages link to Exact solutions of some nonconvex quadratic optimization problems via SDP and SOCP relaxa\-tions (Q1415482):
Displaying 30 items.
- Exact computable representation of some second-order cone constrained quadratic programming problems (Q384217) (← links)
- A quasi-linear algorithm for calculating the infimal convolution of convex quadratic functions (Q415217) (← links)
- On zero duality gap in nonconvex quadratic programming problems (Q421278) (← links)
- Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation (Q644906) (← links)
- Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations (Q645557) (← links)
- A new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation (Q820743) (← links)
- Efficient solutions of interval programming problems with inexact parameters and second order cone constraints (Q1634750) (← links)
- Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization (Q1704915) (← links)
- Enhancing semidefinite relaxation for quadratically constrained quadratic programming via penalty methods (Q1730782) (← links)
- New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation (Q1741128) (← links)
- Optimization over structured subsets of positive semidefinite matrices via column generation (Q1751222) (← links)
- Quadratic convex reformulation for nonconvex binary quadratically constrained quadratic programming via surrogate constraint (Q1753128) (← links)
- On solving biquadratic optimization via semidefinite relaxation (Q1935575) (← links)
- Solving pooling problems with time discretization by LP and SOCP relaxations and rescheduling methods (Q2010087) (← links)
- A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs (Q2010098) (← links)
- Robust budget allocation via continuous submodular functions (Q2019911) (← links)
- Penalized semidefinite programming for quadratically-constrained quadratic optimization (Q2022173) (← links)
- Polyhedral approximations of the semidefinite cone and their application (Q2028478) (← links)
- Quadratic maximization of reachable values of affine systems with diagonalizable matrix (Q2032024) (← links)
- Exact SDP relaxations of quadratically constrained quadratic programs with forest structures (Q2114577) (← links)
- On the local stability of semidefinite relaxations (Q2144546) (← links)
- Doubly nonnegative relaxations are equivalent to completely positive reformulations of quadratic optimization problems with block-clique graph structures (Q2182857) (← links)
- Generalized S-lemma and strong duality in nonconvex quadratic programming (Q2392110) (← links)
- Submodular functions: from discrete to continuous domains (Q2414912) (← links)
- Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques (Q5139846) (← links)
- Outcome-space branch-and-bound outer approximation algorithm for a class of non-convex quadratic programming problems (Q6102175) (← links)
- (Global) optimization: historical notes and recent developments (Q6114910) (← links)
- A new technique to derive tight convex underestimators (sometimes envelopes) (Q6155069) (← links)
- Exact SDP relaxations for quadratic programs with bipartite graph structures (Q6173960) (← links)
- Invariants of SDP exactness in quadratic programming (Q6184179) (← links)
