Proximal alternating linearized minimization for nonconvex and nonsmooth problems

DOI10.1007/S10107-013-0701-9zbMATH Open1297.90125OpenAlexW2027982384MaRDI QIDQ403666FDOQ403666

Authors: Jérôme Bolte, Shoham Sabach, Marc Teboulle 

Publication date: 29 August 2014

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-013-0701-9

Recommendations

• A proximal alternating linearization method for nonconvex optimization problems
• A proximal alternating direction method of multiplier for linearly constrained nonconvex minimization
• Proximal alternating penalty algorithms for nonsmooth constrained convex optimization
• A proximal alternating direction method of multipliers for a minimization problem with nonconvex constraints
• A Proximal Minimization Algorithm for Structured Nonconvex and Nonsmooth Problems
• A class of linearized proximal alternating direction methods
• A Stochastic Proximal Alternating Minimization for Nonsmooth and Nonconvex Optimization
• A generalized inertial proximal alternating linearized minimization method for nonconvex nonsmooth problems
• A class of alternating linearization algorithms for nonsmooth convex optimization
• scientific article; zbMATH DE number 7404502

zbMATH Keywords

Gauss-Seidel methodblock coordinate descentalternating minimization[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=Kurdyka-%EF%BF%BD%EF%BF%BDojasiewicz+property&go=Go Kurdyka-��ojasiewicz property]nonconvex-nonsmooth minimizationproximal forward-backwardsparse nonnegative matrix factorization

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Iterative procedures involving nonlinear operators (47J25) Decomposition methods (49M27)

Cites Work

• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• Convergence of a block coordinate descent method for nondifferentiable minimization
• Variational Analysis
• Convex analysis and monotone operator theory in Hilbert spaces
• Algorithms and applications for approximate nonnegative matrix factorization
• Projected Gradient Methods for Nonnegative Matrix Factorization
• Non-negative matrix factorization with sparseness constraints
• Learning the parts of objects by non-negative matrix factorization
• Title not available (Why is that?)
• Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
• On the convergence of the block nonlinear Gauss-Seidel method under convex constraints
• Clarke Subgradients of Stratifiable Functions
• Title not available (Why is that?)
• Variational Analysis and Generalized Differentiation I
• Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
• Title not available (Why is that?)
• On gradients of functions definable in o-minimal structures
• The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
• Title not available (Why is that?)
• Méthodes numériques pour la décomposition et la minimisation de fonctions non différentiables
• Characterizations of Łojasiewicz inequalities: Subgradient flows, talweg, convexity
• Convex Optimization in Signal Processing and Communications
• On the convergence of block coordinate descent type methods
• On search directions for minimization algorithms
• On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
• Time bounds for selection
• Conditional gradient algorithms for rank-one matrix approximations with a sparsity constraint
• Asymptotic properties of the Fenchel dual functional and applications to decomposition problems
• Learning sparse representations by non-negative matrix factorization and sequential cone programming
• Title not available (Why is that?)

Cited In (only showing first 100 items - show all)

• An alternating linearization bundle method for a class of nonconvex nonsmooth optimization problems
• An attention algorithm for solving large scale structured \(l_0\)-norm penalty estimation problems
• Bregman proximal gradient algorithms for deep matrix factorization
• Convergence of proximal algorithms with stepsize controls for non-linear inverse problems and application to sparse non-negative matrix factorization
• A Bregman-style partially symmetric alternating direction method of multipliers for nonconvex multi-block optimization
• Continuous dynamics related to monotone inclusions and non-smooth optimization problems
• Weighted hyper-Laplacian prior with overlapping group sparsity for image restoration under Cauchy noise
• Riemannian proximal gradient methods
• A non-Euclidean gradient descent method with sketching for unconstrained matrix minimization
• On Algorithms for Difference of Monotone Operators
• Blind source separation with outliers in transformed domains
• A second-order dynamical approach with variable damping to nonconvex smooth minimization
• Extended ADMM and BCD for nonseparable convex minimization models with quadratic coupling terms: convergence analysis and insights
• A penalty method for rank minimization problems in symmetric matrices
• Inertial proximal alternating linearized minimization (iPALM) for nonconvex and nonsmooth problems
• Alternating direction method of multipliers for nonconvex log total variation image restoration
• First order methods beyond convexity and Lipschitz gradient continuity with applications to quadratic inverse problems
• First-order algorithms for convex optimization with nonseparable objective and coupled constraints
• Convex-concave backtracking for inertial Bregman proximal gradient algorithms in nonconvex optimization
• A nonmonotone alternating updating method for a class of matrix factorization problems
• Accelerating the DC algorithm for smooth functions
• Proximal mapping for symmetric penalty and sparsity
• A simple globally convergent algorithm for the nonsmooth nonconvex single source localization problem
• Approaching nonsmooth nonconvex minimization through second-order proximal-gradient dynamical systems
• Local convergence of the heavy-ball method and iPiano for non-convex optimization
• Convergence analysis of Douglas-Rachford splitting method for ``strongly + weakly convex programming
• On algorithms for difference of monotone operators
• Extragradient method in optimization: convergence and complexity
• A generalized proximal linearized algorithm for DC functions with application to the optimal size of the firm problem
• Efficient numerical methods for computing the stationary states of phase field crystal models
• The proximal alternating minimization algorithm for two-block separable convex optimization problems with linear constraints
• The Kurdyka-Łojasiewicz inequality as regularity condition
• A general double-proximal gradient algorithm for d.c. programming
• Douglas--Rachford Splitting and ADMM for Nonconvex Optimization: Tight Convergence Results
• Nonconvex Lagrangian-based optimization: monitoring schemes and global convergence
• A simplified view of first order methods for optimization
• Approaching nonsmooth nonconvex optimization problems through first order dynamical systems with hidden acceleration and Hessian driven damping terms
• Fast rank-one alternating minimization algorithm for phase retrieval
• An \(l_0\)-norm based color image deblurring model under mixed random-valued impulse and Gaussian noise
• Forward-backward quasi-Newton methods for nonsmooth optimization problems
• Wavelet tight frame and prior image-based image reconstruction from limited-angle projection data
• A partially proximal linearized alternating minimization method for finding Dantzig selectors
• Majorization-minimization procedures and convergence of SQP methods for semi-algebraic and tame programs
• Existence and convergence analysis of \(\ell_{0}\) and \(\ell_{2}\) regularizations for limited-angle CT reconstruction
• Global convergence of proximal iteratively reweighted algorithm
• Precompact convergence of the nonconvex primal-dual hybrid gradient algorithm
• Nonconvex optimization with inertial proximal stochastic variance reduction gradient
• The value function approach to convergence analysis in composite optimization
• Revisiting the approximate Carathéodory problem via the Frank-Wolfe algorithm
• A preconditioned difference of convex algorithm for truncated quadratic regularization with application to imaging
• Analysis of the Block Coordinate Descent Method for Linear Ill-Posed Problems
• A forward-backward dynamical approach to the minimization of the sum of a nonsmooth convex with a smooth nonconvex function
• A stochastic alternating direction method of multipliers for non-smooth and non-convex optimization
• On the convergence of higher-order orthogonal iteration
• Optimality condition and quasi-conjugate duality with zero gap in nonconvex optimization
• Continuous-domain assignment flows
• RSG: Beating Subgradient Method without Smoothness and Strong Convexity
• Relax-and-split method for nonconvex inverse problems
• A fast proximal iteratively reweighted nuclear norm algorithm for nonconvex low-rank matrix minimization problems
• Douglas-Rachford splitting and ADMM for nonconvex optimization: accelerated and Newton-type linesearch algorithms
• Dual block-coordinate forward-backward algorithm with application to deconvolution and deinterlacing of video sequences
• Semi-blind image deblurring by a proximal alternating minimization method with convergence guarantees
• A proximal quasi-Newton trust-region method for nonsmooth regularized optimization
• Regularization of inverse problems via time discrete geodesics in image spaces
• Bregman reweighted alternating minimization and its application to image deblurring
• A new nonconvex approach to low-rank matrix completion with application to image inpainting
• On the Convergence to Stationary Points of Deterministic and Randomized Feasible Descent Directions Methods
• The Boosted Difference of Convex Functions Algorithm for Nonsmooth Functions
• Estimation of graphical models through structured norm minimization
• Global convergence analysis of sparse regular nonconvex optimization problems
• Convergence of inexact forward-backward algorithms using the forward-backward envelope
• An inertial Newton algorithm for deep learning
• The \(\ell_{2,p}\) regularized total variation with overlapping group sparsity prior for image restoration with impulse noise
• Multi-dimensional image recovery via fully-connected tensor network decomposition under the learnable transforms
• Tensor completion via a generalized transformed tensor t-product decomposition without t-SVD
• Nonlinear matrix recovery using optimization on the Grassmann manifold
• Convergence and stability analysis of the half thresholding based few-view CT reconstruction
• Block-coordinate and incremental aggregated proximal gradient methods for nonsmooth nonconvex problems
• Blind Ptychographic Phase Retrieval via Convergent Alternating Direction Method of Multipliers
• Avoiding bad steps in Frank-Wolfe variants
• Solving blind ptychography effectively via linearized alternating direction method of multipliers
• Inertial accelerated SGD algorithms for solving large-scale lower-rank tensor CP decomposition problems
• Inertial stochastic PALM and applications in machine learning
• PET-MRI joint reconstruction with common edge weighted total variation regularization
• Some accelerated alternating proximal gradient algorithms for a class of nonconvex nonsmooth problems
• Title not available (Why is that?)
• On a general smoothly truncated regularization for variational piecewise constant image restoration: construction and convergent algorithms
• A generalized non-convex method for robust tensor completion
• Convergence and dynamical behavior of the ADAM algorithm for nonconvex stochastic optimization
• Variational image regularization with Euler's elastica using a discrete gradient scheme
• A Bregman forward-backward linesearch algorithm for nonconvex composite optimization: superlinear convergence to nonisolated local minima
• A block inertial Bregman proximal algorithm for nonsmooth nonconvex problems with application to symmetric nonnegative matrix tri-factorization
• Several accelerated subspace minimization conjugate gradient methods based on regularization model and convergence rate analysis for nonconvex problems
• Unifying abstract inexact convergence theorems and block coordinate variable metric iPiano
• Proximal-like incremental aggregated gradient method with Bregman distance in weakly convex optimization problems
• Incremental without replacement sampling in nonconvex optimization
• The epsilon-alternating least squares for orthogonal low-rank tensor approximation and its global convergence
• Nonlocal robust tensor recovery with nonconvex regularization
• Perturbation techniques for convergence analysis of proximal gradient method and other first-order algorithms via variational analysis
• Quick-means: accelerating inference for K-means by learning fast transforms

This page was built for publication: Proximal alternating linearized minimization for nonconvex and nonsmooth problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q403666)