Ellipsoid bounds for convex quadratic integer programming
From MaRDI portal
Recommendations
- Extensions on ellipsoid bounds for quadratic integer programming
- An effective branch-and-bound algorithm for convex quadratic integer programming
- An effective branch-and-bound algorithm for convex quadratic integer programming
- An exact algorithm for nonconvex quadratic integer minimization using ellipsoidal relaxations
- A fast branch-and-bound algorithm for non-convex quadratic integer optimization subject to linear constraints using ellipsoidal relaxations
Cites work
- scientific article; zbMATH DE number 3335677 (Why is no real title available?)
- A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
- A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming
- An Implicit Enumeration Algorithm for Quadratic Integer Programming
- An effective branch-and-bound algorithm for convex quadratic integer programming
- An efficient compact quadratic convex reformulation for general integer quadratic programs
- An exact algorithm for nonconvex quadratic integer minimization using ellipsoidal relaxations
- Branch and Bound Experiments in Convex Nonlinear Integer Programming
- Eigenvalue techniques for convex objective, nonconvex optimization problems
- Extending the QCR method to general mixed-integer programs
- Further Reduction of Zero-One Polynomial Programming Problems to Zero-One linear Programming Problems
- Improved Methods for Calculating Vectors of Short Length in a Lattice, Including a Complexity Analysis
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Semidefinite Programming
- Semidefinite relaxations for non-convex quadratic mixed-integer programming
- Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
- Some proximity and sensitivity results in quadratic integer programming
- The MILP road to MIQCP
- When is rounding allowed in integer nonlinear optimization?
Cited in
(20)- On maximization of quadratic form over intersection of ellipsoids with common center
- Improved Bounds and Containing Ellipsoids in Karmarkar's Linear Programming Algorithm
- A fast branch-and-bound algorithm for non-convex quadratic integer optimization subject to linear constraints using ellipsoidal relaxations
- A convex optimization approach for minimizing the ratio of indefinite quadratic functions over an ellipsoid
- scientific article; zbMATH DE number 1150370 (Why is no real title available?)
- A semidefinite programming method for integer convex quadratic minimization
- An exact algorithm for nonconvex quadratic integer minimization using ellipsoidal relaxations
- Extensions on ellipsoid bounds for quadratic integer programming
- Embedded maximal ellipsoids and semi-infinite optimization
- Condition-Based Complexity of Convex Optimization in Conic Linear Form via the Ellipsoid Algorithm
- Ellipsoidal one-class constraint acquisition for quadratically constrained programming
- Improved semidefinite approximation bounds for nonconvex nonhomogeneous quadratic optimization with ellipsoid constraints
- A decision space algorithm for multiobjective convex quadratic integer optimization
- An effective branch-and-bound algorithm for convex quadratic integer programming
- Minimum ellipsoid bounds for solutions of polynomial systems via sum of squares
- Norm bounds and underestimators for unconstrained polynomial integer minimization
- Une borne optimale pour la programmation entière quasi-convexe
- SDP-based branch-and-bound for non-convex quadratic integer optimization
- An effective branch-and-bound algorithm for convex quadratic integer programming
- On local nonglobal minimum of trust-region subproblem and extension
This page was built for publication: Ellipsoid bounds for convex quadratic integer programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2954394)
