An accelerated HPE-type algorithm for a class of composite convex-concave saddle-point problems
From MaRDI portal
Publication:3465236
accelerated methodcomplexitycomposite convex optimizationhybrid proximal extragradientinexact proximal point methodmonotone inclusion problemsaddle-point problemsmoothing
Monotone operators and generalizations (47H05) Variational and other types of inequalities involving nonlinear operators (general) (47J20) Numerical mathematical programming methods (65K05) Numerical optimization and variational techniques (65K10) Convex programming (90C25) Nonlinear programming (90C30) Abstract computational complexity for mathematical programming problems (90C60)
Recommendations
- An accelerated non-Euclidean hybrid proximal extragradient-type algorithm for convex-concave saddle-point problems
- Accelerated methods for saddle-point problem
- Optimal primal-dual methods for a class of saddle point problems
- A simple algorithm for a class of nonsmooth convex-concave saddle-point problems
- Accelerated stochastic algorithms for convex-concave saddle-point problems
Cites work
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A first-order primal-dual algorithm for convex problems with applications to imaging
- A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator
- A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings
- A primal-dual splitting method for convex optimization involving Lipschitzian, proximable and linear composite terms
- A splitting algorithm for dual monotone inclusions involving cocoercive operators
- A UNIFIED FRAMEWORK FOR SOME INEXACT PROXIMAL POINT ALGORITHMS*
- An inexact hybrid generalized proximal point algorithm and some new results on the theory of Bregman functions
- 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
- Enlargement of monotone operators with applications to variational inequalities
- scientific article; zbMATH DE number 3534286 (Why is no real title available?)
- scientific article; zbMATH DE number 1369459 (Why is no real title available?)
- scientific article; zbMATH DE number 1821400 (Why is no real title available?)
- Iteration-complexity of block-decomposition algorithms and the alternating direction method of multipliers
- Monotone Operators and the Proximal Point Algorithm
- On the complexity of the hybrid proximal extragradient method for the iterates and the ergodic mean
- On the maximal monotonicity of subdifferential mappings
- Optimal primal-dual methods for a class of saddle point problems
- Primal-dual splitting algorithm for solving inclusions with mixtures of composite, Lipschitzian, and parallel-sum type monotone operators
- Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems
- Smooth minimization of non-smooth functions
- Variational Analysis
Cited in
(48)- An inexact Spingarn's partial inverse method with applications to operator splitting and composite optimization
- Point process estimation with Mirror Prox algorithms
- Acceleration of primal-dual methods by preconditioning and simple subproblem procedures
- A FISTA-type accelerated gradient algorithm for solving smooth nonconvex composite optimization problems
- Accelerated gradient sliding for structured convex optimization
- Accelerated inexact composite gradient methods for nonconvex spectral optimization problems
- An efficient adaptive accelerated inexact proximal point method for solving linearly constrained nonconvex composite problems
- On inexact relative-error hybrid proximal extragradient, forward-backward and Tseng's modified forward-backward methods with inertial effects
- Accelerated methods for saddle-point problem
- Lower complexity bounds of first-order methods for convex-concave bilinear saddle-point problems
- Primal-dual proximal splitting and generalized conjugation in non-smooth non-convex optimization
- Iteration complexity of an inexact Douglas-Rachford method and of a Douglas-Rachford-Tseng's F-B four-operator splitting method for solving monotone inclusions
- Fast bundle-level methods for unconstrained and ball-constrained convex optimization
- Sparse learning for large-scale and high-dimensional data: a randomized convex-concave optimization approach
- An accelerated hybrid proximal extragradient method for convex optimization and its implications to second-order methods
- Improved Pointwise Iteration-Complexity of A Regularized ADMM and of a Regularized Non-Euclidean HPE Framework
- Accelerating block-decomposition first-order methods for solving composite saddle-point and two-player Nash equilibrium problems
- An accelerated non-Euclidean hybrid proximal extragradient-type algorithm for convex-concave saddle-point problems
- A smooth primal-dual optimization framework for nonsmooth composite convex minimization
- Non-stationary First-Order Primal-Dual Algorithms with Faster Convergence Rates
- Accelerated first-order primal-dual proximal methods for linearly constrained composite convex programming
- A primal-dual algorithm with line search for general convex-concave saddle point problems
- Projection-free accelerated method for convex optimization
- New primal-dual algorithms for a class of nonsmooth and nonlinear convex-concave minimax problems
- Accelerated stochastic algorithms for convex-concave saddle-point problems
- On the convergence rate of the scaled proximal decomposition on the graph of a maximal monotone operator (SPDG) algorithm
- An Accelerated Inexact Proximal Point Method for Solving Nonconvex-Concave Min-Max Problems
- On the iteration-complexity of a non-Euclidean hybrid proximal extragradient framework and of a proximal ADMM
- Complexity of a quadratic penalty accelerated inexact proximal point method for solving linearly constrained nonconvex composite programs
- Reducing the Complexity of Two Classes of Optimization Problems by Inexact Accelerated Proximal Gradient Method
- Iteration Complexity of an Inner Accelerated Inexact Proximal Augmented Lagrangian Method Based on the Classical Lagrangian Function
- An adaptive superfast inexact proximal augmented Lagrangian method for smooth nonconvex composite optimization problems
- Solving strongly convex-concave composite saddle-point problems with low dimension of one group of variable
- A proximal neurodynamic model for solving inverse mixed variational inequalities
- A stochastic variance-reduced accelerated primal-dual method for finite-sum saddle-point problems
- A unified single-loop alternating gradient projection algorithm for nonconvex-concave and convex-nonconcave minimax problems
- Accelerated variance-reduced methods for saddle-point problems
- No-regret dynamics in the Fenchel game: a unified framework for algorithmic convex optimization
- An accelerated minimax algorithm for convex-concave saddle point problems with nonsmooth coupling function
- Randomized Lagrangian stochastic approximation for large-scale constrained stochastic Nash games
- A proximal neurodynamic model for a system of non-linear inverse mixed variational inequalities
- A proximal augmented Lagrangian method for linearly constrained nonconvex composite optimization problems
- Optimality conditions and numerical algorithms for a class of linearly constrained minimax optimization problems
- Accelerated minimax algorithms flock together
- On the initialization for convex-concave min-max problems
- Complexity of the relaxed Peaceman-Rachford splitting method for the sum of two maximal strongly monotone operators
- Pointwise and ergodic convergence rates of a variable metric proximal alternating direction method of multipliers
- VFOSA: variance-reduced fast operator splitting algorithms for generalized equations
This page was built for publication: An accelerated HPE-type algorithm for a class of composite convex-concave saddle-point problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3465236)
