An Accelerated HPE-Type Algorithm for a Class of Composite Convex-Concave Saddle-Point Problems
DOI10.1137/14096757XzbMath1329.90179MaRDI QIDQ3465236
Renato D. C. Monteiro, Yunlong He
Publication date: 21 January 2016
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
complexitysmoothingsaddle-point probleminexact proximal point methodmonotone inclusion problemhybrid proximal extragradientcomposite convex optimizationaccelerated method
65K05: Numerical mathematical programming methods
90C25: Convex programming
90C60: Abstract computational complexity for mathematical programming problems
90C30: Nonlinear programming
47J20: Variational and other types of inequalities involving nonlinear operators (general)
65K10: Numerical optimization and variational techniques
47H05: Monotone operators and generalizations
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Smooth minimization of non-smooth functions
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A primal-dual splitting method for convex optimization involving Lipschitzian, proximable and linear composite terms
- Primal-dual splitting algorithm for solving inclusions with mixtures of composite, Lipschitzian, and parallel-sum type monotone operators
- Enlargement of monotone operators with applications to variational inequalities
- A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator
- A first-order primal-dual algorithm for convex problems with applications to imaging
- A splitting algorithm for dual monotone inclusions involving cocoercive operators
- On the maximal monotonicity of subdifferential mappings
- An Inexact Hybrid Generalized Proximal Point Algorithm and Some New Results on the Theory of Bregman Functions
- A UNIFIED FRAMEWORK FOR SOME INEXACT PROXIMAL POINT ALGORITHMS*
- On the Complexity of the Hybrid Proximal Extragradient Method for the Iterates and the Ergodic Mean
- 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
- Monotone Operators and the Proximal Point Algorithm
- Variational Analysis
- Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems
- A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings
- Optimal Primal-Dual Methods for a Class of Saddle Point Problems
- Iteration-Complexity of Block-Decomposition Algorithms and the Alternating Direction Method of Multipliers