##
**A line-search-based partial proximal alternating directions method for separable convex optimization.**
*(English)*
Zbl 1442.90148

Summary: 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 proximal point method, while the proximal term is absent from the other. Both subproblems admit inexact solutions. A line search technique is used to guarantee the convergence. The convergence of the LSPPAD method is established under some suitable conditions. The advantage of the proposed method is that it provides the tractability of the subproblem in which the proximal term is absent. Numerical tests show that the LSPPAD method has better performance compared with the existing alternating projection based prediction-correction (APBPC) method if both are employed to solve the described problem.

### MSC:

90C25 | Convex programming |

PDF
BibTeX
XML
Cite

\textit{Y.-h. Zeng} et al., J. Appl. Math. 2014, Article ID 540450, 8 p. (2014; Zbl 1442.90148)

Full Text:
DOI

### References:

[1] | Chen, G.; Teboulle, M., A proximal-based decomposition method for convex minimization problems, Mathematical Programming, 64, 1, Ser. A, 81-101 (1994) · Zbl 0823.90097 |

[2] | Tseng, P., Alternating projection-proximal methods for convex programming and variational inequalities, SIAM Journal on Optimization, 7, 4, 951-965 (1997) · Zbl 0914.90218 |

[3] | He, B.; Liao, L.-Z.; Han, D.; Yang, H., A new inexact alternating directions method for monotone variational inequalities, Mathematical Programming, 92, 1, 103-118 (2002) · Zbl 1009.90108 |

[4] | He, B.-S.; Liao, L.-Z.; Qian, M.-J., Alternating projection based prediction-correction methods for structured variational inequalities, Journal of Computational Mathematics, 24, 6, 693-710 (2006) |

[5] | He, B.-S.; Wang, S.-l.; Yang, H., A modified variable-penalty alternating directions method for monotone variational inequalities, Journal of Computational Mathematics, 21, 4, 495-504 (2003) |

[6] | He, B.; Zhou, J., A modified alternating direction method for convex minimization problems, Applied Mathematics Letters, 13, 2, 123-130 (2000) · Zbl 0988.90020 |

[7] | Parente, L. A.; Lotito, P. A.; Solodov, M. V., A class of inexact variable metric proximal point algorithms, SIAM Journal on Optimization, 19, 1, 240-260 (2008) · Zbl 1190.90216 |

[8] | Smoczynski, P.; Tawhid, M. A., Two numerical schemes for general variational inequalities, Journal of Industrial and Management Optimization, 4, 2, 393-406 (2008) · Zbl 1165.65036 |

[9] | He, B. S.; Yang, H.; Wang, S. L., Alternating direction method with self-adaptive penalty parameters for monotone variational inequalities, Journal of Optimization Theory and Applications, 106, 2, 337-356 (2000) · Zbl 0997.49008 |

[10] | Yin, W.; Osher, S.; Goldfarb, D.; Darbon, J., Bregman iterative algorithms for l1-minimization with applications to compressed sensing, SIAM Journal on Imaging Sciences, 1, 1, 143-168 (2008) · Zbl 1203.90153 |

This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.