Imagen de Portada

Revisiting Extragradient-Type Methods -- Part 1: Generalizations and Sublinear Convergence Rates

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Tran-Dinh, Quoc, Nguyen-Trung, Nghia
Formato:	Preprint
Publicado:	2024
Materias:	Optimization and Control Machine Learning 90C25, 90C06, 90-08
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

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

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

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

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

Stochastic Variance-Reduced Forward-Reflected-Backward Splitting Methods for Nonmonotone Generalized Equations
por: Tran-Dinh, Quoc
Publicado: (2024)

Fast Computation of Superquantile-Constrained Optimization Through Implicit Scenario Reduction
por: Roth, Jake, et al.
Publicado: (2024)

A Projection-Free Method for Solving Convex Bilevel Optimization Problems
por: Giang-Tran, Khanh-Hung, et al.
Publicado: (2023)

Faster Accelerated First-order Methods for Convex Optimization with Strongly Convex Function Constraints
por: Lin, Zhenwei, et al.
Publicado: (2022)

NewVEM: A Newton Vertex Exchange Method for a Class of Constrained Self-Concordant Minimization Problems
por: Liang, Ling, et al.
Publicado: (2024)

Peaceman-Rachford Splitting Method Converges Ergodically for Solving Convex Optimization Problems
por: Chen, Kaihuang, et al.
Publicado: (2025)

Fast projection onto the top-k-sum constraint
por: Pan, Jianting, et al.
Publicado: (2025)

On $O(n)$ Algorithms for Projection onto the Top-$k$-sum Sublevel Set
por: Roth, Jake, et al.
Publicado: (2023)

A Benson-Type Algorithm for Bounded Convex Vector Optimization Problems with Vertex Selection
por: Dörfler, Daniel, et al.
Publicado: (2020)

Bilevel Learning via Inexact Stochastic Gradient Descent
por: Salehi, Mohammad Sadegh, et al.
Publicado: (2025)

Alternating minimization for square root principal component pursuit
por: Deng, Shengxiang, et al.
Publicado: (2024)

A Sparse Smoothing Newton Method for Solving Discrete Optimal Transport Problems
por: Hou, Di, et al.
Publicado: (2023)

A Corrected Inexact Proximal Augmented Lagrangian Method with a Relative Error Criterion for a Class of Group-quadratic Regularized Optimal Transport Problems
por: Yang, Lei, et al.
Publicado: (2023)

Tractable downfall of basis pursuit in structured sparse optimization
por: Marmary, Maya V., et al.
Publicado: (2025)

Nesterov's Accelerated Jacobi-Type Methods for Large-scale Symmetric Positive Semidefinite Linear Systems
por: Liang, Ling, et al.
Publicado: (2024)

Greedy Learning to Optimize with Convergence Guarantees
por: Fahy, Patrick, et al.
Publicado: (2024)

A squared smoothing Newton method for semidefinite programming
por: Liang, Ling, et al.
Publicado: (2023)

Efficient Data-Driven Leverage Score Sampling Algorithm for the Minimum Volume Covering Ellipsoid Problem in Big Data
por: Harris, Elizabeth, et al.
Publicado: (2024)

Randomized Nyström Preconditioned Interior Point-Proximal Method of Multipliers
por: Chu, Ya-Chi, et al.
Publicado: (2024)

Fix-and-Propagate Heuristics Using Low-Precision First-Order LP Solutions for Large-Scale Mixed-Integer Linear Optimization
por: Kempke, Nils-Christian, et al.
Publicado: (2025)

Semi-Monotone Goldstein Line Search Strategy with Application in Sparse Recovery
por: Shabani, Shima, et al.
Publicado: (2025)

Convergence, Duality and Well-Posedness in Convex Bilevel Optimization
por: Giang-Tran, Khanh-Hung, et al.
Publicado: (2025)

Convergence Rate of Projected Subgradient Method with Time-varying Step-sizes
por: Zhu, Zhihan, et al.
Publicado: (2024)

Generalized Optimistic Methods for Convex-Concave Saddle Point Problems
por: Jiang, Ruichen, et al.
Publicado: (2022)

On the convergence of adaptive first order methods: proximal gradient and alternating minimization algorithms
por: Latafat, Puya, et al.
Publicado: (2023)

Adaptive proximal gradient methods are universal without approximation
por: Oikonomidis, Konstantinos A., et al.
Publicado: (2024)

Adaptive proximal algorithms for convex optimization under local Lipschitz continuity of the gradient
por: Latafat, Puya, et al.
Publicado: (2023)

Safeguarding adaptive methods: global convergence of Barzilai-Borwein and other stepsize choices
por: Ou, Hongjia, et al.
Publicado: (2024)

Fully First-Order Methods for Decentralized Bilevel Optimization
por: Wang, Xiaoyu, et al.
Publicado: (2024)

Long-Step Path-Following Algorithm for Quantum Information Theory: Some Numerical Aspects and Applications
por: Faybusovich, Leonid, et al.
Publicado: (2019)

Boscia.jl: A review and tutorial
por: Xiao, Wenjie, et al.
Publicado: (2025)

A KL-based Analysis Framework with Applications to Non-Descent Optimization Methods
por: Qiu, Junwen, et al.
Publicado: (2024)

Accelerating preconditioned ADMM via degenerate proximal point mappings
por: Sun, Defeng, et al.
Publicado: (2024)

On Convergence of Regularized Barzilai-Borwein Method
por: Xu, Xin
Publicado: (2025)

Stochastic First-Order Methods with Non-smooth and Non-Euclidean Proximal Terms for Nonconvex High-Dimensional Stochastic Optimization
por: Xie, Yue, et al.
Publicado: (2024)