Some accelerated alternating proximal gradient algorithms for a class of nonconvex nonsmooth problems

DOI10.1007/s10898-022-01214-3zbMath1528.90201OpenAlexW4291002353MaRDI QIDQ6064055

Xin Yang, Lingling Xu

Publication date: 8 November 2023

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-022-01214-3

zbMATH Keywords

convergence analysisalternating minimizationaccelerated methodnonconvex-nonsmooth optimizationKurdyka-Łojasiewicz (KŁ) property

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Derivative-free methods and methods using generalized derivatives (90C56) Numerical optimization and variational techniques (65K10) Nonsmooth analysis (49J52)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• Sparse solutions to random standard quadratic optimization problems
• Proximal alternating linearized minimization for nonconvex and nonsmooth problems
• Lectures on convex optimization
• On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
• Asymptotic properties of the Fenchel dual functional and applications to decomposition problems
• Additive logistic regression: a statistical view of boosting. (With discussion and a rejoinder by the authors)
• Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
• Inertial alternating generalized forward-backward splitting for image colorization
• 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
• 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
• A New Class of Alternating Proximal Minimization Algorithms with Costs-to-Move
• Two-Point Step Size Gradient Methods
• Variational Analysis
• Variational Exemplar-Based Image Colorization
• Alternating Structure-Adapted Proximal Gradient Descent for Nonconvex Nonsmooth Block-Regularized Problems
• Luminance-Chrominance Model for Image Colorization
• Learning the parts of objects by non-negative matrix factorization
• The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems

This page was built for publication: Some accelerated alternating proximal gradient algorithms for a class of nonconvex nonsmooth problems