Optimization Online


Regularized Interior Proximal Alternating Direction Method for Separable Convex Optimization Problems

Felipe Alvarez(falvarez***at***dim.uchile.cl)
Julio Lopez(julio.lopez***at***udp.cl)
Natalia Ruiz(natalia.r1103***at***gmail.com)

Abstract: In this article we present a version of the proximal alternating direction method for a convex problem with linear constraints and a separable objective function, in which the standard quadratic regularizing term is replaced with an interior proximal metric for those variables that are required to satisfy some additional convex constraints. Moreover, the proposed method has the advantage that the iterates are computed only approximately. Under standard assumptions, global convergence of the primal-dual sequences computed by the algorithm is established. Finally, we report some numerical experiments applied to statistical learning problems to illustrate the behavior of our algorithm.

Keywords: Alternating direction methods \and Decomposition, Interior-point methods, Statistical learning problem

Category 1: Convex and Nonsmooth Optimization (Convex Optimization )

Category 2: Nonlinear Optimization (Constrained Nonlinear Optimization )

Citation: Unpublished. Submitted to Journal. December/2015.

Download: [PDF]

Entry Submitted: 01/04/2016
Entry Accepted: 01/04/2016
Entry Last Modified: 01/04/2016

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society