Pages that link to "Item:Q868471"

The following pages link to Dual extrapolation and its applications to solving variational inequalities and related problems (Q868471):

Displaying 50 items.

• A semi-definite programming approach for robust tracking (Q263222) (← links)
• An adaptive accelerated first-order method for convex optimization (Q276852) (← links)
• Sparse non Gaussian component analysis by semidefinite programming (Q374189) (← links)
• Iterative methods for solving monotone equilibrium problems via dual gap functions (Q429462) (← links)
• Dual subgradient algorithms for large-scale nonsmooth learning problems (Q484132) (← links)
• Primal-dual methods for solving infinite-dimensional games (Q493268) (← links)
• A new method for solving monotone generalized variational inequalities (Q607989) (← links)
• Barrier subgradient method (Q633113) (← links)
• Dual extragradient algorithms extended to equilibrium problems (Q656844) (← links)
• A version of the mirror descent method to solve variational inequalities (Q681901) (← links)
• Self-concordant barriers for convex approximations of structured convex sets (Q707744) (← links)
• Convergence of the modified extragradient method for variational inequalities with non-Lipschitz operators (Q904429) (← links)
• Accelerated schemes for a class of variational inequalities (Q1680963) (← links)
• Learning in games with continuous action sets and unknown payoff functions (Q1717237) (← links)
• A proximal difference-of-convex algorithm with extrapolation (Q1744881) (← links)
• Iteration-complexity of first-order penalty methods for convex programming (Q1949272) (← links)
• On the convergence of the iterates of proximal gradient algorithm with extrapolation for convex nonsmooth minimization problems (Q2010091) (← links)
• Metastability of the proximal point algorithm with multi-parameters (Q2043306) (← links)
• Variance-based single-call proximal extragradient algorithms for stochastic mixed variational inequalities (Q2046688) (← links)
• Stochastic relaxed inertial forward-backward-forward splitting for monotone inclusions in Hilbert spaces (Q2082546) (← links)
• Convergence of the method of extrapolation from the past for variational inequalities in uniformly convex Banach spaces (Q2103799) (← links)
• Learning in nonatomic games. I: Finite action spaces and population games (Q2106066) (← 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)
• Proportional-integral projected gradient method for conic optimization (Q2151872) (← links)
• Generalized mirror prox algorithm for monotone variational inequalities: Universality and inexact oracle (Q2159456) (← links)
• Physics-informed distribution transformers via molecular dynamics and deep neural networks (Q2168329) (← links)
• Golden ratio algorithms for variational inequalities (Q2205983) (← links)
• Forward-reflected-backward method with variance reduction (Q2231039) (← 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)
• An adaptive proximal method for variational inequalities (Q2332639) (← links)
• On the convergence properties of non-Euclidean extragradient methods for variational inequalities with generalized monotone operators (Q2340520) (← links)
• On the iteration complexity of some projection methods for monotone linear variational inequalities (Q2397469) (← links)
• Two fast variance-reduced proximal gradient algorithms for SMVIPs -- stochastic mixed variational inequality problems with suitable applications to stochastic network games and traffic assignment problems (Q2668043) (← links)
• Adaptive two-stage Bregman method for variational inequalities (Q2668528) (← links)
• A Subgradient Method for Free Material Design (Q2832891) (← links)
• Linear Convergence of Proximal Gradient Algorithm with Extrapolation for a Class of Nonconvex Nonsmooth Minimization Problems (Q2957980) (← links)
• A Hybrid Proximal Extragradient Self-Concordant Primal Barrier Method for Monotone Variational Inequalities (Q3449570) (← links)
• Accelerating Block-Decomposition First-Order Methods for Solving Composite Saddle-Point and Two-Player Nash Equilibrium Problems (Q3451761) (← links)
• A Smooth Primal-Dual Optimization Framework for Nonsmooth Composite Convex Minimization (Q4600841) (← links)
• Complexity of first-order inexact Lagrangian and penalty methods for conic convex programming (Q4622887) (← links)
• The Approximate Duality Gap Technique: A Unified Theory of First-Order Methods (Q4629338) (← links)
• (Q4999039) (← links)
• An adaptive analog of Nesterov's method for variational inequalities with a strongly monotone operator (Q5043019) (← links)
• New Primal-Dual Algorithms for a Class of Nonsmooth and Nonlinear Convex-Concave Minimax Problems (Q5043287) (← links)
• New First-Order Algorithms for Stochastic Variational Inequalities (Q5051379) (← links)
• A Novel Algorithm with Self-adaptive Technique for Solving Variational Inequalities in Banach Spaces (Q5054158) (← links)
• Two Steps at a Time---Taking GAN Training in Stride with Tseng's Method (Q5089720) (← links)