Alternating Projection-Proximal Methods for Convex Programming and Variational Inequalities-Reference-Cited by-同舟云学术

Alternating Projection-Proximal Methods for Convex Programming and Variational Inequalities

Published:1997-11 Issue:4 Volume:7 Page:951-965
ISSN:1052-6234
Container-title:SIAM Journal on Optimization
language:en
Short-container-title:SIAM J. Optim.

Author:

Tseng Paul

Publisher

Society for Industrial & Applied Mathematics (SIAM)

Subject

Theoretical Computer Science,Software

Link

http://epubs.siam.org/doi/pdf/10.1137/S1052623495279797

Reference25 articles.

1. D.Bertsekas, Uslovnaya optimizatsiya i metody mnozhitelei Lagranzha, “Radio i Svyaz’”, 1987, 400–0, Translated from the English by N. V. Tret’yakov; Translation edited and with a preface by E. G. Gol’shtei˘n88j:90181

2. A proximal-based decomposition method for convex minimization problems

3. On the Douglas—Rachford splitting method and the proximal point algorithm for maximal monotone operators

4. A parallel descent algorithm for convex programming

5. Two-Metric Projection Methods for Constrained Optimization

Cited by 95 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A self-adaptive descent LQP alternating direction method for the structured variational inequalities;Numerical Algorithms;2020-03-10

2. A Stabilizing Control Algorithm for Asynchronous Parallel Quadratic Programing via Dual Decomposition;ASME Letters in Dynamic Systems and Control;2020-03-03

3. An augmented Lagrangian alternating direction method for overlapping community detection based on symmetric nonnegative matrix factorization;International Journal of Machine Learning and Cybernetics;2019-07-24

4. A fast regularized iterative algorithm for fan-beam CT reconstruction;Physics in Medicine & Biology;2019-07-11

5. A new descent alternating direction method with LQP regularization for the structured variational inequalities;Optimization Letters;2018-04-11