A parameterized three-operator splitting algorithm for non-convex minimization problems with applications

DOI10.23952/JNVA.8.2024.3.07MaRDI QIDQ6561488zbMATH OpenFDO

Authors Liuyi Miao, Yu-Chao Tang, Chang-Long Wang

Publication date 25 June 2024

Published in Journal of Nonlinear and Variational Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.23952/JNVA.8.2024.3.07

zbMATH Keywords

image inpainting problemslow rank matrix recoverynon-convex minimizationparameterizedthree-operator splitting algorithm

Mathematics Subject Classification ID

Functional analysis (46-XX) Operator theory (47-XX)

Cites work

• A lower bound guaranteeing exact matrix completion via singular value thresholding algorithm
• A method for finding structured sparse solutions to nonnegative least squares problems with applications
• A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings
• A parameterized Douglas-Rachford algorithm
• A parameterized Douglas-Rachford splitting algorithm for nonconvex optimization
• A parameterized three-operator splitting algorithm and its expansion
• A Singular Value Thresholding Algorithm for Matrix Completion
• A three-operator splitting algorithm for nonconvex sparsity regularization
• A three-operator splitting scheme and its optimization applications
• A weighted difference of anisotropic and isotropic total variation model for image processing
• Accelerated matrix completion algorithm using continuation strategy and randomized SVD
• An inertial forward-backward algorithm for the minimization of the sum of two nonconvex functions
• An inertial Tseng's type proximal algorithm for nonsmooth and nonconvex optimization problems
• Computing sparse representation in a highly coherent dictionary based on difference of L₁ and L₂
• Convergence analysis of the generalized splitting methods for a class of nonconvex optimization problems
• 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
• Douglas--Rachford Splitting and ADMM for Nonconvex Optimization: Tight Convergence Results
• Douglas-Rachford splitting and ADMM for nonconvex optimization: accelerated and Newton-type linesearch algorithms
• Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems
• First-order methods in optimization
• Forward-backward envelope for the sum of two nonconvex functions: further properties and nonmonotone linesearch algorithms
• Minimization of \(\ell_{1-2}\) for compressed sensing
• Peaceman-Rachford splitting for a class of nonconvex optimization problems
• Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
• Reweighted Low-Rank Matrix Analysis With Structural Smoothness for Image Denoising
• Signal Recovery by Proximal Forward-Backward Splitting
• Sparse Signal Recovery via Generalized Entropy Functions Minimization

Cited in

(2)

• A modified inertial proximal alternating direction method of multipliers with dual-relaxed term for structured nonconvex and nonsmooth problem
• Generalized reflected Davis-Yin splitting algorithms for the monotone inclusions problems

This page was built for publication: A parameterized three-operator splitting algorithm for non-convex minimization problems with applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6561488)