Approximating quadratic programming with bound and quadratic constraints
From MaRDI portal
Recommendations
- Approximating global quadratic optimization with convex quadratic constraints
- On the complexity of quadratic programming with two quadratic constraints
- Approximation algorithms for quadratic programming
- Approximation Bounds for Quadratic Optimization with Homogeneous Quadratic Constraints
- Approximation algorithms for indefinite quadratic programming
Cited in
(69)- 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
- A New Global Optimization Scheme for Quadratic Programs with Low-Rank Nonconvexity
- Effective algorithms for optimal portfolio deleveraging problem with cross impact
- scientific article; zbMATH DE number 66883 (Why is no real title available?)
- scientific article; zbMATH DE number 792543 (Why is no real title available?)
- Computational methods for solving nonconvex block-separable constrained quadratic problems
- On the parallel approximability of a subclass of quadratic programming.
- Semidefinite relaxation for the total least squares problem with Tikhonov-like regularization
- Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation
- Global optimization of bilinear programs with a multiparametric disaggregation technique
- An implementation of the QSPLINE method for solving convex quadratic programming problems with simple bound constraints.
- Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization
- Relaxing the optimality conditions of box QP
- Computable representations for convex hulls of low-dimensional quadratic forms
- Maximization of Matrix Trace Function of Product Stiefel Manifolds
- An improved lower bound and approximation algorithm for binary constrained quadratic programming problem
- 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
- A partial ellipsoidal approximation scheme for nonconvex homogeneous quadratic optimization with quadratic constraints
- On box-constrained total least squares problem
- On Convex Hulls of Epigraphs of QCQPs
- LMI-based robust mixed-integer model predictive control for hybrid systems
- Semidefinite programming for discrete optimization and matrix completion problems
- Convex relaxations for mixed integer predictive control
- On approximation of max-vertex-cover
- Duality bound method for the general quadratic programming problem with quadratic constraints
- Approximation algorithms for indefinite complex quadratic maximization problems
- Hidden conic quadratic representation of some nonconvex quadratic optimization problems
- Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
- A new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation
- Lower bound improvement and forcing rule for quadratic binary programming
- Some results for quadratic problems with one or two quadratic constraints
- On quadratic programming with a ratio objective
- Approximation algorithm for a class of global optimization problems
- Euclidean minimum spanning trees with independent and dependent geometric uncertainties
- Approximating the weighted maximin dispersion problem over an \(\ell _p\)-ball: SDP relaxation is misleading
- On the tightness of SDP relaxations of QCQPs
- Complexity Results and Effective Algorithms for Worst-Case Linear Optimization Under Uncertainties
- Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem
- Approximation Bounds for Quadratic Optimization with Homogeneous Quadratic Constraints
- A proportioning based algorithm with rate of convergence for bound constrained quadratic programming
- New semidefinite programming relaxations for box constrained quadratic program
- Inhomogeneous polynomial optimization over a convex set: an approximation approach
- Penalized semidefinite programming for quadratically-constrained quadratic optimization
- On the complexity of quadratic programming with two quadratic constraints
- Semidefinite relaxation approximation for multivariate bi-quadratic optimization with quadratic constraints.
- Approximation bounds for quadratic maximization and max-cut problems with semidefinite programming relaxation
- Polynomial-time approximation of largest simplices in \(V\)-polytopes.
- A generalization of the Karush-Kuhn-Tucker theorem for approximate solutions of mathematical programming problems based on quadratic approximation
- A note on approximating quadratic programming with rank constraint
- Complexity results for some global optimization problems
- On the Slater condition for the SDP relaxations of nonconvex sets
- Statistical quality assessment of Ising-based annealer outputs
- Semi-definite relaxation algorithm of multiple knapsack problem
- scientific article; zbMATH DE number 6474937 (Why is no real title available?)
- An algorithm for quadratic optimization with one quadratic constraint and bounds on the variables
- Approximation algorithms for homogeneous polynomial optimization with quadratic constraints
- Lower-order penalization approach to nonlinear semidefinite programming
- Approximation algorithms for quadratic programming
- A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
- Minimizing an indefinite quadratic function subject to a single indefinite quadratic constraint
- Algorithms for bound constrained quadratic programming problems
- On approximating complex quadratic optimization problems via semidefinite programming relaxations
- Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs
- A \({\mathsf{D}}\)-induced duality and its applications
- LMI approximations for the radius of the intersection of ellipsoids: Survey.
- On semidefinite bounds for maximization of a non-convex quadratic objective over thel1unit ball
- Cutting plane generation through sparse principal component analysis
This page was built for publication: Approximating quadratic programming with bound and quadratic constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1572673)
