Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems
From MaRDI portal
Publication:4652003
Recommendations
- On the \(O(1/t)\) convergence rate of the projection and contraction methods for variational inequalities with Lipschitz continuous monotone operators
- On the convergence rate of a class of proximal-based decomposition methods for monotone variational inequalities
- Pseudomonotone variational inequalities: Convergence of proximal methods
- scientific article; zbMATH DE number 2109090
- Proximal-like contraction methods for monotone variational inequalities in a unified framework. II: General methods and numerical experiments
- scientific article; zbMATH DE number 2084889
- The proximal point method for nonmonotone variational inequalities
- scientific article; zbMATH DE number 6179220
- scientific article; zbMATH DE number 2208618
- Convergence of the proximal point algorithm to approximate solutions of variational inequalities
Cited in
(only showing first 100 items - show all)- Large-scale semidefinite programming via a saddle point mirror-prox algorithm
- Numerical methods for variational inequalities and saddle point problems with relative inexact information
- Unifying mirror descent and dual averaging
- New version of mirror prox for variational inequalities with adaptation to inexactness
- Anderson acceleration of the proximal point method: the exact adaptive minimax, a spectral phase transition, and optimal safeguarding
- No-regret dynamics in the Fenchel game: a unified framework for algorithmic convex optimization
- Multicommodity network flows: A survey. II: Solution methods
- Robust Accelerated Primal-Dual Methods for Computing Saddle Points
- Variable sample-size operator extrapolation algorithm for stochastic mixed variational inequalities
- Newton and interior-point methods for (constrained) nonconvex-nonconcave minmax optimization with stability and instability guarantees
- A novel algorithm with self-adaptive technique for solving variational inequalities in Banach spaces
- A telescopic Bregmanian proximal gradient method without the global Lipschitz continuity assumption
- The saddle point problem of polynomials
- scientific article; zbMATH DE number 7415080 (Why is no real title available?)
- PPA-like contraction methods for convex optimization: a framework using variational inequality approach
- A semi-definite programming approach for robust tracking
- Solving variational inequalities with monotone operators on domains given by linear minimization oracles
- An implementable proximal point algorithmic framework for nuclear norm minimization
- Convergence of the method of extrapolation from the past for variational inequalities in uniformly convex Banach spaces
- Learning in nonatomic games. I: Finite action spaces and population games
- Inexact alternating-direction-based contraction methods for separable linearly constrained convex optimization
- Primal-dual proximal splitting and generalized conjugation in non-smooth non-convex optimization
- Korpelevich's method for variational inequality problems in Banach spaces
- Optimal stochastic extragradient schemes for pseudomonotone stochastic variational inequality problems and their variants
- An approximation-based regularized extra-gradient method for monotone variational inequalities
- An Accelerated Inexact Proximal Point Method for Solving Nonconvex-Concave Min-Max Problems
- Optimality Conditions for Nonsmooth Nonconvex-Nonconcave Min-Max Problems and Generative Adversarial Networks
- Potential Function-Based Framework for Minimizing Gradients in Convex and Min-Max Optimization
- New primal-dual algorithms for a class of nonsmooth and nonlinear convex-concave minimax problems
- An accelerated first-order regularized momentum descent ascent algorithm for stochastic nonconvex-concave minimax problems
- Extragradient sliding for composite non-monotone variational inequalities
- Approximation accuracy, gradient methods, and error bound for structured convex optimization
- An adaptive two-stage proximal algorithm for equilibrium problems in Hadamard spaces
- An optimal method for stochastic composite optimization
- A new efficient algorithm for finding common fixed points of multivalued demicontractive mappings and solutions of split generalized equilibrium problems in Hilbert spaces
- On verifiable sufficient conditions for sparse signal recovery via \(\ell_{1}\) minimization
- On the \(O(1/t)\) convergence rate of the LQP prediction-correction method
- Higher-order methods for convex-concave min-max optimization and monotone variational inequalities
- Inexact model: a framework for optimization and variational inequalities
- Communication-efficient algorithms for decentralized and stochastic optimization
- Fast computation of optimal transport via entropy-regularized extragradient methods
- Accelerated Bregman Primal-Dual Methods Applied to Optimal Transport and Wasserstein Barycenter Problems
- Dual subgradient algorithms for large-scale nonsmooth learning problems
- Self-concordant inclusions: a unified framework for path-following generalized Newton-type algorithms
- The backtrack Hölder gradient method with application to min-max and min-min problems
- An accelerated minimax algorithm for convex-concave saddle point problems with nonsmooth coupling function
- Online first-order framework for robust convex optimization
- Solving variational inequalities with stochastic mirror-prox algorithm
- Image restoration based on the minimized surface regularization
- Simple and optimal methods for stochastic variational inequalities. I: Operator extrapolation
- A smooth primal-dual optimization framework for nonsmooth composite convex minimization
- Improved guarantees for optimal Nash equilibrium seeking and bilevel variational inequalities
- Accelerated linearized Bregman method
- Strong convergence of the regularized operator extrapolation algorithm for variational inequalities
- The rate of convergence of Bregman proximal methods: local geometry versus regularity versus sharpness
- Two-timescale gradient descent ascent algorithms for nonconvex minimax optimization
- Forward-reflected-backward method with variance reduction
- Self-concordant barriers for convex approximations of structured convex sets
- Subgradient methods for saddle-point problems
- A randomized progressive hedging algorithm for stochastic variational inequality
- Dual extrapolation and its applications to solving variational inequalities and related problems
- On non-ergodic convergence rate of the operator splitting method for a class of variational inequalities
- Efficient search of first-order Nash equilibria in nonconvex-concave smooth min-max problems
- A double extrapolation primal-dual algorithm for saddle point problems
- Low-rank extragradient methods for scalable semidefinite optimization
- Primal-dual first-order methods with \({\mathcal {O}(1/\varepsilon)}\) iteration-complexity for cone programming
- Adaptive two-stage Bregman method for variational inequalities
- Second-order stochastic optimization for machine learning in linear time
- First-order methods for convex optimization
- Adaptive extraproximal algorithm for the equilibrium problem in Hadamard spaces
- A level-set method for convex optimization with a feasible solution path
- A proximal strictly contractive Peaceman-Rachford splitting method for convex programming with applications to imaging
- An acousto-electric inverse source problem
- Nonsymmetric proximal point algorithm with moving proximal centers for variational inequalities: convergence analysis
- Partial Lagrangian relaxation for the unbalanced orthogonal Procrustes problem
- On the information-adaptive variants of the ADMM: an iteration complexity perspective
- Local saddle points for unconstrained polynomial optimization
- Robust bond portfolio construction via convex-concave saddle point optimization
- scientific article; zbMATH DE number 7306897 (Why is no real title available?)
- Revisiting linearized Bregman iterations under Lipschitz-like convexity condition
- Stochastic Bregman extragradient algorithm with line search for stochastic mixed variational inequalities
- A unified analysis of variational inequality methods: variance reduction, sampling, quantization, and coordinate descent
- The finite termination of feasible solution sequence for optimization and variational inequality
- Stochastic projective splitting
- Smooth monotone stochastic variational inequalities and saddle point problems: a survey
- Extragradient and extrapolation methods with generalized Bregman distances for saddle point problems
- Saddle points of rational functions
- Regularized HPE-Type Methods for Solving Monotone Inclusions with Improved Pointwise Iteration-Complexity Bounds
- Inf-sup neural networks for high-dimensional elliptic PDE problems
- All saddle points for polynomial optimization
- A cyclic block coordinate descent method with generalized gradient projections
- An alternating direction method of multipliers with a worst-case \(O(1/n^2)\) convergence rate
- Decomposition techniques for bilinear saddle point problems and variational inequalities with affine monotone operators
- A primal-dual algorithm with line search for general convex-concave saddle point problems
- The generalized proximal point algorithm with step size 2 is not necessarily convergent
- Dynamic stochastic approximation for multi-stage stochastic optimization
- The geometry of monotone operator splitting methods
- On the linear convergence of the general first order primal-dual algorithm
- On the iteration complexity of some projection methods for monotone linear variational inequalities
- Inexact first-order primal-dual algorithms
This page was built for publication: Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4652003)
