New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability
From MaRDI portal
Publication:930342
DOI10.1007/S10107-007-0138-0zbMATH Open1171.90007OpenAlexW1971027118MaRDI QIDQ930342FDOQ930342
Authors: Immanuel M. Bomze, Marco Locatelli, Fabio Tardella 
Publication date: 30 June 2008
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-007-0138-0
Recommendations
- New bounds for nonconvex quadratically constrained quadratic programming
- Approximation Bounds for Quadratic Optimization with Homogeneous Quadratic Constraints
- scientific article; zbMATH DE number 6474937
- New quadratic lower bound for multivariate functions in global optimization
- Improved approximation bound for quadratic optimization problems with orthogonality constraints
- Valid inequalities for quadratic optimisation with domain constraints
- Extensions of the standard quadratic optimization problem: strong duality, optimality, hidden convexity and S-lemma
- Quadratic Approximations in Convex Nondifferentiable Optimization
- New Results on Quadratic Minimization
- A new bound-and-reduce approach of nonconvex quadratic programming problems
semidefinite programmingnonconvex programmingbounds on optimal objective function valueLovasz's \(\theta\)-functionquadratic programmig
Quadratic programming (90C20) Nonconvex programming, global optimization (90C26) Semidefinite programming (90C22)
Cites Work
- Title not available (Why is that?)
- Convex Analysis
- Global optimization with polynomials and the problem of moments
- Convex extensions and envelopes of lower semi-continuous functions
- Approximation of the stability number of a graph via copositive programming
- Computing the Stability Number of a Graph Via Linear and Semidefinite Programming
- Properties of Euclidean and non-Euclidean distance matrices
- Title not available (Why is that?)
- Maxima for Graphs and a New Proof of a Theorem of Turán
- Lagrange Multipliers and Nonconvex Programs
- Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
- Title not available (Why is that?)
- Continuous Characterizations of the Maximum Clique Problem
- New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability
- A comparison of the Delsarte and Lovász bounds
- Title not available (Why is that?)
- Title not available (Why is that?)
- On copositive programming and standard quadratic optimization problems
- Undominated d.c. decompositions of quadratic functions and applications to branch-and-bound approaches
- On standard quadratic optimization problems
- D.C. versus copositive bounds for standard QP
- Copositivity aspects of standard quadratic optimization problems
- Branch-and-bound approaches to standard quadratic optimization problems
- A class of problems where dual bounds beat underestimation bounds
- A PTAS for the minimization of polynomials of fixed degree over the simplex
- A new semidefinite programming bound for indefinite quadratic forms over a simplex
- On the equivalence between some discrete and continuous optimization problems
- Connections between continuous and combinatorial optimization problems through an extension of the fundamental theorem of Linear Programming
Cited In (45)
- Two-stage stochastic standard quadratic optimization
- Extensions of the standard quadratic optimization problem: strong duality, optimality, hidden convexity and S-lemma
- Copositivity detection by difference-of-convex decomposition and \(\omega \)-subdivision
- Complexity and nonlinear semidefinite programming reformulation of \(\ell_1\)-constrained nonconvex quadratic optimization
- On sparsity of the solution to a random quadratic optimization problem
- Separable standard quadratic optimization problems
- Cutting planes for semidefinite relaxations based on triangle-free subgraphs
- An improved algorithm to test copositivity
- Visualizing data as objects by DC (difference of convex) optimization
- Global solutions of nonconvex standard quadratic programs via mixed integer linear programming reformulations
- Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons
- Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization
- The difference between \(5\times 5\) doubly nonnegative and completely positive matrices
- A low-dimensional SDP relaxation based spatial branch and bound method for nonconvex quadratic programs
- New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability
- Gap, cosum and product properties of the \(\theta ^{\prime}\) bound on the clique number
- Local linear convergence of the alternating direction method of multipliers for nonconvex separable optimization problems
- Complex portfolio selection via convex mixed‐integer quadratic programming: a survey
- A new branch-and-bound algorithm for standard quadratic programming problems
- A new global optimization algorithm for mixed-integer quadratically constrained quadratic fractional programming problem
- A new algorithm for concave quadratic programming
- Solving Quadratic Programming by Cutting Planes
- Copositivity and constrained fractional quadratic problems
- D.C. versus copositive bounds for standard QP
- Unconstrained formulation of standard quadratic optimization problems
- Separating doubly nonnegative and completely positive matrices
- Nonconvex homogeneous optimization: a general framework and optimality conditions of first and second-order
- Convex Envelopes of Some Quadratic Functions over the n-Dimensional Unit Simplex
- A clique algorithm for standard quadratic programming
- Constraint selection in a build-up interior-point cutting-plane method for solving relaxations of the stable-set problem
- A new method for mean-variance portfolio optimization with cardinality constraints
- Factorization and cutting planes for completely positive matrices by copositive projection
- Improved SDP bounds for minimizing quadratic functions over the \(\ell^{1}\)-ball
- On solving a non-convex quadratic programming problem involving resistance distances in graphs
- Copositivity cuts for improving SDP bounds on the clique number
- Tightening a copositive relaxation for standard quadratic optimization problems
- Outcome-space branch-and-bound outer approximation algorithm for a class of non-convex quadratic programming problems
- An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints
- Performance comparison of two recently proposed copositivity tests
- Sparse solutions to random standard quadratic optimization problems
- Strong duality and KKT conditions in nonconvex optimization with a single equality constraint and geometric constraint
- New Analysis on Sparse Solutions to Random Standard Quadratic Optimization Problems and Extensions
- Nonparametric density estimation with nonuniform B-spline bases
- Metastability in stochastic replicator dynamics
- Computing the value of the convex envelope of quadratic forms over polytopes through a semidefinite program
This page was built for publication: New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q930342)
