Two-step inertial Bregman alternating minimization algorithm for nonconvex and nonsmooth problems
type: Item
instance of: scholarly article
title: Two-step inertial Bregman alternating minimization algorithm for nonconvex and nonsmooth problems
author: Jing Zhao
author: Qiao-Li Dong
author: Michael Th. Rassias
author: Fenghui Wang
published in: Journal of Global Optimization
publication date: 2022-10-24T00:00:00Z
Mathematics Subject Classification ID: 47J06
Mathematics Subject Classification ID: 49J52
Mathematics Subject Classification ID: 65K10
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 7606099
zbMATH Keywords: nonconvex optimization
zbMATH Keywords: inertial algorithm
zbMATH Keywords: Bregman distance
zbMATH Keywords: Kurdyka-Łojasiewicz inequality
zbMATH Keywords: alternating minimization
describes a project that uses: iPiano
MaRDI profile type: Publication
full work available at URL: s10898-022-01176-6
OpenAlex ID: W4281387205
cites work: Functional Operators (AM-22), Volume 2
cites work: Signal Recovery by Proximal Forward-Backward Splitting
cites work: Compressed sensing
cites work: Q3484315
cites work: Outlier-Robust PCA: The High-Dimensional Case
cites work: Global Convergence of Splitting Methods for Nonconvex Composite Optimization
cites work: Convergence Analysis of Alternating Direction Method of Multipliers for a Family of Nonconvex Problems
cites work: Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems
cites work: Acceleration and Global Convergence of a First-Order Primal-Dual Method for Nonconvex Problems
cites work: A Symmetric Alternating Direction Method of Multipliers for Separable Nonconvex Minimization Problems
cites work: A proximal difference-of-convex algorithm with extrapolation
cites work: A new globally convergent algorithm for non-Lipschitz \(\ell_{p}-\ell_q\) minimization
cites work: Convergence analysis of the generalized splitting methods for a class of nonconvex optimization problems
cites work: Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
cites work: Proximal alternating linearized minimization for nonconvex and nonsmooth problems
cites work: Some methods of speeding up the convergence of iteration methods
cites work: iPiano: inertial proximal algorithm for nonconvex optimization
cites work: An inertial Tseng's type proximal algorithm for nonsmooth and nonconvex optimization problems
cites work: Inertial proximal alternating minimization for nonconvex and nonsmooth problems
cites work: Inertial Proximal Alternating Linearized Minimization (iPALM) for Nonconvex and Nonsmooth Problems
cites work: A Gauss-Seidel type inertial proximal alternating linearized minimization for a class of nonconvex optimization problems
cites work: The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
cites work: Variational Analysis
cites work: Q5643297
cites work: On gradients of functions definable in o-minimal structures
cites work: A block coordinate descent method for regularized multiconvex optimization with applications to nonnegative tensor factorization and completion
cites work: A Non-Euclidean Gradient Descent Framework for Non-Convex Matrix Factorization
cites work: Interior Gradient and Proximal Methods for Convex and Conic Optimization
cites work: Projected subgradient methods with non-Euclidean distances for non-differentiable convex minimization and variational inequalities
cites work: Regularizing with Bregman--Moreau Envelopes
cites work: First Order Methods Beyond Convexity and Lipschitz Gradient Continuity with Applications to Quadratic Inverse Problems
cites work: On linear convergence of non-Euclidean gradient methods without strong convexity and Lipschitz gradient continuity
cites work: Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
cites work: New Bregman projection methods for solving pseudo-monotone variational inequality problem
cites work: Modified extragradient method with Bregman distance for variational inequalities
DOI: 10.1007/S10898-022-01176-6
Recommended article: An inertial alternating minimization with Bregman distance for a class of nonconvex and nonsmooth problems
Recommended article: An inertial Bregman generalized alternating direction method of multipliers for nonconvex optimization
Recommended article: An alternating structure-adapted Bregman proximal gradient descent algorithm for constrained nonconvex nonsmooth optimization problems and its inertial variant
Recommended article: Inertial proximal alternating minimization for nonconvex and nonsmooth problems
Recommended article: An inertial alternating direction method of multipliers for solving a two-block separable convex minimization problem
Recommended article: Inertial proximal gradient methods with Bregman regularization for a class of nonconvex optimization problems
Recommended article: Inertial alternating direction method of multipliers for non-convex non-smooth optimization
Recommended article: Alternated and multi-step inertial approximation methods for solving convex bilevel optimization problems
Recommended article: An inertial forward-backward algorithm for the minimization of the sum of two nonconvex functions
Recommended article: A generalized inertial proximal alternating linearized minimization method for nonconvex nonsmooth problems
description: scientific article; zbMATH DE number 7606099