Composite optimization by nonconvex majorization-minimization
From MaRDI portal
first-order optimizationKurdyka-Łojasiewicz inequalitymajorization-minimizationnonconvex optimizationtime-of-flight depth reconstruction
Semi-analytic sets, subanalytic sets, and generalizations (32B20) Nonlinear ill-posed problems (47J06) Numerical optimization and variational techniques (65K10) Computing methodologies for image processing (68U10) Large-scale problems in mathematical programming (90C06) Nonconvex programming, global optimization (90C26)
Abstract: The minimization of a nonconvex composite function can model a variety of imaging tasks. A popular class of algorithms for solving such problems are majorization-minimization techniques which iteratively approximate the composite nonconvex function by a majorizing function that is easy to minimize. Most techniques, e.g. gradient descent, utilize convex majorizers in order to guarantee that the majorizer is easy to minimize. In our work we consider a natural class of nonconvex majorizers for these functions, and show that these majorizers are still sufficient for a globally convergent optimization scheme. Numerical results illustrate that by applying this scheme, one can often obtain superior local optima compared to previous majorization-minimization methods, when the nonconvex majorizers are solved to global optimality. Finally, we illustrate the behavior of our algorithm for depth super-resolution from raw time-of-flight data.
Recommendations
- Convergence of an inexact majorization-minimization method for solving a class of composite optimization problems
- Nonconvex nonsmooth optimization via convex-nonconvex majorization-minimization
- iPiano: inertial proximal algorithm for nonconvex optimization
- Non-convex optimization via strongly convex majorization-minimization
- MOCCA: mirrored convex/concave optimization for nonconvex composite functions
Cites work
- A Convex Approach to Minimal Partitions
- A descent lemma beyond Lipschitz gradient continuity: first-order methods revisited and applications
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A first-order primal-dual algorithm for convex problems with applications to imaging
- A guide to the TV zoo
- A primal-dual hybrid gradient method for nonlinear operators with applications to MRI
- A proximal method for composite minimization
- Accelerated Bregman proximal gradient methods for relatively smooth convex optimization
- Algorithms for Finding Global Minimizers of Image Segmentation and Denoising Models
- An Invitation to Tame Optimization
- Analysis of Generalized Pattern Searches
- Clarke Subgradients of Stratifiable Functions
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Convergence Rates in Forward--Backward Splitting
- Convex Analysis
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- Convex relaxation of vectorial problems with coupled regularization
- ESSENTIAL SMOOTHNESS, ESSENTIAL STRICT CONVEXITY, AND LEGENDRE FUNCTIONS IN BANACH SPACES
- First order methods beyond convexity and Lipschitz gradient continuity with applications to quadratic inverse problems
- Global optimization by multilevel coordinate search
- Global solutions of variational models with convex regularization
- Gradient methods for minimizing composite functions
- scientific article; zbMATH DE number 1046019 (Why is no real title available?)
- scientific article; zbMATH DE number 1946899 (Why is no real title available?)
- scientific article; zbMATH DE number 2035082 (Why is no real title available?)
- scientific article; zbMATH DE number 194544 (Why is no real title available?)
- scientific article; zbMATH DE number 2107974 (Why is no real title available?)
- scientific article; zbMATH DE number 906530 (Why is no real title available?)
- Introductory lectures on convex optimization. A basic course.
- iPiano: inertial proximal algorithm for nonconvex optimization
- Linear and nonlinear programming.
- Linearly constrained nonsmooth and nonconvex minimization
- Majorization-Minimization Algorithms in Signal Processing, Communications, and Machine Learning
- Majorization-minimization procedures and convergence of SQP methods for semi-algebraic and tame programs
- Non-smooth non-convex Bregman minimization: unification and new algorithms
- Nonlinear total variation based noise removal algorithms
- Nonsmooth optimization using Taylor-like models: error bounds, convergence, and termination criteria
- On iteratively reweighted algorithms for nonsmooth nonconvex optimization in computer vision
- On the convergence properties of the EM algorithm
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Rigorous global search: continuous problems
- Scatter search and local NLP solvers: a multistart framework for global optimization
- The calibration method for the Mumford-Shah functional and free-discontinuity problems
- The parallel genetic algorithm as function optimizer
- The value function approach to convergence analysis in composite optimization
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
- Unifying abstract inexact convergence theorems and block coordinate variable metric iPiano
- Variable metric forward-backward algorithm for minimizing the sum of a differentiable function and a convex function
- Variable metric inexact line-search-based methods for nonsmooth optimization
- Variational analysis of spectral functions simplified
- Variational methods in imaging
Cited in
(13)- Unification of basic and composite nondifferentiable optimization
- An accelerated IRNN-iteratively reweighted nuclear norm algorithm for nonconvex nonsmooth low-rank minimization problems
- Nonsmooth optimization using Taylor-like models: error bounds, convergence, and termination criteria
- Convergence of an inexact majorization-minimization method for solving a class of composite optimization problems
- MOCCA: mirrored convex/concave optimization for nonconvex composite functions
- Variable Metric Forward-Backward Algorithm for Composite Minimization Problems
- Non-convex optimization via strongly convex majorization-minimization
- Nonconvex nonsmooth optimization via convex-nonconvex majorization-minimization
- Sparse optimization problems in fractional order Sobolev spaces
- Generalized-Hukuhara subdifferential analysis and its application in nonconvex composite interval optimization problems
- A two-metric variable scaled forward-backward algorithm for \(\ell_0\) optimization problem and its applications
- Quasi-Newton type proximal gradient method for nonconvex nonsmooth composite optimization problems
- Inexact proximal linearized algorithm for difference of convex composite functions
This page was built for publication: Composite optimization by nonconvex majorization-minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5230420)
