東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

FindBook

Google Book

Amazon

博客來

Primal-Dual Proximal Optimization Algorithms with Bregman Divergences.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Primal-Dual Proximal Optimization Algorithms with Bregman Divergences./
作者:	Jiang, Xin.
出版者:	Ann Arbor : ProQuest Dissertations & Theses, : 2022,
面頁冊數:	117 p.
附註:	Source: Dissertations Abstracts International, Volume: 83-12, Section: B.
Contained By:	Dissertations Abstracts International83-12B.
標題:	Electrical engineering. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=29215970
ISBN:	9798834014713

Primal-Dual Proximal Optimization Algorithms with Bregman Divergences.
Jiang, Xin.

Primal-Dual Proximal Optimization Algorithms with Bregman Divergences. - Ann Arbor : ProQuest Dissertations & Theses, 2022 - 117 p.

Source: Dissertations Abstracts International, Volume: 83-12, Section: B.

Thesis (Ph.D.)--University of California, Los Angeles, 2022.

This item must not be sold to any third party vendors.

Proximal methods are an important class of algorithms for solving nonsmooth, constrained, large-scale or distributed optimization problems. Because of their flexibility and scalability, they are widely used in current applications in engineering, machine learning, and data science. The key idea of proximal algorithms is the decomposition of a large-scale optimization problem into several smaller, simpler problems, in which the basic operation is the evaluation of the proximal operator of a function. The proximal operator minimizes the function regularized by a squared Euclidean distance, and it generalizes the Euclidean projection onto a closed convex set. Since the cost of the evaluation of proximal operators often dominates the per-iteration complexity in a proximal algorithm, efficient evaluation of proximal operators is critical. To this end, generalized Bregman proximal operators based on non-Euclidean distances have been proposed and incorporated in many algorithms and applications. In the first part of this dissertation, we present primal-dual proximal splitting methods for convex optimization, in which generalized Bregman distances are used to define the primal and dual update steps. The proposed algorithms can be viewed as Bregman extensions of many well- known proximal methods. For these algorithms, we analyze the theoretical convergence and develop techniques to improve practical implementation.In the second part of the dissertation, we apply the Bregman proximal splitting algorithms to the centering problem in large-scale semidefinite programming with sparse coefficient matrices. The logarithmic barrier function for the cone of positive semidefinite completable sparse matrices is used as the distance-generating kernel. For this distance, the complexity of evaluating the Bregman proximal operator is shown to be roughly proportional to the cost of a sparse Cholesky factorization. This is much cheaper than the standard proximal operator with Euclidean distances, which requires an eigenvalue decomposition. Therefore, the proposed Bregman proximal algorithms can handle sparse matrix constraints with sizes that are orders of magnitude larger than the problems solved by standard interior-point methods and proximal methods.

ISBN: 9798834014713Subjects--Topical Terms:

649834
Electrical engineering.
Subjects--Index Terms:

Bregman divergence

Primal-Dual Proximal Optimization Algorithms with Bregman Divergences.
LDR:03368nmm a2200337 4500 001 2351655
005 20221107090150.5
008 241004s2022 ||||||||||||||||| ||eng d
020 $a 9798834014713
035 $a (MiAaPQ)AAI29215970
035 $a AAI29215970
040 $a MiAaPQ $c MiAaPQ
100 1 $a Jiang, Xin. $3 1932614
245 1 0 $a Primal-Dual Proximal Optimization Algorithms with Bregman Divergences.
260 1 $a Ann Arbor : $b ProQuest Dissertations & Theses, $c 2022
300 $a 117 p.
500 $a Source: Dissertations Abstracts International, Volume: 83-12, Section: B.
500 $a Advisor: Vandenberghe, Lieven.
502 $a Thesis (Ph.D.)--University of California, Los Angeles, 2022.
506 $a This item must not be sold to any third party vendors.
520 $a Proximal methods are an important class of algorithms for solving nonsmooth, constrained, large-scale or distributed optimization problems. Because of their flexibility and scalability, they are widely used in current applications in engineering, machine learning, and data science. The key idea of proximal algorithms is the decomposition of a large-scale optimization problem into several smaller, simpler problems, in which the basic operation is the evaluation of the proximal operator of a function. The proximal operator minimizes the function regularized by a squared Euclidean distance, and it generalizes the Euclidean projection onto a closed convex set. Since the cost of the evaluation of proximal operators often dominates the per-iteration complexity in a proximal algorithm, efficient evaluation of proximal operators is critical. To this end, generalized Bregman proximal operators based on non-Euclidean distances have been proposed and incorporated in many algorithms and applications. In the first part of this dissertation, we present primal-dual proximal splitting methods for convex optimization, in which generalized Bregman distances are used to define the primal and dual update steps. The proposed algorithms can be viewed as Bregman extensions of many well- known proximal methods. For these algorithms, we analyze the theoretical convergence and develop techniques to improve practical implementation.In the second part of the dissertation, we apply the Bregman proximal splitting algorithms to the centering problem in large-scale semidefinite programming with sparse coefficient matrices. The logarithmic barrier function for the cone of positive semidefinite completable sparse matrices is used as the distance-generating kernel. For this distance, the complexity of evaluating the Bregman proximal operator is shown to be roughly proportional to the cost of a sparse Cholesky factorization. This is much cheaper than the standard proximal operator with Euclidean distances, which requires an eigenvalue decomposition. Therefore, the proposed Bregman proximal algorithms can handle sparse matrix constraints with sizes that are orders of magnitude larger than the problems solved by standard interior-point methods and proximal methods.
590 $a School code: 0031.
650 4 $a Electrical engineering. $3 649834
650 4 $a Mathematics. $3 515831
653 $a Bregman divergence
653 $a Convex optimization
653 $a First-order algorithms
690 $a 0544
690 $a 0405
710 2 $a University of California, Los Angeles. $b Electrical and Computer Engineering 0333. $3 3542511
773 0 $t Dissertations Abstracts International $g 83-12B.
790 $a 0031
791 $a Ph.D.
792 $a 2022
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=29215970