Fast alternating linearization methods for minimizing the sum of two convex functions
We present in this paper alternating linearization algorithms based on an alternating direction augmented Lagrangian approach for minimizing the sum of two convex functions. Our basic methods require at most iterations to obtain an optimal solution, while our accelerated (i.e., fast) versions of th... Full description
Journal Title:  Mathematical programming 20120324, Vol.141 (12), p.349382 
Main Author:  Goldfarb, Donald 
Other Authors:  Ma, Shiqian , Scheinberg, Katya 
Format:  Electronic Article 
Language: 
English 
Subjects:  
Publisher:  Berlin/Heidelberg: Springer Berlin Heidelberg 
ID:  ISSN: 00255610 
Zum Text: 
SendSend as email
Add to Book BagAdd to Book Bag
Staff View
recordid:  cdi_gale_infotracacademiconefile_A342528795 
title:  Fast alternating linearization methods for minimizing the sum of two convex functions 
format:  Article 
creator: 

subjects: 

ispartof:  Mathematical programming, 20120324, Vol.141 (12), p.349382 
description:  We present in this paper alternating linearization algorithms based on an alternating direction augmented Lagrangian approach for minimizing the sum of two convex functions. Our basic methods require at most iterations to obtain an optimal solution, while our accelerated (i.e., fast) versions of them require at most iterations, with little change in the computational effort required at each iteration. For both types of methods, we present one algorithm that requires both functions to be smooth with Lipschitz continuous gradients and one algorithm that needs only one of the functions to be so. Algorithms in this paper are GaussSeidel type methods, in contrast to the ones proposed by Goldfarb and Ma in (Fast multiple splitting algorithms for convex optimization, Columbia University, 2009 ) where the algorithms are Jacobi type methods. Numerical results are reported to support our theoretical conclusions and demonstrate the practical potential of our algorithms. 
language:  eng 
source:  
identifier:  ISSN: 00255610 
fulltext:  no_fulltext 
issn: 

url:  Link 
@attributes 
 
PrimoNMBib 
