Majorize-minimize linesearch for inversion methods involving barrier function optimization
ill-conditioned matrixinversion methodsmajorize-minimize linesearchmodel uncertaintiesnumerical examplessignal and image processing
Numerical mathematical programming methods (65K05) Linear programming (90C05) Approximation methods and heuristics in mathematical programming (90C59) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)
The authors consider the frequent situation where the dependence of the observations \(y\in\mathbb{R}^M\) on the unknown discretized object \(x^0\in\mathbb{R}^N\) is represented by a linear model \(y= Kx^0+\varepsilon\) with \(K\) being a known ill-conditioned matrix and \(\varepsilon\) an additive noise term representing measurement errors and model uncertainties. To handle the ill-posedness of such problems, several efficient inversion methods are based on the minimization of a composite criterion \(F(x)= S(x)+\lambda R(x)\).NEWLINENEWLINE The efficiency of the proposed approach is illustrated through numerical examples in the field of signal and image processing.
- Line Search Procedures for the Logarithmic Barrier Function
- A Linesearch Procedure in Barrier Methods for Some Convex Programming Problems
- scientific article; zbMATH DE number 7473683
- Majorization-minimization generalized Krylov subspace methods for \({\ell _p}\)-\({\ell _q}\) optimization applied to image restoration
- A barrier function method for minimax problems
This page was built for publication: Majorize-minimize linesearch for inversion methods involving barrier function optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2898427)
