Approximate versions of proximal iteratively reweighted algorithms including an extended IP-ICMM for signal and image processing problems
type: Item
instance of: scholarly article
title: Approximate versions of proximal iteratively reweighted algorithms including an extended IP-ICMM for signal and image processing problems
author: Myeongmin Kang
published in: Journal of Computational and Applied Mathematics
publication date: 2020-04-15T00:00:00Z
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 65K10
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 94A08
zbMATH DE Number: 7189432
zbMATH Keywords: iteratively reweighted algorithm
zbMATH Keywords: inexact stopping condition
zbMATH Keywords: nonconvex optimization
zbMATH Keywords: nonsmooth objective function
zbMATH Keywords: Kurdyka-Łojasiewicz property
zbMATH Keywords: nonconvex regularization
describes a project that uses: iPiano
describes a project that uses: iPiasco
MaRDI profile type: Publication
full work available at URL: j.cam.2020.112837
OpenAlex ID: W3012004192
cites work: A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
cites work: Signal Recovery by Proximal Forward-Backward Splitting
cites work: A first-order primal-dual algorithm for convex problems with applications to imaging
cites work: Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
cites work: On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
cites work: Monotone Operators and the Proximal Point Algorithm
cites work: Introductory lectures on convex optimization. A basic course.
cites work: Q5491447
cites work: Proximal point methods and nonconvex optimization
cites work: On the convergence of a linesearch based proximal-gradient method for nonconvex optimization
cites work: Convergence Analysis of Alternating Direction Method of Multipliers for a Family of Nonconvex Problems
cites work: Enhancing sparsity by reweighted \(\ell _{1}\) minimization
cites work: Improved iteratively reweighted least squares for unconstrained smoothed \(\ell_q\) minimization
cites work: On Iteratively Reweighted Algorithms for Nonsmooth Nonconvex Optimization in Computer Vision
cites work: Clarke Subgradients of Stratifiable Functions
cites work: On gradients of functions definable in o-minimal structures
cites work: On semi- and subanalytic geometry
cites work: Q5643297
cites work: The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
cites work: Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
cites work: Inertial Proximal Alternating Linearized Minimization (iPALM) for Nonconvex and Nonsmooth Problems
cites work: Convergence of the Iterates of Descent Methods for Analytic Cost Functions
cites work: A block coordinate variable metric forward-backward algorithm
cites work: An inertial forward-backward algorithm for the minimization of the sum of two nonconvex functions
cites work: On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
cites work: Convergence analysis of a proximal point algorithm for minimizing differences of functions
cites work: Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
cites work: An Inexact Proximal Path-Following Algorithm for Constrained Convex Minimization
cites work: An Inexact Accelerated Proximal Gradient Method for Large Scale Linearly Constrained Convex SDP
cites work: Inexact accelerated augmented Lagrangian methods
cites work: Error bounds for proximal point subproblems and associated inexact proximal point algorithms
cites work: Approximate ADMM algorithms derived from Lagrangian splitting
cites work: Inexact Variants of the Proximal Point Algorithm without Monotonicity
cites work: Relative-error approximate versions of Douglas-Rachford splitting and special cases of the ADMM
cites work: Generalized inexact proximal algorithms: routine's formation with resistance to change, following worthwhile changes
cites work: Variable metric forward-backward algorithm for minimizing the sum of a differentiable function and a convex function
cites work: An accelerated inexact proximal point algorithm for convex minimization
cites work: Fréchet subdifferential calculus and optimality conditions in nondifferentiable programming
cites work: Online Learning and Online Convex Optimization
cites work: Model completeness results for expansions of the ordered field of real numbers by restricted Pfaffian functions and the exponential function
cites work: Q4392286
cites work: New Proximal Point Algorithms for Convex Minimization
cites work: Q4903682
cites work: iPiano: inertial proximal algorithm for nonconvex optimization
cites work: The Split Bregman Method for L1-Regularized Problems
cites work: iPiasco: inertial proximal algorithm for strongly convex optimization
DOI: 10.1016/J.CAM.2020.112837
description: scientific article; zbMATH DE number 7189432