Related references
Note: Only part of the references are listed.ITERATION-COMPLEXITY OF BLOCK-DECOMPOSITION ALGORITHMS AND THE ALTERNATING DIRECTION METHOD OF MULTIPLIERS
Renato D. C. Monteiro et al.
SIAM JOURNAL ON OPTIMIZATION (2013)
ITERATION-COMPLEXITY OF A NEWTON PROXIMAL EXTRAGRADIENT METHOD FOR MONOTONE VARIATIONAL INEQUALITIES AND INCLUSION PROBLEMS
Renato D. C. Monteiro et al.
SIAM JOURNAL ON OPTIMIZATION (2012)
COMPLEXITY OF VARIANTS OF TSENG'S MODIFIED F-B SPLITTING AND KORPELEVICH'S METHODS FOR HEMIVARIATIONAL INEQUALITIES WITH APPLICATIONS TO SADDLE-POINT AND CONVEX OPTIMIZATION PROBLEMS
Renato D. C. Monteiro et al.
SIAM JOURNAL ON OPTIMIZATION (2011)
ON THE COMPLEXITY OF THE HYBRID PROXIMAL EXTRAGRADIENT METHOD FOR THE ITERATES AND THE ERGODIC MEAN
Renato D. C. Monteiro et al.
SIAM JOURNAL ON OPTIMIZATION (2010)
A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
Amir Beck et al.
SIAM JOURNAL ON IMAGING SCIENCES (2009)
Accelerating the cubic regularization of Newton's method on convex problems
Yu. Nesterov
MATHEMATICAL PROGRAMMING (2008)
Smooth minimization of non-smooth functions
Y Nesterov
MATHEMATICAL PROGRAMMING (2005)
Monotone operators representable by l.s.c. convex functions
JE Martínez-Legaz et al.
SET-VALUED ANALYSIS (2005)
A unified framework for some inexact proximal point algorithms
MV Solodov et al.
NUMERICAL FUNCTIONAL ANALYSIS AND OPTIMIZATION (2001)
An inexact hybrid generalized proximal point algorithm and some new results on the theory of Bregman functions
MV Solodov et al.
MATHEMATICS OF OPERATIONS RESEARCH (2000)
Share Paper
