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)- Subgradient methods for saddle-point problems
- Primal-dual subgradient methods for convex problems
- Stochastic mirror descent dynamics and their convergence in monotone variational inequalities
- A simplified view of first order methods for optimization
- On the information-adaptive variants of the ADMM: an iteration complexity perspective
- Bounded perturbation resilience of extragradient-type methods and their applications
- Accelerated schemes for a class of variational inequalities
- On stochastic mirror-prox algorithms for stochastic Cartesian variational inequalities: randomized block coordinate and optimal averaging schemes
- A cyclic block coordinate descent method with generalized gradient projections
- Level-set methods for convex optimization
- On the optimal linear convergence rate of a generalized proximal point algorithm
- An optimal randomized incremental gradient method
- A simple algorithm for a class of nonsmooth convex-concave saddle-point problems
- A first-order primal-dual algorithm for convex problems with applications to imaging
- Accelerated linearized Bregman method
- A double smoothing technique for solving unconstrained nondifferentiable convex optimization problems
- Iteration-complexity of first-order penalty methods for convex programming
- New version of mirror prox for variational inequalities with adaptation to inexactness
- Nonsymmetric proximal point algorithm with moving proximal centers for variational inequalities: convergence analysis
- Dynamic stochastic approximation for multi-stage stochastic optimization
- A golden ratio primal-dual algorithm for structured convex optimization
- On the analysis of variance-reduced and randomized projection variants of single projection schemes for monotone stochastic variational inequality problems
- Infinite-dimensional gradient-based descent for alpha-divergence minimisation
- Iteration complexity of generalized complementarity problems
- Weak and strong convergence Bregman extragradient schemes for solving pseudo-monotone and non-Lipschitz variational inequalities
- Bregman subgradient extragradient method with monotone self-adjustment stepsize for solving pseudo-monotone variational inequalities and fixed point problems
- Convergence of the method of extrapolation from the past for variational inequalities in uniformly convex Banach spaces
- Convergence of the operator extrapolation method for variational inequalities in Banach spaces
- Learning in nonatomic games. I: Finite action spaces and population games
- Local saddle points for unconstrained polynomial optimization
- On iteration complexity of a first-order primal-dual method for nonlinear convex cone programming
- Accelerated gradient sliding for structured convex optimization
- Cubic regularized Newton method for the saddle point models: a global and local convergence analysis
- On lower iteration complexity bounds for the convex concave saddle point problems
- An \(O(s^r)\)-resolution ODE framework for understanding discrete-time algorithms and applications to the linear convergence of minimax problems
- Proportional-integral projected gradient method for conic optimization
- Extragradient and extrapolation methods with generalized Bregman distances for saddle point problems
- Generalized mirror prox algorithm for monotone variational inequalities: Universality and inexact oracle
- The saddle point problem of polynomials
- A stochastic primal-dual method for a class of nonconvex constrained optimization
- On the linear convergence of the general first order primal-dual algorithm
- Inertial self-adaptive Bregman projection method for finite family of variational inequality problems in reflexive Banach spaces
- Inexact first-order primal-dual algorithms
- Image restoration based on the minimized surface regularization
- Efficient first-order methods for convex minimization: a constructive approach
- Golden ratio algorithms for variational inequalities
- A double extrapolation primal-dual algorithm for saddle point problems
- Accelerated methods for saddle-point problem
- An adaptive two-stage proximal algorithm for equilibrium problems in Hadamard spaces
- Lower complexity bounds of first-order methods for convex-concave bilinear saddle-point problems
- Forward-reflected-backward method with variance reduction
- Primal-dual proximal splitting and generalized conjugation in non-smooth non-convex optimization
- Regret bounded by gradual variation for online convex optimization
- Optimal stochastic extragradient schemes for pseudomonotone stochastic variational inequality problems and their variants
- Faster algorithms for extensive-form game solving via improved smoothing functions
- Distributionally robust optimization with correlated data from vector autoregressive processes
- Communication-efficient algorithms for decentralized and stochastic optimization
- Saddle points of rational functions
- Exploiting problem structure in optimization under uncertainty via online convex optimization
- Self-concordant inclusions: a unified framework for path-following generalized Newton-type algorithms
- Convergence of two-stage method with Bregman divergence for solving variational inequalities
- Bregman extragradient method with monotone rule of step adjustment
- A telescopic Bregmanian proximal gradient method without the global Lipschitz continuity assumption
- An adaptive proximal method for variational inequalities
- An efficient primal dual prox method for non-smooth optimization
- On the convergence properties of non-Euclidean extragradient methods for variational inequalities with generalized monotone operators
- Mirror Prox algorithm for multi-term composite minimization and semi-separable problems
- On the efficiency of a randomized mirror descent algorithm in online optimization problems
- Decomposition techniques for bilinear saddle point problems and variational inequalities with affine monotone operators
- On non-ergodic convergence rate of the operator splitting method for a class of variational inequalities
- On the iteration complexity of some projection methods for monotone linear variational inequalities
- Nearly linear-time packing and covering LP solvers. Nearly linear-time packing and covering LP solvers, achieving width-independence and =(1/)-convergence
- Randomized first order algorithms with applications to \(\ell _{1}\)-minimization
- On the \(O(1/t)\) convergence rate of the LQP prediction-correction method
- Partial Lagrangian relaxation for the unbalanced orthogonal Procrustes problem
- Bundle-level type methods uniformly optimal for smooth and nonsmooth convex optimization
- PPA-like contraction methods for convex optimization: a framework using variational inequality approach
- Solving variational inequalities with monotone operators on domains given by linear minimization oracles
- A semi-definite programming approach for robust tracking
- Adaptive two-stage Bregman method for variational inequalities
- Customized alternating direction methods of multipliers for generalized multi-facility Weber problem
- Adaptive extraproximal algorithm for the equilibrium problem in Hadamard spaces
- Stochastic first-order methods for convex and nonconvex functional constrained optimization
- An implicit gradient-descent procedure for minimax problems
- A majorized ADMM with indefinite proximal terms for linearly constrained convex composite optimization
- An \(\mathcal O(1/{k})\) convergence rate for the variable stepsize Bregman operator splitting algorithm
- Sparse learning for large-scale and high-dimensional data: a randomized convex-concave optimization approach
- A subgradient method for free material design
- Primal-dual first-order methods for a class of cone programming
- On the Number of Iterations for Dantzig--Wolfe Optimization and Packing-Covering Approximation Algorithms
- Sublinear time algorithms for approximate semidefinite programming
- On the ergodic convergence rates of a first-order primal-dual algorithm
- Rescaled coordinate descent methods for linear programming
- A proximal strictly contractive Peaceman-Rachford splitting method for convex programming with applications to imaging
- A hybrid proximal extragradient self-concordant primal barrier method for monotone variational inequalities
- Accelerating block-decomposition first-order methods for solving composite saddle-point and two-player Nash equilibrium problems
- Structured sparsity: discrete and convex approaches
- An accelerated HPE-type algorithm for a class of composite convex-concave saddle-point problems
- Recovery of high-dimensional sparse signals via \(\ell_1\)-minimization
- Sparse non Gaussian component analysis by semidefinite programming
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)
