A generalized inertial proximal alternating linearized minimization method for nonconvex nonsmooth problems

DOI10.1016/j.apnum.2023.03.014zbMath1527.90181OpenAlexW4362636876MaRDI QIDQ6106955

Unnamed Author, Deren Han

Publication date: 3 July 2023

Published in: Applied Numerical Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apnum.2023.03.014

zbMATH Keywords

alternating minimizationKurdyka-Łojasiewicz propertyproximal gradientinertialnonconvex and nonsmooth minimization

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Numerical optimization and variational techniques (65K10)

Cites Work

• Unnamed Item
• Sparse Principal Component Analysis via Variable Projection
• Projection algorithms for nonconvex minimization with application to sparse principal component analysis
• Proximal alternating linearized minimization for nonconvex and nonsmooth problems
• Lectures on convex optimization
• A block coordinate variable metric forward-backward algorithm
• DC-NMF: nonnegative matrix factorization based on divide-and-conquer for fast clustering and topic modeling
• Convergence of ADMM for multi-block nonconvex separable optimization models
• Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
• Inertial proximal gradient methods with Bregman regularization for a class of nonconvex optimization problems
• Local linear convergence of the alternating direction method of multipliers for nonconvex separable optimization problems
• An inertial Bregman generalized alternating direction method of multipliers for nonconvex optimization
• Certifiably optimal sparse principal component analysis
• A Gauss-Seidel type inertial proximal alternating linearized minimization for a class of nonconvex optimization problems
• General inertial proximal gradient method for a class of nonconvex nonsmooth optimization problems
• Exact matrix completion via convex optimization
• A Block Coordinate Descent Method for Regularized Multiconvex Optimization with Applications to Nonnegative Tensor Factorization and Completion
• 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
• Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
• Variational Analysis
• A Symmetric Alternating Direction Method of Multipliers for Separable Nonconvex Minimization Problems
• Trainlets: Dictionary Learning in High Dimensions
• Orthogonal Nonnegative Matrix Factorization by Sparsity and Nuclear Norm Optimization
• Convergence of alternating direction method for minimizing sum of two nonconvex functions with linear constraints
• Convergence of the Peaceman-Rachford Splitting Method for a Class of Nonconvex Programs
• Finite Convergence of Proximal-Gradient Inertial Algorithms Combining Dry Friction with Hessian-Driven Damping
• A Proximal Minimization Algorithm for Structured Nonconvex and Nonsmooth Problems
• Alternating Structure-Adapted Proximal Gradient Descent for Nonconvex Nonsmooth Block-Regularized Problems
• Learning the parts of objects by non-negative matrix factorization
• Universal Regularizers for Robust Sparse Coding and Modeling
• Compressed sensing

This page was built for publication: A generalized inertial proximal alternating linearized minimization method for nonconvex nonsmooth problems