A block inertial Bregman proximal algorithm for nonsmooth nonconvex problems with application to symmetric nonnegative matrix tri-factorization
From MaRDI portal
Publication:2046565
Abstract: We propose BIBPA, a block inertial Bregman proximal algorithm for minimizing the sum of a block relatively smooth function (that is, relatively smooth concerning each block) and block separable nonsmooth nonconvex functions. We prove that the sequence generated by BIBPA subsequentially converges to critical points of the objective under standard assumptions, and globally converges when the objective function is additionally assumed to satisfy the Kurdyka-{L}ojasiewicz (K{L}) property. We also provide the convergence rate when the objective satisfies the {L}ojasiewicz inequality. We apply BIBPA to the symmetric nonnegative matrix tri-factorization (SymTriNMF) problem, where we propose kernel functions for SymTriNMF and provide closed-form solutions for subproblems of BIBPA.
Recommendations
- Multi-block Bregman proximal alternating linearized minimization and its application to orthogonal nonnegative matrix factorization
- A globally convergent algorithm for nonconvex optimization based on block coordinate update
- A Bregman stochastic method for nonconvex nonsmooth problem beyond global Lipschitz gradient continuity
- Block Bregman majorization minimization with extrapolation
- Inertial proximal alternating linearized minimization (iPALM) for nonconvex and nonsmooth problems
Cites work
- A Bregman forward-backward linesearch algorithm for nonconvex composite optimization: superlinear convergence to nonisolated local minima
- A coordinate gradient descent method for nonsmooth separable minimization
- A descent lemma beyond Lipschitz gradient continuity: first-order methods revisited and applications
- A New Class of Alternating Proximal Minimization Algorithms with Costs-to-Move
- A simplified view of first order methods for optimization
- Accelerated first-order methods for large-scale convex optimization: nearly optimal complexity under strong convexity
- An inertial forward-backward algorithm for the minimization of the sum of two nonconvex functions
- Characterizations of Łojasiewicz inequalities: Subgradient flows, talweg, convexity
- Clarke Subgradients of Stratifiable Functions
- Convergence of a block coordinate descent method for nondifferentiable minimization
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Convex analysis and monotone operator theory in Hilbert spaces
- Efficiency of coordinate descent methods on huge-scale optimization problems
- Fastest rates for stochastic mirror descent methods
- First order methods beyond convexity and Lipschitz gradient continuity with applications to quadratic inverse problems
- First-order methods in optimization
- Forward-backward splitting with Bregman distances
- scientific article; zbMATH DE number 51132 (Why is no real title available?)
- scientific article; zbMATH DE number 3511879 (Why is no real title available?)
- scientific article; zbMATH DE number 1160037 (Why is no real title available?)
- scientific article; zbMATH DE number 3296905 (Why is no real title available?)
- scientific article; zbMATH DE number 3371284 (Why is no real title available?)
- Inertial proximal alternating linearized minimization (iPALM) for nonconvex and nonsmooth problems
- iPiano: inertial proximal algorithm for nonconvex optimization
- Lectures on convex optimization
- Mixed membership stochastic blockmodels
- On gradients of functions definable in o-minimal structures
- On linear convergence of non-Euclidean gradient methods without strong convexity and Lipschitz gradient continuity
- On semi- and subanalytic geometry
- On the convergence of block coordinate descent type methods
- On the convergence of the block nonlinear Gauss-Seidel method under convex constraints
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- On the rate of convergence of the proximal alternating linearized minimization algorithm for convex problems
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- Regularity properties of non-negative sparsity sets
- Relatively smooth convex optimization by first-order methods, and applications
- Splitting methods with variable metric for Kurdyka-Łojasiewicz functions and general convergence rates
- The cyclic block conditional gradient method for convex optimization problems
- The proximal alternating direction method of multipliers in the nonconvex setting: convergence analysis and rates
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
- Unifying abstract inexact convergence theorems and block coordinate variable metric iPiano
- Universal gradient methods for convex optimization problems
- Variational Analysis
Cited in
(12)- Multi-block Bregman proximal alternating linearized minimization and its application to orthogonal nonnegative matrix factorization
- Four algorithms to solve symmetric multi-type non-negative matrix tri-factorization problem
- Block Bregman majorization minimization with extrapolation
- Understanding non-negative matrix factorization in the framework of Bregman divergence
- A Bregman stochastic method for nonconvex nonsmooth problem beyond global Lipschitz gradient continuity
- An alternating structure-adapted Bregman proximal gradient descent algorithm for constrained nonconvex nonsmooth optimization problems and its inertial variant
- A stochastic two-step inertial Bregman proximal alternating linearized minimization algorithm for nonconvex and nonsmooth problems
- Smoothing proximal gradient block-coordinate algorithms for group sparse _0 regularized nonsmooth convex regression problem
- Deep block proximal linearized minimization algorithm for nonconvex inverse problems
- A fast computational Gauss-Seidel type iPALM algorithm using an incremental aggregated gradient strategy for weakly convex composite optimization problems with application in image processing
- Smoothing randomized block-coordinate proximal gradient algorithms for nonsmooth nonconvex composite optimization
- General inertial alternating structure-adapted proximal gradient descent method for solving nonseparable nonconvex optimization problems
This page was built for publication: A block inertial Bregman proximal algorithm for nonsmooth nonconvex problems with application to symmetric nonnegative matrix tri-factorization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2046565)
