Ellipsoidal approach to box-constrained quadratic problems
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1057696
- scientific article; zbMATH DE number 724207
- A branch and bound method via d. c. optimization algorithms and ellipsoidal technique for box constrained nonconvex quadratic problems
- A binarisation heuristic for non-convex quadratic programming with box constraints
- Approximation algorithms for quadratic programming
Cited in
(11)- Ellipsoidal one-class constraint acquisition for quadratically constrained programming
- On characterization of maximal independent sets via quadratic optimization
- On a polynomial fractional formulation for independence number of a graph
- Lower bound improvement and forcing rule for quadratic binary programming
- Constructing test functions for global optimization using continuous formulations of graph problems
- Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach
- (Global) optimization: historical notes and recent developments
- Non-convex optimization problems with linear KKT subsystem
- A polynomial algorithm for some instances of NP-complete problems
- Extensions on ellipsoid bounds for quadratic integer programming
- Convex programming with single separable constraint and bounded variables
This page was built for publication: Ellipsoidal approach to box-constrained quadratic problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1424957)
