A block coordinate variable metric forward-backward algorithm

DOI10.1007/s10898-016-0405-9zbMath1351.90128OpenAlexW2259139337MaRDI QIDQ727391

Jean-Christophe Pesquet, Emilie Chouzenoux, Audrey Repetti

Publication date: 6 December 2016

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-016-0405-9

zbMATH Keywords

nonsmooth optimizationinverse problemsnonconvex optimizationblock coordinate descentphase retrievalproximity operatoralternating minimizationmajorize-minimize algorithm

Mathematics Subject Classification ID

Convex programming (90C25) Nonconvex programming, global optimization (90C26) Numerical optimization and variational techniques (65K10) Computing methodologies for image processing (68U10) Linear programming (90C05) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Decomposition methods (49M27) Preconditioners for iterative methods (65F08)

Related Items

Block delayed Majorize-Minimize subspace algorithm for large scale image restoration ^* ⋮ Block-coordinate and incremental aggregated proximal gradient methods for nonsmooth nonconvex problems ⋮ Local convergence of the heavy-ball method and iPiano for non-convex optimization ⋮ Efficient Blind Compressed Sensing Using Sparsifying Transforms with Convergence Guarantees and Application to Magnetic Resonance Imaging ⋮ Inertial alternating direction method of multipliers for non-convex non-smooth optimization ⋮ New convergence results for the inexact variable metric forward-backward method ⋮ On an iteratively reweighted linesearch based algorithm for nonconvex composite optimization ⋮ Some extensions of the operator splitting schemes based on Lagrangian and primal–dual: a unified proximal point analysis ⋮ A generalized inertial proximal alternating linearized minimization method for nonconvex nonsmooth problems ⋮ A generalized forward-backward splitting operator: degenerate analysis and applications ⋮ Convergence of the forward-backward algorithm: beyond the worst-case with the help of geometry ⋮ The operator splitting schemes revisited: primal-dual gap and degeneracy reduction by a unified analysis ⋮ Template-based image reconstruction facing different topologies ⋮ Analysis of a variable metric block coordinate method under proximal errors ⋮ A proximal interior point algorithm with applications to image processing ⋮ Regularized non-local total variation and application in image restoration ⋮ Dual block-coordinate forward-backward algorithm with application to deconvolution and deinterlacing of video sequences ⋮ An abstract convergence framework with application to inertial inexact forward-backward methods ⋮ Unifying Abstract Inexact Convergence Theorems and Block Coordinate Variable Metric iPiano ⋮ Variable metric techniques for forward-backward methods in imaging ⋮ Inexact variable metric stochastic block-coordinate descent for regularized optimization ⋮ Approximate versions of proximal iteratively reweighted algorithms including an extended IP-ICMM for signal and image processing problems ⋮ Proximal primal-dual best approximation algorithm with memory ⋮ A block coordinate variable metric linesearch based proximal gradient method ⋮ Toward fast transform learning ⋮ A remark on accelerated block coordinate descent for computing the proximity operators of a sum of convex functions ⋮ Greedy approximate projection for magnetic resonance fingerprinting with partial volumes ⋮ An Alternating Semiproximal Method for Nonconvex Regularized Structured Total Least Squares Problems ⋮ Alternating Structure-Adapted Proximal Gradient Descent for Nonconvex Nonsmooth Block-Regularized Problems ⋮ The proximal alternating minimization algorithm for two-block separable convex optimization problems with linear constraints ⋮ Adaptive FISTA for Nonconvex Optimization ⋮ Scalable Bayesian Uncertainty Quantification in Imaging Inverse Problems via Convex Optimization ⋮ Variable Metric Forward-Backward Algorithm for Composite Minimization Problems ⋮ Optimal multivariate Gaussian fitting with applications to PSF modeling in two-photon microscopy imaging ⋮ Complexity of a Quadratic Penalty Accelerated Inexact Proximal Point Method for Solving Linearly Constrained Nonconvex Composite Programs ⋮ Stochastic Quasi-Fejér Block-Coordinate Fixed Point Iterations with Random Sweeping ⋮ Proximal Heterogeneous Block Implicit-Explicit Method and Application to Blind Ptychographic Diffraction Imaging ⋮ Choose Your Path Wisely: Gradient Descent in a Bregman Distance Framework ⋮ Splitting methods with variable metric for Kurdyka-Łojasiewicz functions and general convergence rates

Uses Software

• UNLocBoX
• iPiano
• GESPAR
• PhaseLift

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Inexact coordinate descent: complexity and preconditioning
• Proximal alternating linearized minimization for nonconvex and nonsmooth problems
• Variable metric forward-backward algorithm for minimizing the sum of a differentiable function and a convex function
• Variable metric quasi-Fejér monotonicity
• On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
• A predictor-corrector algorithm for the coupling of stiff ODEs to a particle population balance
• On the convergence of the coordinate descent method for convex differentiable minimization
• Asymptotic properties of the Fenchel dual functional and applications to decomposition problems
• A globally convergent algorithm for nonconvex optimization based on block coordinate update
• 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
• Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function
• Phase recovery, MaxCut and complex semidefinite programming
• A Unified Convergence Analysis of Block Successive Minimization Methods for Nonsmooth Optimization
• A Block Coordinate Descent Method for Regularized Multiconvex Optimization with Applications to Nonnegative Tensor Factorization and Completion
• iPiano: Inertial Proximal Algorithm for Nonconvex Optimization
• Proximal Splitting Methods in Signal Processing
• Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
• Clarke Subgradients of Stratifiable Functions
• Characterizations of Łojasiewicz inequalities: Subgradient flows, talweg, convexity
• Optimization of “$\log x$” Entropy over Linear Equality Constraints
• On the Linear Convergence of Descent Methods for Convex Essentially Smooth Minimization
• Variational Analysis
• GESPAR: Efficient Phase Retrieval of Sparse Signals
• Proximal Heterogeneous Block Implicit-Explicit Method and Application to Blind Ptychographic Diffraction Imaging
• The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
• Signal Recovery by Proximal Forward-Backward Splitting
• Variable metric forward–backward splitting with applications to monotone inclusions in duality
• Stochastic Quasi-Fejér Block-Coordinate Fixed Point Iterations with Random Sweeping
• Proximité et dualité dans un espace hilbertien
• Convergence Conditions for Nonlinear Programming Algorithms
• On search directions for minimization algorithms
• A variational formulation for frame-based inverse problems
• Phase Retrieval via Matrix Completion
• Convergence of a block coordinate descent method for nondifferentiable minimization