A Line-Search-Based Partial Proximal Alternating Directions Method for Separable Convex Optimization
We propose an appealing line-search-based partial proximal alternating directions (LSPPAD) method for solving a class of separable convex optimization problems. These problems under consideration are common in practice. The proposed method solves two subproblems at each iteration: one is solved by a...
Main Authors: | Yu-hua Zeng, Yu-fei Yang, Zheng Peng |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2014-01-01
|
Series: | Journal of Applied Mathematics |
Online Access: | http://dx.doi.org/10.1155/2014/540450 |
Similar Items
-
MULTIPLIER METHOD FOR PROXIMAL CONVEX OPTIMIZATION SEPARABLE
by: Erik Alex Papa Quiroz, et al.
Published: (2014-09-01) -
STUDIES ON ALTERNATING DIRECTION METHOD OF MULTIPLIERS WITH ADAPTIVE PROXIMAL TERMS FOR CONVEX OPTIMIZATION PROBLEMS
by: Gu, Yan
Published: (2020) -
Alternating Direction Method of Multipliers for Separable Convex Optimization of Real Functions in Complex Variables
by: Lu Li, et al.
Published: (2015-01-01) -
Optimizing Optimization: Scalable Convex Programming with Proximal Operators
by: Wytock, Matt
Published: (2016) -
Convergence Analysis of Alternating Direction Method of Multipliers for a Class of Separable Convex Programming
by: Zehui Jia, et al.
Published: (2013-01-01)