Document Type

Journal Article

Department/Unit

Department of Mathematics

Title

Customized proximal point algorithms for linearly constrained convex minimization and saddle-point problems: A unified approach

Language

English

Abstract

This paper focuses on some customized applications of the proximal point algorithm (PPA) to two classes of problems: the convex minimization problem with linear constraints and a generic or separable objective function, and a saddle-point problem. We treat these two classes of problems uniformly by a mixed variational inequality, and show how the application of PPA with customized metric proximal parameters can yield favorable algorithms which are able to make use of the models' structures effectively. Our customized PPA revisit turns out to unify some algorithms including some existing ones in the literature and some new ones to be proposed. From the PPA perspective, we establish the global convergence and a worst-case O(1/t) convergence rate for this series of algorithms in a unified way. © 2013 Springer Science+Business Media New York.

Keywords

Convergence rate, Convex minimization, Customized algorithms, Proximal point algorithm, Saddle-point problem, Splitting algorithms

Publication Date

2014

Source Publication Title

Computational Optimization and Applications

Volume

59

Issue

2-1

Start Page

135

End Page

161

Publisher

Springer Verlag

DOI

10.1007/s10589-013-9616-x

Link to Publisher's Edition

http://dx.doi.org/10.1007/s10589-013-9616-x

ISSN (print)

09266003

ISSN (electronic)

15732894

This document is currently not available here.

Share

COinS