A proximal interior point algorithm with applications to image processing

DOI10.1007/s10851-019-00916-wzbMath1486.90209OpenAlexW2980354672MaRDI QIDQ2203368

Marie-Caroline Corbineau, Jean-Christophe Pesquet, Emilie Chouzenoux

Publication date: 6 October 2020

Published in: Journal of Mathematical Imaging and Vision (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10851-019-00916-w

zbMATH Keywords

constrained optimizationinterior point methodsline searchhyperspectral unmixingvariable metricforward-backward algorithmproximity operatorArmijo strategygeometry-texture decomposition

Mathematics Subject Classification ID

Convex programming (90C25) Computing methodologies for image processing (68U10) Interior-point methods (90C51) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Related Items

On the resolution of the variational inequalities of the first and the second kind as equations obtained by explicit Moreau-Yosida regularizations

Uses Software

• PLCP
• SQPlab
• LSMM
• UNLocBoX
• ElemStatLearn

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nonlinear total variation based noise removal algorithms
• New properties of forward-backward splitting and a practical proximal-descent algorithm
• An inexact proximal method for quasiconvex minimization
• Proximal alternating linearized minimization for nonconvex and nonsmooth problems
• Interior point methods 25 years later
• Variable metric forward-backward algorithm for minimizing the sum of a differentiable function and a convex function
• Proximity for sums of composite functions
• A block coordinate variable metric forward-backward algorithm
• Asymptotic selection of viscosity equilibria of semilinear evolution equations by the introduction of a slowly vanishing term
• On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
• A coordinate gradient descent method for nonsmooth separable minimization
• Proximal methods in view of interior-point strategies
• On gradients of functions definable in o-minimal structures
• A variational approach to remove outliers and impulse noise
• Iterative regularization via dual diagonal descent
• Dual block-coordinate forward-backward algorithm with application to deconvolution and deinterlacing of video sequences
• Interior proximal algorithm for quasiconvex programming problems and variational inequalities with linear constraints
• Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods
• A first-order primal-dual algorithm for convex problems with applications to imaging
• Proximal algorithms for multicomponent image recovery problems
• Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
• Splitting methods with variable metric for Kurdyka-Łojasiewicz functions and general convergence rates
• Performance of first- and second-order methods for \(\ell_1\)-regularized least squares problems
• Non-negatively constrained image deblurring with an inexact interior point method
• A random block-coordinate Douglas-Rachford splitting method with low computational complexity for binary logistic regression
• A Feasible BFGS Interior Point Algorithm for Solving Convex Minimization Problems
• Superlinear Convergence of Primal-Dual Interior Point Algorithms for Nonlinear Programming
• Preconditioning of a Generalized Forward-Backward Splitting and Application to Optimization on Graphs
• Variable Metric Inexact Line-Search-Based Methods for Nonsmooth Optimization
• On the convergence of the forward–backward splitting method with linesearches
• A Generalized Forward-Backward Splitting
• Proximal Splitting Methods in Signal Processing
• Majorize–minimize linesearch for inversion methods involving barrier function optimization
• Prox-Penalization and Splitting Methods for Constrained Variational Problems
• Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
• Coupling Forward-Backward with Penalty Schemes and Parallel Splitting for Constrained Variational Inequalities
• New convergence results for the scaled gradient projection method
• Convergence Rates in Forward--Backward Splitting
• Active contours without edges
• Topology preserving deformable image matching using constrained hierarchical parametric models
• Image Decomposition and Restoration Using Total Variation Minimization and theH¹
• Asymptotic behavior of nonautonomous monotone and subgradient evolution equations
• Entropy-Like Proximal Methods in Convex Programming
• Interior Methods for Nonlinear Optimization
• Belief-propagation reconstruction for discrete tomography
• Rate of Convergence Analysis of Decomposition Methods Based on the Proximal Method of Multipliers for Convex Minimization
• Primal-Dual Extragradient Methods for Nonlinear Nonsmooth PDE-Constrained Optimization
• Proximal Point Algorithm Controlled by a Slowly Vanishing Term: Applications to Hierarchical Minimization
• The Variable Metric Forward-Backward Splitting Algorithm Under Mild Differentiability Assumptions
• Parallel Proximal Algorithm for Image Restoration Using Hybrid Regularization
• Epigraphical Projection for Solving Least Squares Anscombe Transformed Constrained Optimization Problems
• The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
• Efficient Minimization Methods of Mixed l2-l1 and l1-l1 Norms for Image Restoration
• Signal Recovery by Proximal Forward-Backward Splitting
• Variable metric forward–backward splitting with applications to monotone inclusions in duality
• Convex analysis and monotone operator theory in Hilbert spaces
• Numerical optimization. Theoretical and practical aspects. Transl. from the French