Proximal alternating linearized minimization for nonconvex and nonsmooth problems
From MaRDI portal
Publication:403666
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
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
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)
- A Proximal Minimization Algorithm for Structured Nonconvex and Nonsmooth Problems
- Half-linear regularization for nonconvex image restoration models
- A new globally convergent algorithm for non-Lipschitz \(\ell_{p}-\ell_q\) minimization
- A sparse rank-1 approximation algorithm for high-order tensors
- Smoothing partial exact penalty splitting method for mathematical programs with equilibrium constraints
- An inertial forward-backward algorithm for the minimization of the sum of two nonconvex functions
- Multi-block Bregman proximal alternating linearized minimization and its application to orthogonal nonnegative matrix factorization
- A remark on accelerated block coordinate descent for computing the proximity operators of a sum of convex functions
- A generalized inertial proximal alternating linearized minimization method for nonconvex nonsmooth problems
- General inertial proximal gradient method for a class of nonconvex nonsmooth optimization problems
- Stochastic Quasi-Fejér Block-Coordinate Fixed Point Iterations with Random Sweeping
- Extended ADMM and BCD for nonseparable convex minimization models with quadratic coupling terms: convergence analysis and insights
- On the rate of convergence of the proximal alternating linearized minimization algorithm for convex problems
- Wavelet inpainting with the \(\ell_{0}\) sparse regularization
- Proximal Heterogeneous Block Implicit-Explicit Method and Application to Blind Ptychographic Diffraction Imaging
- Optimization on Spheres: Models and Proximal Algorithms with Computational Performance Comparisons
- An inertial Tseng's type proximal algorithm for nonsmooth and nonconvex optimization problems
- From error bounds to the complexity of first-order descent methods for convex functions
- An Orthogonalization-Free Parallelizable Framework for All-Electron Calculations in Density Functional Theory
- A Regularized Newton Method for \({\boldsymbol{\ell}}_{q}\) -Norm Composite Optimization Problems
- An efficient non-convex total variation approach for image deblurring and denoising
- A convergent least-squares regularized blind deconvolution approach
- Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis
- A convergent relaxation of the Douglas-Rachford algorithm
- Alternating direction method of multipliers with difference of convex functions
- Projecting onto the Intersection of a Cone and a Sphere
- Regularized non-local total variation and application in image restoration
- A new nonlocal low-rank regularization method with applications to magnetic resonance image denoising
- Matrix completion via minimizing an approximate rank
- A block coordinate variable metric forward-backward algorithm
- The proximal alternating iterative hard thresholding method for \(l_0\) minimization, with complexity \(\mathcal{O}(1/\sqrt{k})\)
- Energy Minimization Methods
- Globally Solving the Trust Region Subproblem Using Simple First-Order Methods
- Backward-forward algorithms for structured monotone inclusions in Hilbert spaces
- Variable Metric Forward-Backward Algorithm for Composite Minimization Problems
- A General Non-Lipschitz Infimal Convolution Regularized Model: Lower Bound Theory and Algorithm
- Trimmed Statistical Estimation via Variance Reduction
- Error bounds and stability in the \(\ell_0\) regularized for CT reconstruction from small projections
- A nonconvex model with minimax concave penalty for image restoration
- Inertial Proximal Alternating Linearized Minimization (iPALM) for Nonconvex and Nonsmooth Problems
- Alternating proximal gradient method for convex minimization
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- A new alternating direction method for linearly constrained nonconvex optimization problems
- Luminance-Chrominance Model for Image Colorization
- A globally convergent algorithm for nonconvex optimization based on block coordinate update
- Iteration complexity analysis of multi-block ADMM for a family of convex minimization without strong convexity
- Sparse Principal Component Analysis via Variable Projection
- Scalable Bayesian Uncertainty Quantification in Imaging Inverse Problems via Convex Optimization
- A proximal alternating linearization method for nonconvex optimization problems
- Symmetric rank-1 approximation of symmetric high-order tensors
- On the minimization over sparse symmetric sets: projections, optimality conditions, and algorithms
- Novel Proximal Gradient Methods for Nonnegative Matrix Factorization with Sparsity Constraints
- The \(\ell_{2,q}\) regularized group sparse optimization: lower bound theory, recovery bound and algorithms
- On accelerating the regularized alternating least-squares algorithm for tensors
- Convergence of ADMM for multi-block nonconvex separable optimization models
- A new proximal iterative hard thresholding method with extrapolation for \(\ell _0\) minimization
- Convergence of alternating direction method for minimizing sum of two nonconvex functions with linear constraints
- On the Global Convergence of Randomized Coordinate Gradient Descent for Nonconvex Optimization
- Random Coordinate Descent Methods for Nonseparable Composite Optimization
- Alternating direction method of multipliers for a class of nonconvex bilinear optimization: convergence analysis and applications
- Approximation of the Mumford–Shah functional by phase fields of bounded variation
- An extended proximal ADMM algorithm for three-block nonconvex optimization problems
- Computing B-Stationary Points of Nonsmooth DC Programs
- An introduction to continuous optimization for imaging
- Nonnegative Matrix Factorization Via Archetypal Analysis
- Convergence of iterative hard-thresholding algorithm with continuation
- An iterative support shrinking algorithm for non-Lipschitz optimization in image restoration
- Block delayed Majorize-Minimize subspace algorithm for large scale image restoration *
- Alternating Direction Method of Multipliers for a Class of Nonconvex and Nonsmooth Problems with Applications to Background/Foreground Extraction
- Alternating Proximal Regularized Dictionary Learning
- The PRIMPING routine -- tiling through proximal alternating linearized minimization
- GAITA: a Gauss-Seidel iterative thresholding algorithm for \(\ell_q\) regularized least squares regression
- A Stochastic Proximal Alternating Minimization for Nonsmooth and Nonconvex Optimization
- Title not available (Why is that?)
- Nonconvex flexible sparsity regularization: theory and monotone numerical schemes
- Subspace clustering by \((k,k)\)-sparse matrix factorization
- Composite Optimization by Nonconvex Majorization-Minimization
- Efficient Numerical Methods for Computing the Stationary States of Phase Field Crystal Models
- 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
- Nonconvex Lagrangian-Based Optimization: Monitoring Schemes and Global Convergence
- Learning low-complexity autoregressive models via proximal alternating minimization
- On Algorithms for Difference of Monotone Operators
- On Algorithms for Difference of Monotone Operators
- A second-order dynamical approach with variable damping to nonconvex smooth minimization
- A combined higher order non-convex total variation with overlapping group sparsity for Poisson noise removal
- A penalty method for rank minimization problems in symmetric matrices
- Alternating direction method of multipliers for nonconvex log total variation image restoration
- First-order algorithms for convex optimization with nonseparable objective and coupled constraints
- Accelerating the DC algorithm for smooth functions
- An alternating trust region algorithm for distributed linearly constrained nonlinear programs, application to the optimal power flow problem
- A simple globally convergent algorithm for the nonsmooth nonconvex single source localization problem
- Approaching nonsmooth nonconvex minimization through second-order proximal-gradient dynamical systems
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)
