A Gauss-Seidel type inertial proximal alternating linearized minimization for a class of nonconvex optimization problems
From MaRDI portal
Publication:2307755
DOI10.1007/s10898-019-00819-5zbMath1476.90256OpenAlexW2972561294WikidataQ127291664 ScholiaQ127291664MaRDI QIDQ2307755
Deren Han, Xue Gao, Xing-Ju Cai
Publication date: 25 March 2020
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-019-00819-5
Kurdyka-Łojasiewicz propertyGauss-Seidelinertialalternating proximal linearized minimizationnonconvex-nonsmooth optimization
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Decomposition methods (49M27)
Related Items (13)
An inertial Bregman generalized alternating direction method of multipliers for nonconvex optimization ⋮ Some accelerated alternating proximal gradient algorithms for a class of nonconvex nonsmooth problems ⋮ A family of three-term conjugate gradient projection methods with a restart procedure and their relaxed-inertial extensions for the constrained nonlinear pseudo-monotone equations with applications ⋮ A generalized inertial proximal alternating linearized minimization method for nonconvex nonsmooth problems ⋮ An inertial alternating minimization with Bregman distance for a class of nonconvex and nonsmooth problems ⋮ Linear Convergence of a Proximal Alternating Minimization Method with Extrapolation for \(\boldsymbol{\ell_1}\) -Norm Principal Component Analysis ⋮ An alternating structure-adapted Bregman proximal gradient descent algorithm for constrained nonconvex nonsmooth optimization problems and its inertial variant ⋮ A modified inertial three-term conjugate gradient projection method for constrained nonlinear equations with applications in compressed sensing ⋮ Unnamed Item ⋮ Inertial proximal gradient methods with Bregman regularization for a class of nonconvex optimization problems ⋮ An inertial proximal partially symmetric ADMM-based algorithm for linearly constrained multi-block nonconvex optimization problems with applications ⋮ Two-step inertial Bregman alternating minimization algorithm for nonconvex and nonsmooth problems ⋮ Inertial accelerated SGD algorithms for solving large-scale lower-rank tensor CP decomposition problems
Uses Software
Cites Work
- Unnamed Item
- Nonlinear total variation based noise removal algorithms
- Inertial Douglas-Rachford splitting for monotone inclusion problems
- An inertial Tseng's type proximal algorithm for nonsmooth and nonconvex optimization problems
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Lectures on convex optimization
- iPiasco: inertial proximal algorithm for strongly convex optimization
- Asymptotic properties of the Fenchel dual functional and applications to decomposition problems
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- On the convergence of the block nonlinear Gauss-Seidel method under convex constraints
- An inertial alternating direction method of multipliers
- 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 General Inertial Proximal Point Algorithm for Mixed Variational Inequality Problem
- Clarke Subgradients of Stratifiable Functions
- On the Minimizing Property of a Second Order Dissipative System in Hilbert Spaces
- A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings
- On the Convergence of Block Coordinate Descent Type Methods
- 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
This page was built for publication: A Gauss-Seidel type inertial proximal alternating linearized minimization for a class of nonconvex optimization problems
