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)
- An inexact PAM method for computing Wasserstein barycenter with unknown supports
- A cubic spline penalty for sparse approximation under tight frame balanced model
- A penalty PALM method for sparse portfolio selection problems
- Convergence rate analysis of an extrapolated proximal difference-of-convex algorithm
- The proximal alternating direction method of multipliers in the nonconvex setting: convergence analysis and rates
- Learning low-complexity autoregressive models via proximal alternating minimization
- An extrapolated iteratively reweighted \(\ell_1\) method with complexity analysis
- Interactive video colorization within a variational framework
- Alternating structure-adapted proximal gradient descent for nonconvex nonsmooth block-regularized problems
- Two-Phase Image Segmentation by Nonconvex Nonsmooth Models with Convergent Alternating Minimization Algorithms
- Inertial alternating generalized forward-backward splitting for image colorization
- Globally convergent Jacobi-type algorithms for simultaneous orthogonal symmetric tensor diagonalization
- First-order methods almost always avoid strict saddle points
- Forward-backward envelope for the sum of two nonconvex functions: further properties and nonmonotone linesearch algorithms
- Fast optimization via inertial dynamics with closed-loop damping
- Composite difference-MAX programs for modern statistical estimation problems
- Proximal Gradient Methods for Machine Learning and Imaging
- A combined higher order non-convex total variation with overlapping group sparsity for Poisson noise removal
- A proximal difference-of-convex algorithm with extrapolation
- An ADMM-based SQP method for separably smooth nonconvex optimization
- Convergence and rate analysis of a proximal linearized ADMM for nonconvex nonsmooth optimization
- Kurdyka-Łojasiewicz property of zero-norm composite functions
- An alternating trust region algorithm for distributed linearly constrained nonlinear programs, application to the optimal power flow problem
- A non-smooth and non-convex regularization method for limited-angle CT image reconstruction
- An inexact proximal gradient algorithm with extrapolation for a class of nonconvex nonsmooth optimization problems
- Linear convergence of inexact descent method and inexact proximal gradient algorithms for lower-order regularization problems
- Inertial proximal gradient methods with Bregman regularization for a class of nonconvex optimization problems
- On complexity and convergence of high-order coordinate descent algorithms for smooth nonconvex box-constrained minimization
- Nonconvex-TV based image restoration with impulse noise removal
- Non-Lipschitz models for image restoration with impulse noise removal
- Sharpness, restart, and acceleration
- On \(\ell_p\)-support vector machines and multidimensional kernels
- Convex optimization approach to signals with fast varying instantaneous frequency
- Nonisometric surface registration via conformal Laplace-Beltrami basis pursuit
- A proximal DC approach for quadratic assignment problem
- An alternating linearization bundle method for a class of nonconvex optimization problem with inexact information
- Effective two-stage image segmentation: a new non-Lipschitz decomposition approach with convergent algorithm
- Algorithms for nonnegative matrix factorization with the Kullback-Leibler divergence
- Convergence analysis of the generalized splitting methods for a class of nonconvex optimization problems
- A Gauss-Seidel type inertial proximal alternating linearized minimization for a class of nonconvex optimization problems
- An augmented Lagrangian proximal alternating method for sparse discrete optimization problems
- Optimization problems involving group sparsity terms
- A variational proximal alternating linearized minimization in a given metric for limited-angle CT image reconstruction
- Block-proximal methods with spatially adapted acceleration
- A gradient-type algorithm with backward inertial steps associated to a nonconvex minimization problem
- Non-smooth non-convex Bregman minimization: unification and new algorithms
- Image reconstruction by minimizing curvatures on image surface
- A continuous relaxation of the constrained \(\ell_2-\ell_0\) problem
- Inertial proximal alternating minimization for nonconvex and nonsmooth problems
- Conservative set valued fields, automatic differentiation, stochastic gradient methods and deep learning
- Iteratively reweighted \(\ell _1\) algorithms with extrapolation
- A refined convergence analysis of \(\mathrm{pDCA}_{e}\) with applications to simultaneous sparse recovery and outlier detection
- Enhanced proximal DC algorithms with extrapolation for a class of structured nonsmooth DC minimization
- Capped \(\ell_p\) approximations for the composite \(\ell_0\) regularization problem
- A Symmetric Alternating Direction Method of Multipliers for Separable Nonconvex Minimization Problems
- Convergence of the forward-backward algorithm: beyond the worst-case with the help of geometry
- Convergence rate analysis of proximal iteratively reweighted \(\ell_1\) methods for \(\ell_p\) regularization problems
- New analysis of linear convergence of gradient-type methods via unifying error bound conditions
- Serial and parallel approaches for image segmentation by numerical minimization of a second-order functional
- A Scale-Invariant Approach for Sparse Signal Recovery
- Convergence analysis of a proximal point algorithm for minimizing differences of functions
- A block coordinate variable metric linesearch based proximal gradient method
- Toward fast transform learning
- Blind image fusion for hyperspectral imaging with the directional total variation
- Modern regularization methods for inverse problems
- Alternating DC algorithm for partial DC programming problems
- A nonconvex ADMM for a class of sparse inverse semidefinite quadratic programming problems
- Data Driven Tight Frame for Compressed Sensing MRI Reconstruction via Off-the-Grid Regularization
- An Augmented Lagrangian Method for $\ell_{1}$-Regularized Optimization Problems with Orthogonality Constraints
- Analysis and algorithms for some compressed sensing models based on L1/L2 minimization
- A forward-backward algorithm with different inertial terms for structured non-convex minimization problems
- Parallelizable Algorithms for Optimization Problems with Orthogonality Constraints
- A globally convergent algorithm for a class of gradient compounded non-Lipschitz models applied to non-additive noise removal
- 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
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)
