Best ellipsoidal relaxation to solve a nonconvex problem.
From MaRDI portal
Publication:1421225
DOI10.1016/j.cam.2003.08.012zbMath1053.65044OpenAlexW2008762851MaRDI QIDQ1421225
Publication date: 26 January 2004
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2003.08.012
numerical resultsquadratic programmingsemidefinite programmingellipsoidal relaxationquadratic Boolean programming
Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Quadratic programming (90C20)
Cites Work
- Unnamed Item
- Unnamed Item
- Constrained global optimization: algorithms and applications
- Applications of parametric programming and eigenvalue maximization to the quadratic assignment problem
- A branch and bound method via d. c. optimization algorithms and ellipsoidal technique for box constrained nonconvex quadratic problems
- Laplacian eigenvalues and the maximum cut problem
- A projection technique for partitioning the nodes of a graph
- A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming
- Computational aspects of a branch and bound algorithm for quadratic zero- one programming
- Some New Search Directions for Primal-Dual Interior Point Methods in Semidefinite Programming
- A tight bound for the boolean quadratic optimization problem and its use in a branch and bound algorithm1
- On the Shannon capacity of a graph
- Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
- Strong Duality for Semidefinite Programming
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- Convex Relaxations of (0, 1)-Quadratic Programming
- Semidefinite Programming
- Lower Bounds for the Partitioning of Graphs
- Handbook of semidefinite programming. Theory, algorithms, and applications
This page was built for publication: Best ellipsoidal relaxation to solve a nonconvex problem.
