scientific article; zbMATH DE number 1560353

zbMATH Open0966.65054MaRDI QIDQ4527205FDOQ4527205

Authors: Akiko Takeda, Yang Dai, Mituhiro Fukuda, Masakazu Kojima 

Publication date: 26 April 2001

Title of this publication is not available (Why is that?)

Recommendations

• Discretization and localization in successive convex relaxation methods for nonconvex quadratic optimization.
• Successive Lagrangian relaxation algorithm for nonconvex quadratic optimization
• Complexity analysis of successive convex relaxation methods for nonconvex sets.
• A reformulation-convexification approach for solving nonconvex quadratic programming problems
• Best ellipsoidal relaxation to solve a nonconvex problem.

zbMATH Keywords

global optimizationnumerical resultsSDP relaxationlinear programsnonconvex quadratic optimizationsemidefinite programsemi-infinite LP relaxationsuccessive convex relaxation methods

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Methods of successive quadratic programming type (90C55) Nonconvex programming, global optimization (90C26) Semidefinite programming (90C22)

Cited In (8)

• Complexity analysis of successive convex relaxation methods for nonconvex sets.
• Some fundamental properties of successive convex relaxation methods on LCP and related problems
• Successive Lagrangian relaxation algorithm for nonconvex quadratic optimization
• Parallel implementation of successive convex relaxation methods for quadratic optimization problems
• Global optimization of rational functions: a semidefinite programming approach
• Eigenvalue techniques for convex objective, nonconvex optimization problems
• On the finite convergence of successive SDP relaxation methods
• Discretization and localization in successive convex relaxation methods for nonconvex quadratic optimization.

This page was built for publication:

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