Fetching the paper…
Reading the bibliography…
We develop an inexact primal-dual first-order smoothing framework to solve a class of non-bilinear saddle point problems with primal strong convexity.
Nonlinear Programming
Dimitri P. Bertsekas · 1999
Earlier work this paper cites.
Essential smoothness, essential strict convexity, and legendre functions in Banach spaces
Heinz H. Bauschke, Jonathan M. Borwein, and Patrick L. Combettes · 2001
Earlier work this paper cites.
Convex Optimization
Stephen Boyd and Lieven Vandenberghe · 2004
Earlier work this paper cites.
Excessive gap technique in nonsmooth convex minimization
Yu. Nesterov · 2005
Earlier work this paper cites.
Smooth minimization of non-smooth functions
Yu. Nesterov · 2005
Earlier work this paper cites.
Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing)
Thomas M. Cover and Joy A. Thomas · 2006
Earlier work this paper cites.
On accelerated proximal gradient methods for convex-concave optimization
Paul Tseng · 2008
Earlier work this paper cites.
Subgradient methods for saddle-point problems
A. Nedić and A. Ozdaglar · 2009
Earlier work this paper cites.
Primal-dual subgradient methods for convex problems
Yu. Nesterov · 2009
Earlier work this paper cites.
Solving variational inequalities with stochastic mirror-prox algorithm
Anatoli Juditsky, Arkadi Nemirovski, and Claire Tauvel · 2011
Earlier work this paper cites.
Convergence rates of inexact proximal-gradient methods for convex optimization
Mark Schmidt, Nicolas L Roux, and Francis R Bach · 2011
Earlier work this paper cites.
First-Order Methods for Nonsmooth Convex Large-Scale Optimization, II: Utilizing Problem’s Structure
Anatoli Juditsky and Arkadi Nemirovski · 2012
Cited alongside, same era.
Inexact and accelerated proximal point algorithms
Saverio Salzo and Silvia Villa · 2012
Cited alongside, same era.
Gradient methods for minimizing composite functions
Yu. Nesterov · 2013
Cited alongside, same era.
Rate analysis of inexact dual first-order methods application to dual decomposition
I. Necoara and V. Nedelcu · 2014
Cited alongside, same era.
A proximal stochastic gradient method with progressive variance reduction
Lin Xiao and Tong Zhang · 2014
Cited alongside, same era.
On the ergodic convergence rates of a first-order primal–dual algorithm
Antonin Chambolle and Thomas Pock · 2016
Cited alongside, same era.
An optimal randomized incremental gradient method
Guanghui Lan and Yi Zhou · 2018
Closest in time.
A level-set method for convex optimization with a feasible solution path
Q. Lin, S. Nadarajah, and N. Soheili · 2018
Closest in time.
A simplified view of first order methods for optimization
Marc Teboulle · 2018
Closest in time.
Contracting proximal methods for smooth convex optimization
Nikita Doikov and Yurii Nesterov · 2019
Closest in time.
Accelerated randomized mirror descent algorithms for composite non-strongly convex optimization
Le Thi Khanh Hien, Cuong Nguyen, Huan Xu, Lu Canyi, and Jiashi Feng · 2019
Closest in time.
Efficient algorithms for smooth minimax optimization
Kiran K Thekumparampil, Prateek Jain, Praneeth Netrapalli, and Sewoong Oh · 2019
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Accelerated proximal stochastic dual coordinate ascent for regularized loss minimization
Shai Shalev-Shwartz and Tong Zhang · 2016
Cited alongside, same era.
First-Order Methods in Optimization
Amir Beck · 2017
Cited alongside, same era.
Accelerated schemes for a class of variational inequalities
Yunmei Chen, Guanghui Lan, and Yuyuan Ouyang · 2017
Cited alongside, same era.
An accelerated non-euclidean hybrid proximal extragradient-type algorithm for convex–concave saddle-point problems
O. Kolossoski and R.D.C. Monteiro · 2017
Cited alongside, same era.
Iteration complexity of randomized primal-dual methods for convex-concave saddle point problems
E. Yazdandoost Hamedani, A. Jalilzadeh, N. S. Aybat, and U. V. Shanbhag · 2018
Cited alongside, same era.
Prox-method with rate of convergence
Arkadi Nemirovski
Cited in the paper.
Optimal algorithms for stochastic three-composite convex-concave saddle point problems
Renbo Zhao · 2019
Closest in time.
A primal-dual algorithm with line search for general convex-concave saddle point problems
Erfan Yazdandoost Hamedani and Necdet Serhat Aybat · 2021
Closest in time.
Iteration complexity of inexact augmented lagrangian methods for constrained convex programming
Yangyang Xu · 2021
Closest in time.
Affine-invariant contracting-point methods for convex optimization
Nikita Doikov and Yurii Nesterov · 2022
Closest in time.
A primal dual smoothing framework for max-structured nonconvex optimization
Renbo Zhao · 2022
Closest in time.