A customized proximal point algorithm for convex minimization with linear constraints

Bingsheng He, Xiaoming YUAN*, Wenxing Zhang

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

27 Citations (Scopus)

Abstract

This paper demonstrates a customized application of the classical proximal point algorithm (PPA) to the convex minimization problem with linear constraints. We show that if the proximal parameter in metric form is chosen appropriately, the application of PPA could be effective to exploit the simplicity of the objective function. The resulting subproblems could be easier than those of the augmented Lagrangian method (ALM), a benchmark method for the model under our consideration. The efficiency of the customized application of PPA is demonstrated by some image processing problems.

Original languageEnglish
Pages (from-to)559-572
Number of pages14
JournalComputational Optimization and Applications
Volume56
Issue number3
DOIs
Publication statusPublished - Dec 2013

Scopus Subject Areas

  • Control and Optimization
  • Computational Mathematics
  • Applied Mathematics

User-Defined Keywords

  • Augmented Lagrangian method
  • Convex minimization
  • Proximal point algorithm
  • Resolvent operator

Fingerprint

Dive into the research topics of 'A customized proximal point algorithm for convex minimization with linear constraints'. Together they form a unique fingerprint.

Cite this