IMI-BAS
 

BulDML at Institute of Mathematics and Informatics >
IMI >
IMI Periodicals >
Serdica Mathematical Journal >
2003 >
Volume 29 Number 1 >

Please use this identifier to cite or link to this item: http://hdl.handle.net/10525/1691

Title: A PVT-Type Algorithm for Minimizing a Nonsmooth Convex Function
Authors: Pang, Li-Ping
Xia, Zun-Quan
Keywords: Parallel Algorithm
Synchronous Parallel
Convex Minimization
Moreau-Yosida Regularization
Strong Convexity
Descent Condition
Forced Function
Issue Date: 2003
Publisher: Institute of Mathematics and Informatics Bulgarian Academy of Sciences
Citation: Serdica Mathematical Journal, Vol. 29, No 1, (2003), 11p-32p
Abstract: A general framework of the (parallel variable transformation) PVT-type algorithm, called the PVT-MYR algorithm, for minimizing a non-smooth convex function is proposed, via the Moreau-Yosida regularization. As a particular scheme of this framework an ε-scheme is also presented. The global convergence of this algorithm is given under the assumptions of strong convexity of the objective function and an ε-descent condition determined by an ε-forced function. An appendix stating the proximal point algorithm is recalled in the last section.
Description: 2000 Mathematics Subject Classification: 90C25, 68W10, 49M37.
URI: http://hdl.handle.net/10525/1691
ISSN: 1310-6600
Appears in Collections:Volume 29 Number 1

Files in This Item:

File Description SizeFormat
sjm-vol29-num1-2003-p011-p032.pdf518.05 kBAdobe PDFView/Open

 



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

 

Valid XHTML 1.0! DSpace Software Copyright © 2002-2009  The DSpace Foundation - Feedback