Approximating quadratic programming with bound and quadratic constraints

From MaRDI portal
Revision as of 01:22, 1 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1572673

DOI10.1007/S10107980012AzbMath0971.90056OpenAlexW1582056940MaRDI QIDQ1572673

Yinyu Ye

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 relaxationOn the complexity of quadratic programming with two quadratic constraintsOn box-constrained total least squares problemOn Convex Hulls of Epigraphs of QCQPsOn the tightness of SDP relaxations of QCQPsMaximization of Matrix Trace Function of Product Stiefel ManifoldsComputable representations for convex hulls of low-dimensional quadratic formsApproximating the weighted maximin dispersion problem over an \(\ell _p\)-ball: SDP relaxation is misleadingCutting Plane Generation through Sparse Principal Component AnalysisNew semidefinite programming relaxations for box constrained quadratic programA New Global Optimization Scheme for Quadratic Programs with Low-Rank NonconvexityOn approximating complex quadratic optimization problems via semidefinite programming relaxationsApproximation algorithms for homogeneous polynomial optimization with quadratic constraintsGlobal optimization of bilinear programs with a multiparametric disaggregation techniqueExact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programsA partial ellipsoidal approximation scheme for nonconvex homogeneous quadratic optimization with quadratic constraintsApproximation algorithm for a class of global optimization problemsApproximation algorithms for indefinite complex quadratic maximization problemsAn effective global algorithm for worst-case linear optimization under polyhedral uncertaintyEffective algorithms for separable nonconvex quadratic programming with one quadratic and box constraintsEffective algorithms for optimal portfolio deleveraging problem with cross impactCompletely positive and completely positive semidefinite tensor relaxations for polynomial optimizationHidden conic quadratic representation of some nonconvex quadratic optimization problemsConvex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximationPolynomial-time approximation of largest simplices in \(V\)-polytopes.LMI-based robust mixed-integer model predictive control for hybrid systemsA \({\mathsf{D}}\)-induced duality and its applicationsMinimizing an indefinite quadratic function subject to a single indefinite quadratic constraintSemidefinite relaxation for the total least squares problem with Tikhonov-like regularizationEuclidean minimum spanning trees with independent and dependent geometric uncertaintiesSemidefinite relaxation approximation for multivariate bi‐quadratic optimization with quadratic constraintsApproximation bounds for quadratic maximization and max-cut problems with semidefinite programming relaxationA finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxationsLMI approximations for the radius of the intersection of ellipsoids: Survey.Relaxing the optimality conditions of box QPSemidefinite programming for discrete optimization and matrix completion problemsSemi-definite relaxation algorithm of multiple knapsack problemConvex relaxations for mixed integer predictive controlPenalized semidefinite programming for quadratically-constrained quadratic optimizationSome results for quadratic problems with one or two quadratic constraintsLower bound improvement and forcing rule for quadratic binary programmingLower-order penalization approach to nonlinear semidefinite programmingAn efficient global algorithm for worst-case linear optimization under uncertainties based on nonlinear semidefinite relaxationCheaper relaxation and better approximation for multi-ball constrained quadratic optimization and extensionComputational Methods for Solving Nonconvex Block-Separable Constrained Quadratic ProblemsOn semidefinite bounds for maximization of a non-convex quadratic objective over thel1unit ballComplexity results for some global optimization problemsSemidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programmingInhomogeneous polynomial optimization over a convex set: An approximation approachComplexity Results and Effective Algorithms for Worst-Case Linear Optimization Under UncertaintiesOn approximation of max-vertex-coverStatistical quality assessment of Ising-based annealer outputsStrengthened semidefinite relaxations via a second lifting for the Max-Cut problemOn the Slater condition for the SDP relaxations of nonconvex sets







This page was built for publication: Approximating quadratic programming with bound and quadratic constraints