Copertina

On Tackling High-Dimensional Nonconvex Stochastic Optimization via Stochastic First-Order Methods with Non-smooth Proximal Terms and Variance Reduction

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Xie, Yue, Bi, Jiawen, Liu, Hongcheng
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Optimization and Control 90C06, 90C15, 90C26, 90C30
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

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

Improving Convergence Guarantees of Random Subspace Second-order Algorithm for Nonconvex Optimization
di: Higuchi, Rei, et al.
Pubblicazione: (2024)

Level Constrained First Order Methods for Function Constrained Optimization
di: Boob, Digvijay, et al.
Pubblicazione: (2022)

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

A Stochastic Quasi-Newton Method in the Absence of Common Random Numbers
di: Menickelly, Matt, et al.
Pubblicazione: (2023)

Proximal Limited-Memory Quasi-Newton Methods for Nonsmooth Nonconvex Optimization
di: Dahl, Simeon vom, et al.
Pubblicazione: (2026)

On convergence of a $q$-random coordinate constrained algorithm for non-convex problems
di: Ghaffari-Hadigheh, Alireza, et al.
Pubblicazione: (2022)

Lagrangian Reformulation for Nonconvex Optimization: Tailoring Problems to Specialized Solvers
di: Quintero, Rodolfo A., et al.
Pubblicazione: (2024)

Global Solutions to Non-Convex Functional Constrained Problems with Hidden Convexity
di: Fatkhullin, Ilyas, et al.
Pubblicazione: (2025)

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

New vector transport operators extending a Riemannian CG algorithm to generalized Stiefel manifold with low-rank applications
di: Wang, Xuejie, et al.
Pubblicazione: (2023)

Stochastic Optimization under Hidden Convexity
di: Fatkhullin, Ilyas, et al.
Pubblicazione: (2023)

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

Proximal Nonlinear Conjugate Gradient Methods for Composite Optimization
di: Hamana, Shodai, et al.
Pubblicazione: (2026)

Effectively Leveraging Momentum Terms in Stochastic Line Search Frameworks for Fast Optimization of Finite-Sum Problems
di: Lapucci, Matteo, et al.
Pubblicazione: (2024)

High Probability Guarantees for Random Reshuffling
di: Yu, Hengxu, et al.
Pubblicazione: (2023)

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

Star Quasiconvexity: a Unified Approach for Linear Convergence of First-Order Methods Beyond Convexity
di: Khanh, Phan Quoc, et al.
Pubblicazione: (2025)

Asymptotic Convergence and Stability of Adaptive Gradient Methods in Smooth Non-convex Optimization
di: Jin, Ruinan, et al.
Pubblicazione: (2026)

Proximal Gradient Descent Ascent Methods for Nonsmooth Nonconvex-Concave Minimax Problems on Riemannian Manifolds
di: Xie, Xiyuan, et al.
Pubblicazione: (2025)

Heavy-ball Differential Equation Achieves $O(\varepsilon^{-7/4})$ Convergence for Nonconvex Functions
di: Okamura, Kaito, et al.
Pubblicazione: (2024)

Gradient Norm Regularization Second-Order Algorithms for Solving Nonconvex-Strongly Concave Minimax Problems
di: Wang, Jun-Lin, et al.
Pubblicazione: (2024)

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

MoSSP: A Momentum-Based Single-Loop Stochastic Penalty Method for Nonconvex Constrained DC-Regularized Optimization
di: Li, Luxuan, et al.
Pubblicazione: (2026)

Projection-based curve pattern search for black-box optimization over smooth convex sets
di: Jia, Xiaoxi, et al.
Pubblicazione: (2025)

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

PANOC-lite: A simpler and more efficient algorithm for composite minimization
di: Bodard, Alexander, et al.
Pubblicazione: (2026)

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

Convergence Conditions for Stochastic Line Search Based Optimization of Over-parametrized Models
di: Lapucci, Matteo, et al.
Pubblicazione: (2024)

Shuffling the Stochastic Mirror Descent via Dual Lipschitz Continuity and Kernel Conditioning
di: Qiu, Junwen, et al.
Pubblicazione: (2026)

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

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

Riemannian Gradient Method with Momentum
di: Leggio, Filippo, et al.
Pubblicazione: (2026)

Splitting Proximal Point Algorithms for the Sum of Prox-Convex Functions
di: de Brito, Jose, et al.
Pubblicazione: (2026)

Stochastic Algorithms for Large-Scale Composite Optimization: the Case of Single-Shot X-FEL Imaging
di: Luke, D. Russell, et al.
Pubblicazione: (2024)

Extending Linear Convergence of the Proximal Point Algorithm: The Quasar-Convex Case
di: de Brito, José, et al.
Pubblicazione: (2025)

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

A Globally Convergent Gradient Method with Momentum
di: Lapucci, Matteo, et al.
Pubblicazione: (2024)

Bias-Variance Trade-off for Clipped Stochastic First-Order Methods: From Bounded Variance to Infinite Mean
di: He, Chuan
Pubblicazione: (2025)

First- and Second-Order Stochastic Adaptive Regularization with Cubics: High Probability Iteration and Sample Complexity
di: Scheinberg, Katya, et al.
Pubblicazione: (2023)