Volume 40, Number 3, July-September 2006
|Page(s)||303 - 323|
|Published online||08 November 2006|
A new barrier for a class of semidefinite problems
Programa de Engenharia de Sistemas e Computacão, COPPE, Federal University of
Rio de Janeiro,
Rio de Janeiro, Brazil; firstname.lastname@example.org
2 Rua Honorio, 1144 c 5, 20771-421, Rio de Janeiro, Brazil; email@example.com
Accepted: 28 March 2006
We introduce a new barrier function to solve a class of Semidefinite Optimization Problems (SOP) with bounded variables. That class is motivated by some (SOP) as the minimization of the sum of the first few eigenvalues of symmetric matrices and graph partitioning problems. We study the primal-dual central path defined by the new barrier and we show that this path is analytic, bounded and that all cluster points are optimal solutions of the primal-dual pair of problems. Then, using some ideas from semi-analytic geometry we prove its full convergence. Finally, we introduce a new proximal point algorithm for that class of problems and prove its convergence.
Key words: Interior point methods / barrier function / central path / semidefinite optimization.
© EDP Sciences, 2006
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.