On the Convergence of the Entropy-Exponential Penalty Trajectories and Generalized Proximal Point Methods in Semidefinite Optimization
O. P. Ferreira (orizonmat.ufg.br)
Abstract: The convergence of primal and dual central paths associated to entropy and exponential functions, respectively, for semidefinite programming problem are studied in this paper. As an application, the proximal point method with the Kullback-Leibler distance applied to semidefinite programming problems is considered, and the convergence of primal and dual sequences is proved.
Keywords: generalized proximal point methods, Bregman distances, central path, semidefinite programming.
Category 1: Linear, Cone and Semidefinite Programming
Category 2: Linear, Cone and Semidefinite Programming (Semi-definite Programming )
Citation: Journal of Global Optimization, 45, 211-227, 2009
Entry Submitted: 07/10/2006
Modify/Update this entry
|Visitors||Authors||More about us||Links|
Search, Browse the Repository
Give us feedback
|Optimization Journals, Sites, Societies|