Image de couverture de livre

Variance-reduced first-order methods for deterministically constrained stochastic nonconvex optimization with strong convergence guarantees

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Lu, Zhaosong, Mei, Sanyou, Xiao, Yifeng
Format:	Preprint
Publié:	2024
Sujets:	Optimization and Control Machine Learning Numerical Analysis 90C15, 90C26, 90C30, 65K05
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

A first-order method for nonconvex-strongly-concave constrained minimax optimization
par: Lu, Zhaosong, et autres
Publié: (2025)

A first-order augmented Lagrangian method for constrained minimax optimization
par: Lu, Zhaosong, et autres
Publié: (2023)

First-order penalty methods for bilevel optimization
par: Lu, Zhaosong, et autres
Publié: (2023)

Solving bilevel optimization via sequential minimax optimization
par: Lu, Zhaosong, et autres
Publié: (2025)

A first-order method for nonconvex-nonconcave minimax problems under a local Kurdyka-Lojasiewicz condition
par: Lu, Zhaosong, et autres
Publié: (2025)

Stochastic momentum ADMM for nonconvex and nonsmooth optimization with application to PnP algorithm
par: Deng, Kangkang, et autres
Publié: (2025)

A globalization of L-BFGS and the Barzilai-Borwein method for nonconvex unconstrained optimization
par: Mannel, Florian
Publié: (2024)

Universal heavy-ball method for nonconvex optimization under Hölder continuous Hessians
par: Marumo, Naoki, et autres
Publié: (2023)

A low-rank augmented Lagrangian method for large-scale semidefinite programming based on a hybrid convex-nonconvex approach
par: Monteiro, Renato D. C., et autres
Publié: (2024)

Solving nonconvex optimization problems via a second order dynamical system with unbounded damping
par: László, Szilárd Csaba
Publié: (2025)

On a globally convergent semismooth* Newton method in nonsmooth nonconvex optimization
par: Gfrerer, H.
Publié: (2024)

Tight Error Bounds for the Sign-Constrained Stiefel Manifold
par: Chen, Xiaojun, et autres
Publié: (2022)

A modified exact penalty approach for general constrained $\ell_0$-sparse optimization problems
par: Kanzow, Christian, et autres
Publié: (2025)

Complexity-optimal and parameter-free first-order methods for finding stationary points of composite optimization problems
par: Kong, Weiwei
Publié: (2022)

Oracle complexities of augmented Lagrangian methods for nonsmooth manifold optimization
par: Deng, Kangkang, et autres
Publié: (2024)

Shadow splitting methods for nonconvex optimisation: epi-approximation, convergence and saddle point avoidance
par: Atenas, Felipe
Publié: (2025)

Proximal methods for structured nonsmooth optimization over Riemannian submanifolds
par: Li, Qia, et autres
Publié: (2024)

A novel numerical method tailored for unconstrained optimization problems
par: Li, Lin, et autres
Publié: (2025)

AS-BOX: Additional Sampling Method for Weighted Sum Problems with Box Constraints
par: Krejić, Nataša, et autres
Publié: (2025)

Binno: A 1st-order method for Bi-level Nonconvex Nonsmooth Optimization for Matrix Factorizations
par: Selicato, Laura, et autres
Publié: (2025)

Extrapolated Plug-and-Play Three-Operator Splitting Methods for Nonconvex Optimization with Applications to Image Restoration
par: Wu, Zhongming, et autres
Publié: (2024)

Steering exact penalty DCA for nonsmooth DC optimization problems with equality and inequality constraints
par: Dolgopolik, M. V.
Publié: (2021)

Randomized block proximal method with locally Lipschitz continuous gradient
par: Pérez-Aros, Pedro, et autres
Publié: (2025)

Parameter-free accelerated gradient descent for nonconvex minimization
par: Marumo, Naoki, et autres
Publié: (2022)

A min-max reformulation and proximal algorithms for a class of structured nonsmooth fractional optimization problems
par: Zhou, Junpeng, et autres
Publié: (2025)

Stability and convergence analysis of AdaGrad for non-convex optimization via novel stopping time-based techniques
par: Jin, Ruinan, et autres
Publié: (2024)

A linesearch-type normal map-based semismooth Newton method for nonsmooth nonconvex composite optimization
par: Zeng, Hanfeng, et autres
Publié: (2026)

A structured L-BFGS method and its application to inverse problems
par: Mannel, Florian, et autres
Publié: (2023)

A structured L-BFGS method with diagonal scaling and its application to image registration
par: Mannel, Florian, et autres
Publié: (2024)

On the convergence of proximal gradient methods for convex simple bilevel optimization
par: Latafat, Puya, et autres
Publié: (2023)

On the convergence of adaptive first order methods: proximal gradient and alternating minimization algorithms
par: Latafat, Puya, et autres
Publié: (2023)

Affordable mixed-integer Lagrangian methods: optimality conditions and convergence analysis
par: De Marchi, Alberto
Publié: (2024)

Accelerated-gradient-based generalized Levenberg--Marquardt method with oracle complexity bound and local quadratic convergence
par: Marumo, Naoki, et autres
Publié: (2022)

Parameter-Free Accelerated Quasi-Newton Method for Nonconvex Optimization
par: Marumo, Naoki
Publié: (2025)

Inexact Riemannian Gradient Descent Method for Nonconvex Optimization
par: Zhou, Juan, et autres
Publié: (2024)

An interior point method for nonlinear constrained derivative-free optimization
par: Brilli, Andrea, et autres
Publié: (2021)

The Augmented Mixing Method: Computing High-Accuracy Primal-Dual Solutions to Large-Scale SDPs via Column Updates
par: Brosch, Daniel, et autres
Publié: (2025)

Efficient parameter-free restarted accelerated gradient methods for convex and strongly convex optimization
par: Sujanani, Arnesh, et autres
Publié: (2024)

Complexity of an inexact stochastic SQP algorithm for equality constrained optimization
par: O'Neill, Michael J., et autres
Publié: (2026)

Proximal Gradient Descent Ascent Methods for Nonsmooth Nonconvex-Concave Minimax Problems on Riemannian Manifolds
par: Xie, Xiyuan, et autres
Publié: (2025)