Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
From MaRDI portal
Publication:1029700
DOI10.1007/S10898-008-9372-0zbMath1169.90425OpenAlexW2105880662MaRDI QIDQ1029700
Publication date: 13 July 2009
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-008-9372-0
Related Items (93)
A new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation ⋮ Global solutions to a class of CEC benchmark constrained optimization problems ⋮ On box-constrained total least squares problem ⋮ Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods ⋮ \(S\)-frame discrepancy correction models for data-informed Reynolds stress closure ⋮ Disjunctive Cuts for Nonconvex MINLP ⋮ Linear Programming Relaxations of Quadratically Constrained Quadratic Programs ⋮ Obtaining Tighter Relaxations of Mathematical Programs with Complementarity Constraints ⋮ Finding Minimum Volume Circumscribing Ellipsoids Using Generalized Copositive Programming ⋮ Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO ⋮ Ambiguity in risk preferences in robust stochastic optimization ⋮ Computable representations for convex hulls of low-dimensional quadratic forms ⋮ Generating cutting planes for the semidefinite relaxation of quadratic programs ⋮ RLT-POS: reformulation-linearization technique-based optimization software for solving polynomial programming problems ⋮ Cutting Plane Generation through Sparse Principal Component Analysis ⋮ GLOMIQO: global mixed-integer quadratic optimizer ⋮ Semidefinite relaxations for non-convex quadratic mixed-integer programming ⋮ A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables ⋮ On subspace properties of the quadratically constrained quadratic program ⋮ Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations ⋮ On convex relaxations for quadratically constrained quadratic programming ⋮ Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2 ⋮ Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality ⋮ On indefinite quadratic optimization over the intersection of balls and linear constraints ⋮ Copositivity and constrained fractional quadratic problems ⋮ Branch and cut algorithms for detecting critical nodes in undirected graphs ⋮ Semidefinite Approaches for MIQCP: Convex Relaxations and Practical Methods ⋮ Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs ⋮ Gap inequalities for non-convex mixed-integer quadratic programs ⋮ Enhancing the normalized multiparametric disaggregation technique for mixed-integer quadratic programming ⋮ Optimization under uncertainty and risk: quadratic and copositive approaches ⋮ Facets of a mixed-integer bilinear covering set with bounds on variables ⋮ (Global) optimization: historical notes and recent developments ⋮ Using Two-Dimensional Projections for Stronger Separation and Propagation of Bilinear Terms ⋮ Outer-product-free sets for polynomial optimization and oracle-based cuts ⋮ Exploiting vector space properties to strengthen the relaxation of bilinear programs arising in the global optimization of process networks ⋮ An effective global algorithm for worst-case linear optimization under polyhedral uncertainty ⋮ Using general triangle inequalities within quadratic convex reformulation method ⋮ A reformulation-linearization technique for optimization over simplices ⋮ New bounds for nonconvex quadratically constrained quadratic programming ⋮ An outer-approximation approach for information-maximizing sensor selection ⋮ Linear programing relaxations for a strategic pricing problem in electricity markets ⋮ 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 ⋮ Enhancing RLT-based relaxations for polynomial programming problems via a new class of \(v\)-semidefinite cuts ⋮ Valid constraints for the Point Packing in a Square problem ⋮ A note on representations of linear inequalities in non-convex mixed-integer quadratic programs ⋮ Enhancing semidefinite relaxation for quadratically constrained quadratic programming via penalty methods ⋮ Size Matters: Cardinality-Constrained Clustering and Outlier Detection via Conic Optimization ⋮ A guide to conic optimisation and its applications ⋮ Consistency Analysis for Massively Inconsistent Datasets in Bound-to-Bound Data Collaboration ⋮ A nonlinear semidefinite optimization relaxation for the worst-case linear optimization under uncertainties ⋮ Global optimization of non-convex generalized disjunctive programs: a review on reformulations and relaxation techniques ⋮ Global solution of non-convex quadratically constrained quadratic programs ⋮ Combining qualitative information and semi‐quantitative data for guaranteed invalidation of biochemical network models ⋮ A low-dimensional SDP relaxation based spatial branch and bound method for nonconvex quadratic programs ⋮ An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints ⋮ A copositive approach for two-stage adjustable robust optimization with uncertain right-hand sides ⋮ Quadratic convex reformulation for nonconvex binary quadratically constrained quadratic programming via surrogate constraint ⋮ ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations ⋮ The minimum distance superset problem: formulations and algorithms ⋮ Burer's key assumption for semidefinite and doubly nonnegative relaxations ⋮ Solution existence and stability of quadratically constrained convex quadratic programs ⋮ Adaptive computable approximation to cones of nonnegative quadratic functions ⋮ Relaxing the optimality conditions of box QP ⋮ A new algorithm for concave quadratic programming ⋮ On the problem of packing spheres in a cube ⋮ Conic approximation to nonconvex quadratic programming with convex quadratic constraints ⋮ Convex reformulation for binary quadratic programming problems via average objective value maximization ⋮ Outer space branch and bound algorithm for solving linear multiplicative programming problems ⋮ The exact solution of multiparametric quadratically constrained quadratic programming problems ⋮ Second order cone constrained convex relaxations for nonconvex quadratically constrained quadratic programming ⋮ Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons ⋮ Successive Lagrangian relaxation algorithm for nonconvex quadratic optimization ⋮ Extensions on ellipsoid bounds for quadratic integer programming ⋮ Source localization using TDOA and FDOA measurements based on semidefinite programming and reformulation linearization ⋮ DC decomposition based branch-and-bound algorithms for box-constrained quadratic programs ⋮ A data-driven distributionally robust bound on the expected optimal value of uncertain mixed 0-1 linear programming ⋮ A new conic approach to semisupervised support vector machines ⋮ Quadratic optimization over a polyhedral cone ⋮ Mathematical programming formulations for the alternating current optimal power flow problem ⋮ Mathematical programming formulations for the alternating current optimal power flow problem ⋮ A binarisation heuristic for non-convex quadratic programming with box constraints ⋮ An efficient global algorithm for worst-case linear optimization under uncertainties based on nonlinear semidefinite relaxation ⋮ Convex hull representations for bounded products of variables ⋮ Relaxing Nonconvex Quadratic Functions by Multiple Adaptive Diagonal Perturbations ⋮ On linear conic relaxation of discrete quadratic programs ⋮ Template polyhedra and bilinear optimization ⋮ Complexity Results and Effective Algorithms for Worst-Case Linear Optimization Under Uncertainties ⋮ On the Composition of Convex Envelopes for Quadrilinear Terms ⋮ On the separation of split inequalities for non-convex quadratic integer programming ⋮ Inside-ellipsoid outside-sphere (IEOS) model for general bilinear feasibility problems: feasibility analysis and solution algorithm ⋮ Detecting copositivity of a symmetric matrix by an adaptive ellipsoid-based approximation scheme
Uses Software
Cites Work
- Unnamed Item
- Enhancing RLT relaxations via a new class of semidefinite cuts
- Theory of semidefinite programming for sensor network localization
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- Approximating quadratic programming with bound and quadratic constraints
- A branch-and-cut algorithm for nonconvex quadratic programs with box constraints
- A reformulation-convexification approach for solving nonconvex quadratic programming problems
- BARON: A general purpose global optimization software package
- On the copositive representation of binary and continuous nonconvex quadratic programs
- A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
- Second order cone programming relaxation of nonconvex quadratic optimization problems
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Semidefinite Programming
- A New Verified Optimization Technique for the "Packing Circles in a Unit Square" Problems
- Global Optimization in Geometry — Circle Packing into the Square
- Handbook of semidefinite programming. Theory, algorithms, and applications
This page was built for publication: Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
