Parallel Implementation of Successive Convex Relaxation Methods for Quadratic Optimization Problems

Authors:
Akiko Takeda;Katsuki Fujisawa;Yusuke Fukaya;Masakazu Kojima
Affiliations:
Toshiba Corporation, Kawasaki, Japan (akiko.takeda@toshiba.co.jp);Department of Architecture, Kyoto University, Kyoto, Japan (fujisawa@is-mj.archi.kyoto-u.ac.jp);NS Solutions Corporation, Tokyo, Japan (Yusuke.Fukaya@open.enicom.co.jp);Department of Mathematical and Computing Sciences, Tokyo Institute of Technology, Tokyo, Japan (kojima@is.titech.ac.jp)
Venue:
Journal of Global Optimization
Year:
2002

Citing 10
Cited 1

A hierarchy of relaxation between the continuous and convex hull representations

SIAM Journal on Discrete Mathematics
Computational aspects of a branch and bound algorithm for quadratic zero-one programming

Computing
A lift-and-project cutting plane algorithm for mixed 0-1 programs

Mathematical Programming: Series A and B
A new technique for generating quadratic programming test problems

Mathematical Programming: Series A and B
Generating quadratic bilevel programming test problems

ACM Transactions on Mathematical Software (TOMS)
Exploiting sparsity in primal-dual interior-point methods for semidefinite programming

Mathematical Programming: Series A and B - Special issue: papers from ismp97, the 16th international symposium on mathematical programming, Lausanne EPFL
Complexity Analysis of Successive Convex Relaxation Methods for Nonconvex Sets

Mathematics of Operations Research
Cones of Matrices and Successive Convex Relaxations of Nonconvex Sets

SIAM Journal on Optimization
Semidefinite Programming Relaxation for NonconvexQuadratic Programs

Journal of Global Optimization
Ninf: A Network Based Information Library for Global World-Wide Computing Infrastructure

HPCN Europe '97 Proceedings of the International Conference and Exhibition on High-Performance Computing and Networking

High Performance Grid and Cluster Computing for Some Optimization Problems

SAINT-W '04 Proceedings of the 2004 Symposium on Applications and the Internet-Workshops (SAINT 2004 Workshops)

Quantified Score

Hi-index	0.00

Visualization

Abstract

As computing resources continue to improve, global solutions for larger size quadrically constrained optimization problems become more achievable. In this paper, we focus on larger size problems and get accurate bounds for optimal values of such problems with the successive use of SDP relaxations on a parallel computing system called Ninf (Network-based Information Library for high performance computing).