A stochastic two-step inertial Bregman proximal alternating linearized minimization algorithm for nonconvex and nonsmooth problems
From MaRDI portal
Publication:6590593
DOI10.1007/s11075-023-01693-9MaRDI QIDQ6590593
Jing Zhao, Qiao-Li Dong, Chenzheng Guo
Publication date: 21 August 2024
Published in: Numerical Algorithms (Search for Journal in Brave)
Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Numerical optimization and variational techniques (65K10) Nonsmooth analysis (49J52) Nonlinear ill-posed problems (47J06) Numerical analysis (65-XX)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Minimizing finite sums with the stochastic average gradient
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- A block inertial Bregman proximal algorithm for nonsmooth nonconvex problems with application to symmetric nonnegative matrix tri-factorization
- Two-step inertial Bregman alternating minimization algorithm for nonconvex and nonsmooth problems
- Inertial stochastic PALM and applications in machine learning
- A Gauss-Seidel type inertial proximal alternating linearized minimization for a class of nonconvex optimization problems
- Block Stochastic Gradient Iteration for Convex and Nonconvex Optimization
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- Inertial Proximal Alternating Linearized Minimization (iPALM) for Nonconvex and Nonsmooth Problems
- Large-Scale Machine Learning with Stochastic Gradient Descent
- Characterizations of Łojasiewicz inequalities: Subgradient flows, talweg, convexity
- Variational Analysis
- Convergence of the Peaceman-Rachford Splitting Method for a Class of Nonconvex Programs
- A Stochastic Proximal Alternating Minimization for Nonsmooth and Nonconvex Optimization
- Convex-Concave Backtracking for Inertial Bregman Proximal Gradient Algorithms in Nonconvex Optimization
- Learning the parts of objects by non-negative matrix factorization
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
- Compressed sensing
- A generalized inertial proximal alternating linearized minimization method for nonconvex nonsmooth problems
- An inertial alternating minimization with Bregman distance for a class of nonconvex and nonsmooth problems
This page was built for publication: A stochastic two-step inertial Bregman proximal alternating linearized minimization algorithm for nonconvex and nonsmooth problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6590593)