Imagen de Portada

Bregman Stochastic Proximal Point Algorithm with Variance Reduction

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Traoré, Cheik, Ochs, Peter
Formato:	Preprint
Publicado:	2025
Materias:	Optimization and Control 90C15, 90C25, 90C06, 65K05
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

Fast Frank--Wolfe Algorithms with Adaptive Bregman Step-Size for Weakly Convex Functions
por: Takahashi, Shota, et al.
Publicado: (2025)

Stochastic Block Bregman Projection with Polyak-like Stepsize for Possibly Inconsistent Convex Feasibility Problems
por: Zhang, Lu, et al.
Publicado: (2026)

A Proximal Stochastic Gradient Method with Adaptive Step Size and Variance Reduction for Convex Composite Optimization
por: Fang, Changjie, et al.
Publicado: (2025)

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

A Semismooth Newton Stochastic Proximal Point Algorithm with Variance Reduction
por: Milzarek, Andre, et al.
Publicado: (2022)

A Regression-Based Prediction-Correction Method for Stochastic Time-Varying Optimization Problems
por: Kamijima, Tomoya, et al.
Publicado: (2025)

Simplex Frank-Wolfe: Linear Convergence and Its Numerical Efficiency for Convex Optimization over Polytopes
por: Wang, Haoning, et al.
Publicado: (2025)

Linesearch-free adaptive Bregman proximal gradient for convex minimization without relative smoothness
por: Ou, Hongjia, et al.
Publicado: (2025)

On the convergence of proximal gradient methods for convex simple bilevel optimization
por: Latafat, Puya, et al.
Publicado: (2023)

Monomial barrier functions for the box-constrained convex optimization problems
por: Fayed, Hatem
Publicado: (2024)

General Optimal Step-size for ADMM-type Algorithms: Domain Parametrization and Optimal Rates
por: Ran, Yifan
Publicado: (2023)

Anderson Accelerated Primal-Dual Hybrid Gradient for solving LP
por: Zhou, Yingxin, et al.
Publicado: (2025)

Boosted Stochastic Frank-Wolfe for Constrained Nonconvex Optimization
por: Nandhan, Navil, et al.
Publicado: (2026)

Strong Convergence of Relaxed Inertial Inexact Progressive Hedging Algorithm for Multi-stage Stochastic Variational Inequality Problems
por: Chen, Jiaxin, et al.
Publicado: (2024)

Splitting Algorithms for Distributionally Robust Optimization
por: Briceño-Arias, Luis, et al.
Publicado: (2024)

On the Convergence and Complexity of Proximal Gradient and Accelerated Proximal Gradient Methods under Adaptive Gradient Estimation
por: Bollapragada, Raghu, et al.
Publicado: (2025)

On Solution Uniqueness and Robust Recovery for Sparse Regularization with a Gauge: from Dual Point of View
por: He, Jiahuan, et al.
Publicado: (2023)

Preconditioned Proximal Gradient Methods with Conjugate Momentum: A Subspace Perspective
por: Chen, Jian, et al.
Publicado: (2026)

Accelerated Gradient Methods with Gradient Restart: Global Linear Convergence
por: Bao, Chenglong, et al.
Publicado: (2024)

The Global R-linear Convergence of Nesterov's Accelerated Gradient Method with Unknown Strongly Convex Parameter
por: Bao, Chenglong, et al.
Publicado: (2023)

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)

Nonsmooth Projection-Free Optimization with Functional Constraints
por: Asgari, Kamiar, et al.
Publicado: (2023)

A MINRES-based Linesearch Algorithm for Nonconvex Optimization with Non-positive Curvature Detection
por: Zeng, Hanfeng, et al.
Publicado: (2026)

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

Active set identification and rapid convergence for degenerate primal-dual problems
por: Díaz, Mateo, et al.
Publicado: (2026)

A non-monotone trust-region method with noisy oracles and additional sampling
por: Krejic, Natasa, et al.
Publicado: (2023)

Retrospective Approximation Sequential Quadratic Programming for Stochastic Optimization with General Deterministic Nonlinear Constraints
por: Berahas, Albert S., et al.
Publicado: (2025)

An efficient second-order cone programming approach for dynamic optimal transport on staggered grid discretization
por: Chen, Liang, et al.
Publicado: (2025)

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)

Stochastic Approach for Price Optimization Problems with Decision-dependent Uncertainty
por: Hikima, Yuya, et al.
Publicado: (2023)

Bregman proximal gradient method for linear optimization under entropic constraints
por: Briceño-Arias, Luis M., et al.
Publicado: (2025)

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

A Sequential Quadratic Programming Method for Optimization with Stochastic Objective Functions, Deterministic Inequality Constraints and Robust Subproblems
por: Qiu, Songqiang, et al.
Publicado: (2023)

A Lasry-Lions envelope approach for mathematical programs with complementarity constraints
por: Wang, Jia, et al.
Publicado: (2025)

Randomized block proximal method with locally Lipschitz continuous gradient
por: Pérez-Aros, Pedro, et al.
Publicado: (2025)

A linesearch-type normal map-based semismooth Newton method for nonsmooth nonconvex composite optimization
por: Zeng, Hanfeng, et al.
Publicado: (2026)