Asymptotic behavior of the central path for a special class of degenerate SDP problems

This paper studies the asymptotic behavior of the central path (X(), S(), y()) as 0 for a class of degenerate semidefinite programming (SDP) problems, namely those that do not have strictly complementary primal-dual optimal solutions and whose degenerate diagonal blocks XT () and ST () of the centra...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Mathematical programming Ročník 103; číslo 3; s. 487 - 514
Hlavní autoři: Neto, João X. da Cruz, Ferreira, Orizon P., Monteiro, Renato D. C.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Heidelberg Springer 01.07.2005
Springer Nature B.V
Témata:
Applied sciences
Euclidean space
Exact sciences and technology
Linear programming
Mathematical programming
Operational research and scientific management
Operational research. Management science
Semidefinite programming
Studies
Semidefinite programming
Limiting behavior
Optimal solution
Asymptotic behavior
Primal dual method
Semi definite programming
Convex quadratic programming Convex quadratically constrained programming
Quadratic programming
Convex programming
Central path
ISSN:0025-5610, 1436-4646
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:This paper studies the asymptotic behavior of the central path (X(), S(), y()) as 0 for a class of degenerate semidefinite programming (SDP) problems, namely those that do not have strictly complementary primal-dual optimal solutions and whose degenerate diagonal blocks XT () and ST () of the central path are assumed to satisfy max{XT (), ST ()} = O(). We establish the convergence of the central path towards a primal-dual optimal solution, which is characterized as being the unique optimal solution of a certain log-barrier problem. A characterization of the class of SDP problems which satisfy our assumptions are also provided. It is shown that the re-parametrization t> 0 (X(t4), S(t4), y(t4)) of the central path is analytic at t = 0. The limiting behavior of the derivative of the central path is also investigated and it is shown that the order of convergence of the central path towards its limit point is O(). Finally, we apply our results to the convex quadratically constrained convex programming (CQCCP) problem and characterize the class of CQCCP problems which can be formulated as SDPs satisfying the assumptions of this paper. In particular, we show that CQCCP problems with either a strictly convex objective function or at least one strictly convex constraint function lie in this class. [PUBLICATION ABSTRACT]
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0025-5610
1436-4646
DOI:10.1007/s10107-004-0555-2