:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Chakraborty, Abhishek, Nedić, Angelia
Format:	Preprint
Published:	2024
Subjects:	Optimization and Control
Online Access:	https://arxiv.org/abs/2404.00635
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Popov Mirror-Prox Method for Variational Inequalities
by: Chakraborty, Abhishek, et al.
Published: (2025)

Randomized Feasibility-Update Algorithms for Variational Inequality Problems
by: Chakraborty, Abhishek, et al.
Published: (2024)

Randomized Feasibility-Update Algorithms for Stochastic Variational Inequality Problems
by: Chakraborty, Abhishek, et al.
Published: (2025)

On Non-Monotone Variational Inequalities
by: Arefizadeh, Sina, et al.
Published: (2025)

Randomized Feasibility Methods for Constrained Optimization with Adaptive Step Sizes
by: Chakraborty, Abhishek, et al.
Published: (2026)

Robust Constrained Consensus and Inequality-constrained Distributed Optimization with Guaranteed Differential Privacy and Accurate Convergence
by: Wang, Yongqiang, et al.
Published: (2024)

Last Iterate Convergence of Popov Method for Non-monotone Stochastic Variational Inequalities
by: Vankov, Daniil, et al.
Published: (2023)

Existence of Solutions for Non-monotone VIs and Implications for Games
by: Arefizadeh, Sina, et al.
Published: (2025)

Non-Monotone Variational Inequalities
by: Arefizadeh, Sina, et al.
Published: (2024)

Tailoring Gradient Methods for Differentially-Private Distributed Optimization
by: Wang, Yongqiang, et al.
Published: (2022)

Distributed Normal Map-based Stochastic Proximal Gradient Methods over Networks
by: Huang, Kun, et al.
Published: (2024)

Adaptive Methods for Variational Inequalities under Relaxed Smoothness Assumption
by: Vankov, Daniil, et al.
Published: (2024)

The Popov's Algorithm with Optimal Bounded Stepsize for Generalized Monotone Variational Inequalities
by: Nguyen, Nhung Hong, et al.
Published: (2026)

Generalized Smooth Stochastic Variational Inequalities: Almost Sure Convergence and Convergence Rates
by: Vankov, Daniil, et al.
Published: (2024)

Characterizing Trust and Resilience in Distributed Consensus for Cyberphysical Systems
by: Yemini, Michal, et al.
Published: (2021)

An Accelerated Distributed Stochastic Gradient Method with Momentum
by: Huang, Kun, et al.
Published: (2024)

The Mirror-Prox Sliding Method for Non-smooth decentralized saddle-point problems
by: Kuruzov, Ilya, et al.
Published: (2022)

Constrained multi-cluster game: Distributed Nash equilibrium seeking over directed graphs
by: Nguyen, Duong Thuy Anh, et al.
Published: (2024)

Fast Distributed Optimization over Directed Graphs under Malicious Attacks using Trust
by: Dayı, Arif Kerem, et al.
Published: (2024)

Convergence Rate Bounds for the Mirror Descent Method: IQCs, Popov Criterion and Bregman Divergence
by: Li, Mengmou, et al.
Published: (2023)

Low-Rank Mirror-Prox for Nonsmooth and Low-Rank Matrix Optimization Problems
by: Garber, Dan, et al.
Published: (2022)

Mirror Descent Methods with Weighting Scheme for Outputs for Constrained Variational Inequality Problems
by: Alkousa, Mohammad S., et al.
Published: (2025)

Prox-PINNs: A Deep Learning Algorithmic Framework for Elliptic Variational Inequalities
by: Gao, Yu, et al.
Published: (2025)

Mirror Descent-Type Algorithms for the Variational Inequality Problem with Functional Constraints
by: Alkousa, Mohammad S., et al.
Published: (2026)

Analysis of Kernel Mirror Prox for Measure Optimization
by: Dvurechensky, Pavel, et al.
Published: (2024)

On the Convergence of FedProx with Extrapolation and Inexact Prox
by: Li, Hanmin, et al.
Published: (2024)

Random minibatch subgradient algorithms for convex problems with functional constraints
by: Nedich, Angelia, et al.
Published: (2019)

A Certificate of Unboundedness for Polynomial Optimization Problems
by: Rele, Rohan, et al.
Published: (2026)

Fast Distributed Nash Equilibrium Seeking in Monotone Games
by: Tatarenko, Tatiana, et al.
Published: (2025)

Target Mirror Descent: A Unifying Framework for Solving Monotone Variational Inequalities
by: Chen, Yu-Wen, et al.
Published: (2026)

Some Unified Theory for Variance Reduced Prox-Linear Methods
by: Wu, Yue, et al.
Published: (2024)

Tighter Performance Theory of FedExProx
by: Anyszka, Wojciech, et al.
Published: (2024)

A Globalized Semismooth Newton Method for Prox-regular Optimization Problems
by: Wu, Yuqia, et al.
Published: (2025)

Dual Averaging With Non-Strongly-Convex Prox-Functions: New Analysis and Algorithm
by: Zhao, Renbo
Published: (2025)

Prox-NAG-GS: A Semi-Implicit Proximal Method for Composite Optimization
by: Wiykiynyuy, Sikeh Gisele, et al.
Published: (2026)

Decentralized Stochastic Constrained Optimization via Prox-Linearization
by: Sharma, Shivangi Dubey, et al.
Published: (2026)

Split, Skip and Play: Variance-Reduced ProxSkip for Tomography Reconstruction is Extremely Fast
by: Papoutsellis, Evangelos, et al.
Published: (2026)

Solving Monotone Variational Inequalities with Best Response Dynamics
by: Chen, Yu-Wen, et al.
Published: (2024)

Methods for Solving Variational Inequalities with Markovian Stochasticity
by: Solodkin, Vladimir, et al.
Published: (2024)

Achieving Linear Speedup with ProxSkip in Distributed Stochastic Optimization
by: Guo, Luyao, et al.
Published: (2023)