An Alternating Semiproximal Method for Nonconvex Regularized Structured Total Least Squares Problems

DOI10.1137/15M1017557zbMath1346.90676MaRDI QIDQ2818270

Amir Beck, Shoham Sabach, Marc Teboulle

Publication date: 7 September 2016

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

zbMATH Keywords

global convergencealternating minimizationsemialgebraic functionsnonconvex-nonsmooth minimizationproximal gradient methodsKurdyka-Łojasiewisz propertyregularized structured total least squares

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Inverse problems in optimal control (49N45)

Related Items (4)

Nested alternating minimization with FISTA for non-convex and non-smooth optimization problems ⋮ Multi-block Bregman proximal alternating linearized minimization and its application to orthogonal nonnegative matrix factorization ⋮ Solving inverse problems using data-driven models ⋮ Alternating Structure-Adapted Proximal Gradient Descent for Nonconvex Nonsmooth Block-Regularized Problems

Uses Software

• CVX
• VanHuffel
• Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
• An Analysis of the Total Least Squares Problem
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• Proximal alternating linearized minimization for nonconvex and nonsmooth problems
• A block coordinate variable metric forward-backward algorithm
• On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
• Structured total least squares and \(L_ 2\) approximation problems
• On gradients of functions definable in o-minimal structures
• Regularization tools: A Matlab package for analysis and solution of discrete ill-posed problems
• A fast dual proximal gradient algorithm for convex minimization and applications
• Fast Structured Total Least Squares Algorithm for Solving the Basic Deconvolution Problem
• On the Convergence of Alternating Minimization for Convex Programming with Applications to Iteratively Reweighted Least Squares and Decomposition Schemes
• Deblurring Images
• Characterizations of Łojasiewicz inequalities: Subgradient flows, talweg, convexity
• A Fast Method for Finding the Global Solution of the Regularized Structured Total Least Squares Problem for Image Deblurring
• The constrained total least squares technique and its applications to harmonic superresolution
• Variational Analysis
• Blind Deconvolution Using a Regularized Structured Total Least Norm Algorithm
• Tikhonov Regularization and Total Least Squares
• Total Least Norm Formulation and Solution for Structured Problems
• Proximal Heterogeneous Block Implicit-Explicit Method and Application to Blind Ptychographic Diffraction Imaging
• Block-Toeplitz/Hankel Structured Total Least Squares
• The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
• On the Solution of the Tikhonov Regularization of the Total Least Squares Problem
• Proximité et dualité dans un espace hilbertien
• Convex Analysis
• Convergence of a block coordinate descent method for nondifferentiable minimization
• Analysis of the structured total least squares problem for Hankel/Toeplitz matrices

This page was built for publication: An Alternating Semiproximal Method for Nonconvex Regularized Structured Total Least Squares Problems