Alternating Direction Method of Multipliers for a Class of Nonconvex and Nonsmooth Problems with Applications to Background/Foreground Extraction

DOI10.1137/15M1027528zbMath1364.90278DBLPjournals/siamis/YangPC17arXiv1506.07029OpenAlexW2964011556WikidataQ57511146 ScholiaQ57511146MaRDI QIDQ5266366

Lei Yang, Xiaojun Chen, Ting Kei Pong

Publication date: 2 June 2017

Published in: SIAM Journal on Imaging Sciences (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1506.07029

zbMATH Keywords

alternating direction method of multipliersnonsmooth and nonconvex optimizationbackground/foreground extractiondual step-size

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Nonconvex programming, global optimization (90C26) Numerical optimization and variational techniques (65K10) Optimality conditions and duality in mathematical programming (90C46)

Related Items (49)

An inertial proximal alternating direction method of multipliers for nonconvex optimization ⋮ Inertial alternating direction method of multipliers for non-convex non-smooth optimization ⋮ Convergence of linear Bregman ADMM for nonconvex and nonsmooth problems with nonseparable structure ⋮ Low Tucker rank tensor recovery via ADMM based on exact and inexact iteratively reweighted algorithms ⋮ A Splitting Scheme for Flip-Free Distortion Energies ⋮ Alternating direction method of multipliers for nonconvex fused regression problems ⋮ A nonconvex model with minimax concave penalty for image restoration ⋮ An improved total variation regularized RPCA for moving object detection with dynamic background ⋮ An efficient semi-proximal ADMM algorithm for low-rank and sparse regularized matrix minimization problems with real-world applications ⋮ A Bregman-style partially symmetric alternating direction method of multipliers for nonconvex multi-block optimization ⋮ Algorithm for overcoming the curse of dimensionality for time-dependent non-convex Hamilton-Jacobi equations arising from optimal control and differential games problems ⋮ A new Lagrangian-based first-order method for nonconvex constrained optimization ⋮ A Symmetric Alternating Direction Method of Multipliers for Separable Nonconvex Minimization Problems ⋮ Convergence analysis of an ALF-based nonconvex splitting algorithm with SQP structure ⋮ The Proximal Alternating Direction Method of Multipliers in the Nonconvex Setting: Convergence Analysis and Rates ⋮ Primal-dual optimization algorithms over Riemannian manifolds: an iteration complexity analysis ⋮ Iterative \(p\)-shrinkage thresholding algorithm for low Tucker rank tensor recovery ⋮ Least absolute deviations learning of multiple tasks ⋮ Nonconvex optimization for robust tensor completion from grossly sparse observations ⋮ A nonconvex ADMM for a class of sparse inverse semidefinite quadratic programming problems ⋮ An incremental aggregated proximal ADMM for linearly constrained nonconvex optimization with application to sparse logistic regression problems ⋮ Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis ⋮ Multi-block nonconvex nonsmooth proximal ADMM: convergence and rates under Kurdyka-Łojasiewicz property ⋮ Global convergence of ADMM in nonconvex nonsmooth optimization ⋮ An ADMM-LAP method for total variation myopic deconvolution of adaptive optics retinal images ⋮ On the Edge Recovery Property of Noncovex Nonsmooth Regularization in Image Restoration ⋮ Cauchy noise removal by nonconvex ADMM with convergence guarantees ⋮ An efficient non-convex total variation approach for image deblurring and denoising ⋮ The alternating direction method of multipliers for finding the distance between ellipsoids ⋮ Two-stage convex relaxation approach to low-rank and sparsity regularized least squares loss ⋮ Decomposition into low-rank plus additive matrices for background/foreground separation: a review for a comparative evaluation with a large-scale dataset ⋮ On the discontinuity of images recovered by noncovex nonsmooth regularized isotropic models with box constraints ⋮ Fast algorithms for sparse portfolio selection considering industries and investment styles ⋮ Tractable ADMM schemes for computing KKT points and local minimizers for \(\ell_0\)-minimization problems ⋮ Whiteness constraints in a unified variational framework for image restoration ⋮ An extended proximal ADMM algorithm for three-block nonconvex optimization problems ⋮ A hybrid Bregman alternating direction method of multipliers for the linearly constrained difference-of-convex problems ⋮ A Proximal Minimization Algorithm for Structured Nonconvex and Nonsmooth Problems ⋮ A regularized alternating direction method of multipliers for a class of nonconvex problems ⋮ Blind Ptychographic Phase Retrieval via Convergent Alternating Direction Method of Multipliers ⋮ An inertial proximal partially symmetric ADMM-based algorithm for linearly constrained multi-block nonconvex optimization problems with applications ⋮ Generalized singular value thresholding operator based nonconvex low-rank and sparse decomposition for moving object detection ⋮ Convergence and rate analysis of a proximal linearized ADMM for nonconvex nonsmooth optimization ⋮ A Three-Operator Splitting Algorithm for Nonconvex Sparsity Regularization ⋮ Multi-channel Potts-based reconstruction for multi-spectral computed tomography ⋮ A unified framework for nonconvex nonsmooth sparse and low-rank decomposition by majorization-minimization algorithm ⋮ Proximal ADMM for nonconvex and nonsmooth optimization ⋮ Robust Tensor Completion: Equivalent Surrogates, Error Bounds, and Algorithms ⋮ The lower bound of nonlocal gradient for non-convex and non-smooth image patches based regularization

Uses Software

• BADMM

Cites Work

• Unnamed Item
• Unnamed Item
• Alternating direction method of multipliers for penalized zero-variance discriminant analysis
• Nearly unbiased variable selection under minimax concave penalty
• Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems
• Proximal alternating linearized minimization for nonconvex and nonsmooth problems
• Decomposition into low-rank plus additive matrices for background/foreground separation: a review for a comparative evaluation with a large-scale dataset
• A class of linearized proximal alternating direction methods
• On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
• A dual algorithm for the solution of nonlinear variational problems via finite element approximation
• Global convergence of ADMM in nonconvex nonsmooth optimization
• Asymptotics for Lasso-type estimators.
• Linearized alternating direction method of multipliers with Gaussian back substitution for separable convex programming
• Traditional and recent approaches in background modeling for foreground detection: an overview
• Linearized alternating direction method with parallel splitting and adaptive penalty for separable convex programs in machine learning
• Asymptotic properties of bridge estimators in sparse high-dimensional regression models
• Hankel Matrix Rank Minimization with Applications to System Identification and Realization
• Alternating Direction Method with Gaussian Back Substitution for Separable Convex Programming
• Node-Based Learning of Multiple Gaussian Graphical Models
• A Convergent $3$-Block Semi-Proximal ADMM for Convex Minimization Problems with One Strongly Convex Block
• Convergence Analysis of Alternating Direction Method of Multipliers for a Family of Nonconvex Problems
• Robust principal component analysis?
• Smoothing Nonlinear Conjugate Gradient Method for Image Restoration Using Nonsmooth Nonconvex Minimization
• Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
• Deblurring Images
• Linearly Constrained Non-Lipschitz Optimization for Image Restoration
• Global Convergence of Splitting Methods for Nonconvex Composite Optimization
• Variational Analysis
• Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
• Energy Minimization Methods
• Comments on «Wavelets in statistics: A review» by A. Antoniadis
• A Convergent 3-Block SemiProximal Alternating Direction Method of Multipliers for Conic Programming with 4-Type Constraints
• Robust PCA via Outlier Pursuit
• Efficient Reconstruction of Piecewise Constant Images Using Nonsmooth Nonconvex Minimization
• Median filtering‐based methods for static background extraction from surveillance video
• Benchmarking optimization software with performance profiles.
• The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent

This page was built for publication: Alternating Direction Method of Multipliers for a Class of Nonconvex and Nonsmooth Problems with Applications to Background/Foreground Extraction