Cover Image

Stochastic Variance-Reduced Forward-Reflected-Backward Splitting Methods for Nonmonotone Generalized Equations

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Tran-Dinh, Quoc
Format:	Preprint
Published:	2024
Subjects:	Optimization and Control 90C25, 90C06, 90-08
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

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

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

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

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

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

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

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

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

Bregman Stochastic Proximal Point Algorithm with Variance Reduction
by: Traoré, Cheik, et al.
Published: (2025)

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

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

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

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

On Tackling High-Dimensional Nonconvex Stochastic Optimization via Stochastic First-Order Methods with Non-smooth Proximal Terms and Variance Reduction
by: Xie, Yue, et al.
Published: (2025)

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

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

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

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

A Single-Loop Stochastic Proximal Quasi-Newton Method for Large-Scale Nonsmooth Convex Optimization
by: Song, Yongcun, et al.
Published: (2024)

Data-Driven Hull-Fouling Cleaning Schedule Optimization to Reduce Carbon Footprint of Vessels
by: Ward, Samuel, et al.
Published: (2026)

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

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

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

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

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

Stochastic block coordinate and function alternation for multi-objective optimization and learning
by: Tran, Trang H., et al.
Published: (2026)

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

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

Parallelizing the Circumcentered-Reflection Method
by: Barros, Pablo, et al.
Published: (2025)

On the Relationships among GPU-Accelerated First-Order Methods for Solving Linear Programming
by: Chen, Kaihuang, et al.
Published: (2025)

A Successive Refinement for Solving Stochastic Programs with Decision-Dependent Random Capacities
by: Medal, Hugh, et al.
Published: (2024)

Solving the Market Split Problem with Lattice Enumeration
by: Wassermann, Alfred
Published: (2025)

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

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

A Highly Efficient Adaptive-Sieving-Based Algorithm for the High-Dimensional Rank Lasso Problem
by: Bai, Xiaoning, et al.
Published: (2022)

A Structured Proximal Stochastic Variance Reduced Zeroth-order Algorithm
by: Rando, Marco, et al.
Published: (2025)

Evacuation Planning on Time-Expanded Networks with Integrated Wildfire Information
by: Borgwardt, Steffen, et al.
Published: (2024)