Abstract
A nonsmooth PGD scheme for minimizing a nonsmooth convex function is presented. In the parallelization step of the algorithm, a method due to Pang, Han and Pangaraj (1991), [7], is employed to solve a subproblem for constructing search directions. The convergence analysis is given as well.
Similar content being viewed by others
References
A. Auslender,Optimisation Methodes Numeriques, Masson, Paris 1976.
D. P. Bertsekas and J. N. Tsitsiklis,Parallel and Distributed Computation: Numerical Methods, Prentice-Hall: Englewood Cliffs, New Jersey, 1989.
M.C. Ferris and O.L. Mangasarian,Parallel variable distribution, SIAM J. on Optimization4 (1994), 102–126.
M. Fukushima,SIAM Parallel variable transformstion in unconstrained optimization, SIAM J. Optimization8 (1998), 658–672.
O. L. Mangasarian,Parallel gradient distribution in unconstrained optimization, SIAM J. Control Optim.33 (1995), 1916–1925.
J. M. Ortega and W. C. Rheinboldt,Iterative Solution of Nonlinear Equations in Several Variables, Academic Press, New York, 1970.
J. S. Pang, S. P. Han and N. Pangaraj,Mininization of locally lipschitzian functions, SIAM J. Optimization1 (1991), 57–82.
M.V. Solodov,New inexact parallel variable distribution algorithms, Computational Optimization and Applications7 (1997), 165–182.
P. Tseng,Convergence of block coordinate desecent method for nondifferentiable minimization, J. Optim. Theory Appl.109 (2001), 475–494.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Shan, F., Pang, LP. A syncro-parallel nonsmooth PGD algorithm for nonsmooth optimization. J. Appl. Math. Comput. 24, 333–342 (2007). https://doi.org/10.1007/BF02832322
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02832322