An inertial alternating minimization with Bregman distance for a class of nonconvex and nonsmooth problems
From MaRDI portal
Publication:6138306
DOI10.1007/s12190-022-01799-8zbMath1518.90073MaRDI QIDQ6138306
Meiyu Zhao, Feifan Nong, Mian-Tao Chao
Publication date: 5 September 2023
Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Decomposition methods (49M27)
Cites Work
- An inertial forward-backward algorithm for the minimization of the sum of two nonconvex functions
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Asymptotic properties of the Fenchel dual functional and applications to decomposition problems
- Introductory lectures on convex optimization. A basic course.
- An algorithm for total variation minimization and applications
- A Gauss-Seidel type inertial proximal alternating linearized minimization for a class of nonconvex optimization problems
- A Block Coordinate Descent Method for Regularized Multiconvex Optimization with Applications to Nonnegative Tensor Factorization and Completion
- iPiano: Inertial Proximal Algorithm for 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
- A New Alternating Minimization Algorithm for Total Variation Image Reconstruction
- A General Inertial Proximal Point Algorithm for Mixed Variational Inequality Problem
- Inertial Proximal ADMM for Linearly Constrained Separable Convex Optimization
- A New Class of Alternating Proximal Minimization Algorithms with Costs-to-Move
- On the Convergence of Block Coordinate Descent Type Methods
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
- Some methods of speeding up the convergence of iteration methods
- Compressed sensing
- An inertial proximal method for maximal monotone operators via discretization of a nonlinear oscillator with damping
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: An inertial alternating minimization with Bregman distance for a class of nonconvex and nonsmooth problems