Approximating quadratic programming with bound and quadratic constraints
From MaRDI portal
Publication:1572673
DOI10.1007/S10107980012AzbMath0971.90056OpenAlexW1582056940MaRDI QIDQ1572673
Publication date: 21 July 2000
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107980012a
Related Items (54)
A new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation ⋮ On the complexity of quadratic programming with two quadratic constraints ⋮ On box-constrained total least squares problem ⋮ On Convex Hulls of Epigraphs of QCQPs ⋮ On the tightness of SDP relaxations of QCQPs ⋮ Maximization of Matrix Trace Function of Product Stiefel Manifolds ⋮ Computable representations for convex hulls of low-dimensional quadratic forms ⋮ Approximating the weighted maximin dispersion problem over an \(\ell _p\)-ball: SDP relaxation is misleading ⋮ Cutting Plane Generation through Sparse Principal Component Analysis ⋮ New semidefinite programming relaxations for box constrained quadratic program ⋮ A New Global Optimization Scheme for Quadratic Programs with Low-Rank Nonconvexity ⋮ On approximating complex quadratic optimization problems via semidefinite programming relaxations ⋮ Approximation algorithms for homogeneous polynomial optimization with quadratic constraints ⋮ Global optimization of bilinear programs with a multiparametric disaggregation technique ⋮ Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs ⋮ A partial ellipsoidal approximation scheme for nonconvex homogeneous quadratic optimization with quadratic constraints ⋮ Approximation algorithm for a class of global optimization problems ⋮ Approximation algorithms for indefinite complex quadratic maximization problems ⋮ 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 ⋮ Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization ⋮ Hidden conic quadratic representation of some nonconvex quadratic optimization problems ⋮ Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation ⋮ Polynomial-time approximation of largest simplices in \(V\)-polytopes. ⋮ LMI-based robust mixed-integer model predictive control for hybrid systems ⋮ A \({\mathsf{D}}\)-induced duality and its applications ⋮ Minimizing an indefinite quadratic function subject to a single indefinite quadratic constraint ⋮ Semidefinite relaxation for the total least squares problem with Tikhonov-like regularization ⋮ Euclidean minimum spanning trees with independent and dependent geometric uncertainties ⋮ Semidefinite relaxation approximation for multivariate bi‐quadratic optimization with quadratic constraints ⋮ Approximation bounds for quadratic maximization and max-cut problems with semidefinite programming relaxation ⋮ A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations ⋮ LMI approximations for the radius of the intersection of ellipsoids: Survey. ⋮ Relaxing the optimality conditions of box QP ⋮ Semidefinite programming for discrete optimization and matrix completion problems ⋮ Semi-definite relaxation algorithm of multiple knapsack problem ⋮ Convex relaxations for mixed integer predictive control ⋮ Penalized semidefinite programming for quadratically-constrained quadratic optimization ⋮ Some results for quadratic problems with one or two quadratic constraints ⋮ Lower bound improvement and forcing rule for quadratic binary programming ⋮ Lower-order penalization approach to nonlinear semidefinite programming ⋮ An efficient global algorithm for worst-case linear optimization under uncertainties based on nonlinear semidefinite relaxation ⋮ Cheaper relaxation and better approximation for multi-ball constrained quadratic optimization and extension ⋮ Computational Methods for Solving Nonconvex Block-Separable Constrained Quadratic Problems ⋮ On semidefinite bounds for maximization of a non-convex quadratic objective over thel1unit ball ⋮ Complexity results for some global optimization problems ⋮ Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming ⋮ Inhomogeneous polynomial optimization over a convex set: An approximation approach ⋮ Complexity Results and Effective Algorithms for Worst-Case Linear Optimization Under Uncertainties ⋮ On approximation of max-vertex-cover ⋮ Statistical quality assessment of Ising-based annealer outputs ⋮ Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem ⋮ On the Slater condition for the SDP relaxations of nonconvex sets
This page was built for publication: Approximating quadratic programming with bound and quadratic constraints