Pages that link to "Item:Q4652003"
From MaRDI portal
The following pages link to Prox-Method with Rate of Convergence <i>O</i>(1/<i>t</i>) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems (Q4652003):
Displaying 50 items.
- A golden ratio primal-dual algorithm for structured convex optimization (Q2025858) (← links)
- On the analysis of variance-reduced and randomized projection variants of single projection schemes for monotone stochastic variational inequality problems (Q2045192) (← links)
- Infinite-dimensional gradient-based descent for alpha-divergence minimisation (Q2054493) (← links)
- Iteration complexity of generalized complementarity problems (Q2067800) (← links)
- Weak and strong convergence Bregman extragradient schemes for solving pseudo-monotone and non-Lipschitz variational inequalities (Q2069529) (← links)
- Bregman subgradient extragradient method with monotone self-adjustment stepsize for solving pseudo-monotone variational inequalities and fixed point problems (Q2076350) (← links)
- Convergence of the method of extrapolation from the past for variational inequalities in uniformly convex Banach spaces (Q2103799) (← links)
- Convergence of the operator extrapolation method for variational inequalities in Banach spaces (Q2103828) (← links)
- Learning in nonatomic games. I: Finite action spaces and population games (Q2106066) (← links)
- Local saddle points for unconstrained polynomial optimization (Q2125068) (← links)
- On iteration complexity of a first-order primal-dual method for nonlinear convex cone programming (Q2136507) (← links)
- Accelerated gradient sliding for structured convex optimization (Q2141354) (← links)
- Cubic regularized Newton method for the saddle point models: a global and local convergence analysis (Q2148117) (← links)
- On lower iteration complexity bounds for the convex concave saddle point problems (Q2149573) (← links)
- An \(O(s^r)\)-resolution ODE framework for understanding discrete-time algorithms and applications to the linear convergence of minimax problems (Q2149577) (← links)
- Proportional-integral projected gradient method for conic optimization (Q2151872) (← links)
- Extragradient and extrapolation methods with generalized Bregman distances for saddle point problems (Q2157903) (← links)
- Generalized mirror prox algorithm for monotone variational inequalities: Universality and inexact oracle (Q2159456) (← links)
- The saddle point problem of polynomials (Q2162120) (← links)
- A stochastic primal-dual method for a class of nonconvex constrained optimization (Q2162528) (← links)
- On the linear convergence of the general first order primal-dual algorithm (Q2165808) (← links)
- Inertial self-adaptive Bregman projection method for finite family of variational inequality problems in reflexive Banach spaces (Q2167422) (← links)
- Inexact first-order primal-dual algorithms (Q2181598) (← links)
- Image restoration based on the minimized surface regularization (Q2202971) (← links)
- Efficient first-order methods for convex minimization: a constructive approach (Q2205976) (← links)
- Golden ratio algorithms for variational inequalities (Q2205983) (← links)
- A double extrapolation primal-dual algorithm for saddle point problems (Q2211739) (← links)
- Accelerated methods for saddle-point problem (Q2214606) (← links)
- An adaptive two-stage proximal algorithm for equilibrium problems in Hadamard spaces (Q2215880) (← links)
- Lower complexity bounds of first-order methods for convex-concave bilinear saddle-point problems (Q2220653) (← links)
- Forward-reflected-backward method with variance reduction (Q2231039) (← links)
- Primal-dual proximal splitting and generalized conjugation in non-smooth non-convex optimization (Q2232754) (← links)
- Regret bounded by gradual variation for online convex optimization (Q2251474) (← links)
- Optimal stochastic extragradient schemes for pseudomonotone stochastic variational inequality problems and their variants (Q2282819) (← links)
- Faster algorithms for extensive-form game solving via improved smoothing functions (Q2288198) (← links)
- Distributionally robust optimization with correlated data from vector autoregressive processes (Q2294321) (← links)
- Communication-efficient algorithms for decentralized and stochastic optimization (Q2297648) (← links)
- Saddle points of rational functions (Q2307710) (← links)
- Exploiting problem structure in optimization under uncertainty via online convex optimization (Q2316616) (← links)
- Self-concordant inclusions: a unified framework for path-following generalized Newton-type algorithms (Q2316618) (← links)
- Convergence of two-stage method with Bregman divergence for solving variational inequalities (Q2320219) (← links)
- Bregman extragradient method with monotone rule of step adjustment (Q2320221) (← links)
- A telescopic Bregmanian proximal gradient method without the global Lipschitz continuity assumption (Q2322358) (← links)
- An adaptive proximal method for variational inequalities (Q2332639) (← links)
- An efficient primal dual prox method for non-smooth optimization (Q2339936) (← links)
- On the convergence properties of non-Euclidean extragradient methods for variational inequalities with generalized monotone operators (Q2340520) (← links)
- Mirror Prox algorithm for multi-term composite minimization and semi-separable problems (Q2350862) (← links)
- On the efficiency of a randomized mirror descent algorithm in online optimization problems (Q2354481) (← links)
- Decomposition techniques for bilinear saddle point problems and variational inequalities with affine monotone operators (Q2359772) (← links)
- On non-ergodic convergence rate of the operator splitting method for a class of variational inequalities (Q2361129) (← links)
