Parallel implementation of successive convex relaxation methods for quadratic optimization problems

DOI10.1023/A:1020299805773MaRDI QIDQ1812077zbMATH OpenFDO

Authors Akiko Takeda, Katsuki Fujisawa, Yusuke Fukaya, Masakazu Kojima

Publication date 18 June 2003

Published in Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/A:1020299805773

zbMATH Keywords

Global computingLift-and-project LP relaxationLift-and-project procedureNonconvex quadratic programParallel computationSDP relaxation

Mathematics Subject Classification ID

Quadratic programming (90C20) Nonconvex programming, global optimization (90C26)

Recommendations

• scientific article; zbMATH DE number 1560353
• Successive Lagrangian relaxation algorithm for nonconvex quadratic optimization
• A strongly sub-feasible norm-relaxed SQP algorithm of multiple directions with parallel computing
• An effective global optimization algorithm for quadratic programs with quadratic constraints
• Parallel computing in bound constrained quadratic programming

Cited in

(5)

• A parallel algorithm for constrained concave quadratic global minimization
• Solving the fixed rank convex quadratic maximization in binary variables by a parallel zonotope construction algorithm
• Parallel orthogonal factorization null-space method for dynamic quadratic programming
• A BLOCK-PARALLEL CONJUGATE GRADIENT METHOD FOR SEPARABLE QUADRATIC PROGRAMMING PROBLEMS^1
• SOLVING LARGE SCALE OPTIMIZATION PROBLEMS VIA GRID AND CLUSTER COMPUTING(<Special Issue>Network Design, Control and Optimization)

Describes a project that uses

Uses Software

• SDPA
• Ninf-G/MPI

This page was built for publication: Parallel implementation of successive convex relaxation methods for quadratic optimization problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1812077)