Some fundamental properties of successive convex relaxation methods on LCP and related problems

DOI10.1023/A:1020300717650zbMath1046.90062arXivmath/0005229OpenAlexW1643070418MaRDI QIDQ1810868

Tunçel, Levent, Kojima, Masakazu

Publication date: 9 June 2003

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

Full work available at URL: https://arxiv.org/abs/math/0005229

zbMATH Keywords

SDP relaxationGlobal optimizationSemidefinite programmingLinear complementarity problemConvex relaxationLift-and-project proceduresNonconvex quadratic optimization

Mathematics Subject Classification ID

Semidefinite programming (90C22) Mixed integer programming (90C11) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Programming in abstract spaces (90C48) Boolean programming (90C09)

Related Items (3)

A linear complementarity based characterization of the weighted independence number and the independent domination number in graphs ⋮ A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations ⋮ Convexification techniques for linear complementarity constraints

This page was built for publication: Some fundamental properties of successive convex relaxation methods on LCP and related problems