Cover Image

A Class of Accelerated Fixed-Point-Based Methods with Delayed Inexact Oracles and Its Applications

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Nguyen-Trung, Nghia, Tran-Dinh, Quoc
Format:	Preprint
Published:	2025
Subjects:	Optimization and Control Machine Learning 90C25 and 90-08
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Accelerated Extragradient-Type Methods -- Part 2: Generalization and Sublinear Convergence Rates under Co-Hypomonotonicity
by: Tran-Dinh, Quoc, 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)

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

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

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

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

Halpern Acceleration of the Inexact Proximal Point Method of Rockafellar
by: Zhang, Liwei, et al.
Published: (2025)

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

An Inexact Halpern Iteration with Application to Distributionally Robust Optimization
by: Liang, Ling, et al.
Published: (2024)

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

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

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

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

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

A Two-Phase Adaptive Balanced Penalty Method for Controllable Pareto Front Learning under Split Feasibility Conditions
by: Hoang, Nguyen Viet, et al.
Published: (2026)

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)

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

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

Gauges and Accelerated Optimization over Smooth and/or Strongly Convex Sets
by: Liu, Ning, et al.
Published: (2023)

Metric Entropy-Free Sample Complexity Bounds for Sample Average Approximation in Convex Stochastic Programming
by: Liu, Hongcheng, et al.
Published: (2024)

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)

Balancing Intensity and Focality in Directional DBS Under Uncertainty: A Simulation Study of Electrode Optimization via a Metaheuristic L1L1 Approach
by: Prieto, Fernando Galaz, et al.
Published: (2025)

A Near-Optimal Total Complexity for the Inexact Accelerated Proximal Gradient Method via Quadratic Growth
by: Li, Hongda, et al.
Published: (2026)

A Riemannian Accelerated Proximal Gradient Method
by: Feng, Shuailing, et al.
Published: (2025)

A conditional gradient homotopy method with applications to Semidefinite Programming
by: Dvurechensky, Pavel, et al.
Published: (2022)

Stochastic Approximation with Decision-Dependent Distributions: Asymptotic Normality and Optimality
by: Cutler, Joshua, et al.
Published: (2022)

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

Exact Convex Reformulations of Linear Neural Networks via Completely Positive Lifting
by: Prakhya, Karthik, et al.
Published: (2026)

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

Asymmetric Long-Step Primal-Dual Interior-Point Methods with Dual Centering
by: Nesterov, Yurii
Published: (2025)

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

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

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

Exact Solution to Data-Driven Inverse Optimization of MILPs in Finite Time via Gradient-Based Methods
by: Kitaoka, Akira
Published: (2024)

Tracking the Median of Gradients with a Stochastic Proximal Point Method
by: Schaipp, Fabian, et al.
Published: (2024)

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

A Non-Archimedean Interior Point Method for Solving Lexicographic Multi-Objective Quadratic Programming Problems
by: Fiaschi, Lorenzo, et al.
Published: (2021)

Stabilized Proximal Point Method via Trust Region Control
by: Li, Hanmin, et al.
Published: (2026)

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