An implementable first-order primal-dual algorithm for structured convex optimization (Q1724030): Difference between revisions
From MaRDI portal
m rollbackEdits.php mass rollback Tag: Rollback |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1155/2014/396753 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1993665416 / rank | |||
Normal rank |
Revision as of 18:43, 21 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An implementable first-order primal-dual algorithm for structured convex optimization |
scientific article |
Statements
An implementable first-order primal-dual algorithm for structured convex optimization (English)
0 references
14 February 2019
0 references
Summary: Many application problems of practical interest can be posed as structured convex optimization models. In this paper, we study a new first-order primaldual algorithm. The method can be easily implementable, provided that the resolvent operators of the component objective functions are simple to evaluate. We show that the proposed method can be interpreted as a proximal point algorithm with a customized metric proximal parameter. Convergence property is established under the analytic contraction framework. Finally, we verify the efficiency of the algorithm by solving the stable principal component pursuit problem.
0 references