:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Tran-Dinh, Quoc, Luo, Yang
Format:	Preprint
Published:	2023
Subjects:	Optimization and Control Machine Learning
Online Access:	https://arxiv.org/abs/2301.03113
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

VFOG: Variance-Reduced Fast Optimistic Gradient Methods for a Class of Nonmonotone Generalized Equations
by: Tran-Dinh, Quoc, et al.
Published: (2025)

Variance-Reduced Fast Krasnoselkii-Mann Methods for Finite-Sum Root-Finding Problems
by: Tran-Dinh, Quoc
Published: (2024)

Shuffling Momentum Gradient Algorithm for Convex Optimization
by: Tran, Trang H., et al.
Published: (2024)

From Halpern's Fixed-Point Iterations to Nesterov's Accelerated Interpretations for Root-Finding Problems
by: Tran-Dinh, Quoc
Published: (2022)

Shuffling Gradient-Based Methods for Nonconvex-Concave Minimax Optimization
by: Tran-Dinh, Quoc, et al.
Published: (2024)

Omega: Optimistic EMA Gradients
by: Ramirez, Juan, et al.
Published: (2023)

Variance-Reduced Fast Operator Splitting Methods for Generalized Equations
by: Tran-Dinh, Quoc
Published: (2025)

The Limit Points of (Optimistic) Gradient Descent in Min-Max Optimization
by: Daskalakis, Constantinos, et al.
Published: (2018)

An Optimistic Algorithm for Online Convex Optimization with Adversarial Constraints
by: Lekeufack, Jordan, et al.
Published: (2024)

A Class of Accelerated Fixed-Point-Based Methods with Delayed Inexact Oracles and Its Applications
by: Nguyen-Trung, Nghia, et al.
Published: (2025)

Unbiased and Biased Variance-Reduced Forward-Reflected-Backward Splitting Methods for Stochastic Composite Inclusions
by: Tran-Dinh, Quoc, et al.
Published: (2026)

Differentially Private Random Block Coordinate Descent
by: Maranjyan, Artavazd, et al.
Published: (2024)

On Stability in Optimistic Bilevel Optimization
by: Royset, Johannes O.
Published: (2024)

A Single-Loop Smoothed Gradient Descent-Ascent Algorithm for Nonconvex-Concave Min-Max Problems
by: Zhang, Jiawei, et al.
Published: (2020)

Faster Gradient-Free Algorithms for Nonsmooth Nonconvex Stochastic Optimization
by: Chen, Lesi, et al.
Published: (2023)

Optimistic Online LQR via Intrinsic Rewards
by: Bartos, Marcell, et al.
Published: (2026)

Tail Distribution of Regret in Optimistic Reinforcement Learning
by: Khodadadian, Sajad, et al.
Published: (2025)

Stochastic Approximation with Block Coordinate Optimal Stepsizes
by: Jiang, Tao, et al.
Published: (2025)

Accelerated Extragradient-Type Methods -- Part 2: Generalization and Sublinear Convergence Rates under Co-Hypomonotonicity
by: Tran-Dinh, Quoc, et al.
Published: (2025)

Revisiting Extragradient-Type Methods -- Part 1: Generalizations and Sublinear Convergence Rates
by: Tran-Dinh, Quoc, et al.
Published: (2024)

Optimistic Online-to-Batch Conversions for Accelerated Convergence and Universality
by: Yan, Yu-Hu, et al.
Published: (2025)

Optimistic Online Non-stochastic Control via FTRL
by: Mhaisen, Naram, et al.
Published: (2024)

Layer-wise Quantization for Quantized Optimistic Dual Averaging
by: Nguyen, Anh Duc, et al.
Published: (2025)

Stability of Primal-Dual Gradient Flow Dynamics for Multi-Block Convex Optimization Problems
by: Ozaslan, Ibrahim K., et al.
Published: (2024)

Optimistic Safety for Online Convex Optimization with Unknown Linear Constraints
by: Hutchinson, Spencer, et al.
Published: (2024)

Adaptive and Optimal Second-order Optimistic Methods for Minimax Optimization
by: Jiang, Ruichen, et al.
Published: (2024)

Worth Their Weight: Randomized and Regularized Block Kaczmarz Algorithms without Preprocessing
by: Goldshlager, Gil, et al.
Published: (2025)

Dynamic Proximal Gradient Algorithms for Schatten-$p$ Quasi-Norm Regularized Problems
by: Shen, Weiping, et al.
Published: (2026)

Dual Optimistic Ascent (PI Control) is the Augmented Lagrangian Method in Disguise
by: Ramirez, Juan, et al.
Published: (2025)

On the Gradient Domination of the LQG Problem
by: Fallah, Kasra, et al.
Published: (2025)

A Stochastic-Gradient-based Interior-Point Algorithm for Solving Smooth Bound-Constrained Optimization Problems
by: Curtis, Frank E., et al.
Published: (2023)

Block Decomposable Methods for Large-Scale Optimization Problems
by: Maia, Leandro Farias
Published: (2026)

Optimal Guarantees for Algorithmic Reproducibility and Gradient Complexity in Convex Optimization
by: Zhang, Liang, et al.
Published: (2023)

Zeroth-Order primal-dual Alternating Projection Gradient Algorithms for Nonconvex Minimax Problems with Coupled linear Constraints
by: Zhang, Huiling, et al.
Published: (2024)

Nesterov Finds GRAAL: Optimal and Adaptive Gradient Method for Convex Optimization
by: Borodich, Ekaterina, et al.
Published: (2025)

Random Coordinate Descent on the Wasserstein Space of Probability Measures
by: Xu, Yewei, et al.
Published: (2026)

Asynchronous Decentralized SGD under Non-Convexity: A Block-Coordinate Descent Framework
by: Zhou, Yijie, et al.
Published: (2025)

Extragradient Method for $(L_0, L_1)$-Lipschitz Root-finding Problems
by: Choudhury, Sayantan, et al.
Published: (2025)

Can We Remove the Square-Root in Adaptive Gradient Methods? A Second-Order Perspective
by: Lin, Wu, et al.
Published: (2024)

Gradient Descent with Polyak's Momentum Finds Flatter Minima via Large Catapults
by: Phunyaphibarn, Prin, et al.
Published: (2023)