On the central path for nonlinear semidefinite programming
L. M. Graña Drummond, Alfredo Noel Iusem, B. F. Svaiter (2000)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
L. M. Graña Drummond, Alfredo Noel Iusem, B. F. Svaiter (2000)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Erik A. Papa Quiroz, Paolo Roberto Oliveira (2006)
RAIRO - Operations Research
Similarity:
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...
L. M. Grana Drummond, Alfredo Noel Iusem, B. F. Svaiter (2010)
RAIRO - Operations Research
Similarity:
In this paper we study the well definedness of the central path associated to a given nonlinear (convex) semidefinite programming problem. Under standard assumptions, we establish that the existence of the central path is equivalent to the nonemptiness and boundedness of the optimal set. Other equivalent conditions are given, such as the existence of a strictly dual feasible point or the existence of a single central point.The monotonic behavior of the logarithmic barrier and the objective...
Lee, Gue Myung, Lee, Jae Hyoung (2010)
Journal of Inequalities and Applications [electronic only]
Similarity: