Proximal alternating linearized minimization for nonconvex and nonsmooth problems

From MaRDI portal

Publication:403666

Jump to:navigation, search

DOI10.1007/s10107-013-0701-9zbMath1297.90125MaRDI QIDQ403666

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

zbMATH Keywords

Gauss-Seidel method; block coordinate descent; alternating minimization; Kurdyka-Łojasiewicz property; nonconvex-nonsmooth minimization; proximal forward-backward; sparse nonnegative matrix factorization

Mathematics Subject Classification ID

90C26: Nonconvex programming, global optimization

90C30: Nonlinear programming

65K10: Numerical optimization and variational techniques

47J25: Iterative procedures involving nonlinear operators

49M37: Numerical methods based on nonlinear programming

49M27: Decomposition methods

Related Items

Sparse Principal Component Analysis via Variable Projection, Half-linear regularization for nonconvex image restoration models, Wavelet inpainting with the \(\ell_{0}\) sparse regularization, An inertial forward-backward algorithm for the minimization of the sum of two nonconvex functions, On the rate of convergence of the proximal alternating linearized minimization algorithm for convex problems, Error bounds and stability in the \(\ell_0\) regularized for CT reconstruction from small projections, Iteration complexity analysis of multi-block ADMM for a family of convex minimization without strong convexity, An inertial Tseng's type proximal algorithm for nonsmooth and nonconvex optimization problems, A new alternating direction method for linearly constrained nonconvex optimization problems, GAITA: a Gauss-Seidel iterative thresholding algorithm for \(\ell_q\) regularized least squares regression, Convergence of iterative hard-thresholding algorithm with continuation, Subspace clustering by \((k,k)\)-sparse matrix factorization, Smoothing partial exact penalty splitting method for mathematical programs with equilibrium constraints, Alternating direction method of multipliers for a class of nonconvex bilinear optimization: convergence analysis and applications, A convergent relaxation of the Douglas-Rachford algorithm, Alternating direction method of multipliers with difference of convex functions, 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})\), The \(\ell_{2,q}\) regularized group sparse optimization: lower bound theory, recovery bound and algorithms, 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, 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, A penalty method for rank minimization problems in symmetric matrices, A convergent least-squares regularized blind deconvolution approach, Local convergence of the heavy-ball method and iPiano for non-convex optimization, 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, Existence and convergence analysis of \(\ell_{0}\) and \(\ell_{2}\) regularizations for limited-angle CT reconstruction, From error bounds to the complexity of first-order descent methods for convex functions, Global convergence of proximal iteratively reweighted algorithm, Precompact convergence of the nonconvex primal-dual hybrid gradient algorithm, A globally convergent algorithm for nonconvex optimization based on block coordinate update, A simple globally convergent algorithm for the nonsmooth nonconvex single source localization problem, Convergence of ADMM for multi-block nonconvex separable optimization models, Regularized non-local total variation and application in image restoration, Dual block-coordinate forward-backward algorithm with application to deconvolution and deinterlacing of video sequences, Extragradient method in optimization: convergence and complexity, First-order algorithms for convex optimization with nonseparable objective and coupled constraints, The value function approach to convergence analysis in composite optimization, A new nonconvex approach to low-rank matrix completion with application to image inpainting, An iterative support shrinking algorithm for non-Lipschitz optimization in image restoration, Extended ADMM and BCD for nonseparable convex minimization models with quadratic coupling terms: convergence analysis and insights, Learning low-complexity autoregressive models via proximal alternating minimization, Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis, The PRIMPING routine -- tiling through proximal alternating linearized minimization, On accelerating the regularized alternating least-squares algorithm for tensors, A proximal difference-of-convex algorithm with extrapolation, Accelerating the DC algorithm for smooth functions, A non-smooth and non-convex regularization method for limited-angle CT image reconstruction, Capped \(\ell_p\) approximations for the composite \(\ell_0\) regularization problem, A block coordinate variable metric linesearch based proximal gradient method, Toward fast transform learning, An inexact PAM method for computing Wasserstein barycenter with unknown supports, A partially proximal linearized alternating minimization method for finding Dantzig selectors, A cubic spline penalty for sparse approximation under tight frame balanced model, Approaching nonsmooth nonconvex minimization through second-order proximal-gradient dynamical systems, Inertial alternating generalized forward-backward splitting for image colorization, Fast rank-one alternating minimization algorithm for phase retrieval, A new globally convergent algorithm for non-Lipschitz \(\ell_{p}-\ell_q\) minimization, 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, Kurdyka-Łojasiewicz property of zero-norm composite functions, 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, Image reconstruction by minimizing curvatures on image surface, A continuous relaxation of the constrained \(\ell_2-\ell_0\) problem, Conservative set valued fields, automatic differentiation, stochastic gradient methods and deep learning, An extended proximal ADMM algorithm for three-block nonconvex optimization problems, Multi-block Bregman proximal alternating linearized minimization and its application to orthogonal nonnegative matrix factorization, Proximal-like incremental aggregated gradient method with Bregman distance in weakly convex optimization problems, A block inertial Bregman proximal algorithm for nonsmooth nonconvex problems with application to symmetric nonnegative matrix tri-factorization, Incremental without replacement sampling in nonconvex optimization, A preconditioned difference of convex algorithm for truncated quadratic regularization with application to imaging, Quick-means: accelerating inference for K-means by learning fast transforms, Shifted eigenvalue decomposition method for computing C-eigenvalues of a piezoelectric-type tensor, BROCCOLI: overlapping and outlier-robust biclustering through proximal stochastic gradient descent, An inexact proximal gradient algorithm with extrapolation for a class of nonconvex nonsmooth optimization problems, An ADMM-based SQP method for separably smooth nonconvex optimization, A proximal point like method for solving tensor least-squares problems, Variational analysis perspective on linear convergence of some first order methods for nonsmooth convex optimization problems, PCA reduced Gaussian mixture models with applications in superresolution, Proximal gradient method for nonconvex and nonsmooth optimization on Hadamard manifolds, An inertial proximal partially symmetric ADMM-based algorithm for linearly constrained multi-block nonconvex optimization problems with applications, On the geometric analysis of a quartic-quadratic optimization problem under a spherical constraint, On complexity and convergence of high-order coordinate descent algorithms for smooth nonconvex box-constrained minimization, Convergence and rate analysis of a proximal linearized ADMM for nonconvex nonsmooth optimization, Two-step inertial Bregman alternating minimization algorithm for nonconvex and nonsmooth problems, Convergence properties of monotone and nonmonotone proximal gradient methods revisited, Several accelerated subspace minimization conjugate gradient methods based on regularization model and convergence rate analysis for nonconvex problems, The \(\ell_{2,p}\) regularized total variation with overlapping group sparsity prior for image restoration with impulse noise, Tensor completion via a generalized transformed tensor t-product decomposition without t-SVD, Multi-dimensional image recovery via fully-connected tensor network decomposition under the learnable transforms, Nonlinear matrix recovery using optimization on the Grassmann manifold, Solving blind ptychography effectively via linearized alternating direction method of multipliers, Unnamed Item, Efficiency of higher-order algorithms for minimizing composite functions, Inertial Proximal Block Coordinate Method for a Class of Nonsmooth Sum-of-Ratios Optimization Problems, Convergence of a Class of Nonmonotone Descent Methods for Kurdyka–Łojasiewicz Optimization Problems, On the Global Convergence of Randomized Coordinate Gradient Descent for Nonconvex Optimization, A refined inertial DC algorithm for DC programming, A cascading l0 regularization reconstruction method in nonsubsampled contourlet domain for limited-angle CT, An accelerated proximal algorithm for regularized nonconvex and nonsmooth bi-level optimization, Convergence of Random Reshuffling under the Kurdyka–Łojasiewicz Inequality, A local MM subspace method for solving constrained variational problems in image recovery, Conservative parametric optimality and the ridge method for tame min-max problems, A forward-backward algorithm with different inertial terms for structured non-convex minimization problems, An extrapolated proximal iteratively reweighted method for nonconvex composite optimization problems, Saturation-value based higher-order regularization for color image restoration, An alternating structure-adapted Bregman proximal gradient descent algorithm for constrained nonconvex nonsmooth optimization problems and its inertial variant, Calculus rules of the generalized concave Kurdyka-Łojasiewicz property, A DCA-Newton method for quartic minimization over the sphere, A Learnable Group-Tube Transform Induced Tensor Nuclear Norm and Its Application for Tensor Completion, Fast optimization via inertial dynamics with closed-loop damping, Random Coordinate Descent Methods for Nonseparable Composite Optimization, Proximal gradient method with extrapolation and line search for a class of non-convex and non-smooth problems, Scaled proximal gradient methods for sparse optimization problems, A Fast Minimization Algorithm for the Euler Elastica Model Based on a Bilinear Decomposition, Template-based image reconstruction facing different topologies, Analysis of a variable metric block coordinate method under proximal errors, An accelerated forward-backward-half forward splitting algorithm for monotone inclusion with applications to image restoration, Proximal stochastic recursive momentum algorithm for nonsmooth nonconvex optimization problems, An iDCA with sieving strategy for PDE-constrained optimization problems with \(L^{1-2}\)-control cost, Convergence Rate Analysis of a Dykstra-Type Projection Algorithm, A Path-Based Approach to Constrained Sparse Optimization, A structure noise-aware tensor dictionary learning method for high-dimensional data clustering, Avoiding bad steps in Frank-Wolfe variants, Inertial accelerated SGD algorithms for solving large-scale lower-rank tensor CP decomposition problems, Perturbation techniques for convergence analysis of proximal gradient method and other first-order algorithms via variational analysis, A fixed-point proximity algorithm for recovering low-rank components from incomplete observation data with application to motion capture data refinement, Additive Schwarz methods for convex optimization with backtracking, Alternating DC algorithm for partial DC programming problems, Block-coordinate and incremental aggregated proximal gradient methods for nonsmooth nonconvex problems, A survey on some recent developments of alternating direction method of multipliers, A dynamic alternating direction of multipliers for nonconvex minimization with nonlinear functional equality constraints, A combined higher order non-convex total variation with overlapping group sparsity for Poisson noise removal, Douglas-Rachford splitting and ADMM for nonconvex optimization: accelerated and Newton-type linesearch algorithms, Malitsky-Tam forward-reflected-backward splitting method for nonconvex minimization problems, An inertial Bregman generalized alternating direction method of multipliers for nonconvex optimization, A fast proximal iteratively reweighted nuclear norm algorithm for nonconvex low-rank matrix minimization problems, Inertial stochastic PALM and applications in machine learning, Moreau envelope augmented Lagrangian method for nonconvex optimization with linear constraints, An inexact proximal DC algorithm with sieving strategy for rank constrained least squares semidefinite programming, Tensor completion via fully-connected tensor network decomposition with regularized factors, A geometric proximal gradient method for sparse least squares regression with probabilistic simplex constraint, Riemannian proximal gradient methods, Global convergence of model function based Bregman proximal minimization algorithms, A generalized proximal linearized algorithm for DC functions with application to the optimal size of the firm problem, Stability of minimization problems and the error bound condition, Kurdyka-Łojasiewicz exponent via inf-projection, Nonlinear transform induced tensor nuclear norm for tensor completion, Inertial alternating direction method of multipliers for non-convex non-smooth optimization, Non-convex split Feasibility problems: models, algorithms and theory, Estimating shape parameters of piecewise linear-quadratic problems, A globally convergent algorithm for a constrained non-Lipschitz image restoration model, Semi-blind image deblurring by a proximal alternating minimization method with convergence guarantees, Separating variables to accelerate non-convex regularized optimization, A gradient-type algorithm with backward inertial steps associated to a nonconvex minimization problem, A sparse rank-1 approximation algorithm for high-order tensors, 3D fluid flow estimation with integrated particle reconstruction, Subspace learning by \(\ell^0\)-induced sparsity, Phase retrieval: a data-driven wavelet frame based approach, A proximal interior point algorithm with applications to image processing, Multi-view cluster analysis with incomplete data to understand treatment effects, Variational models for color image correction inspired by visual perception and neuroscience, Robust principal component analysis using facial reduction, Nonconvex optimization for robust tensor completion from grossly sparse observations, Nonsmooth optimization using Taylor-like models: error bounds, convergence, and termination criteria, Bregman reweighted alternating minimization and its application to image deblurring, An incremental aggregated proximal ADMM for linearly constrained nonconvex optimization with application to sparse logistic regression problems, Optimality condition and quasi-conjugate duality with zero gap in nonconvex optimization, On the superiority of PGMs to PDCAs in nonsmooth nonconvex sparse regression, Multi-block nonconvex nonsmooth proximal ADMM: convergence and rates under Kurdyka-Łojasiewicz property, Convergence rates for an inertial algorithm of gradient type associated to a smooth non-convex minimization, An efficient non-convex total variation approach for image deblurring and denoising, Novel DCA based algorithms for a special class of nonconvex problems with application in machine learning, Sparsity reconstruction using nonconvex TGpV-shearlet regularization and constrained projection, Nonconvex proximal incremental aggregated gradient method with linear convergence, Convergence analysis of the generalized splitting methods for a class of nonconvex optimization problems, A non-Euclidean gradient descent method with sketching for unconstrained matrix minimization, Multiplicative noise removal via using nonconvex regularizers based on total variation and wavelet frame, New analysis of linear convergence of gradient-type methods via unifying error bound conditions, An augmented Lagrangian proximal alternating method for sparse discrete optimization problems, Bregman proximal mappings and Bregman-Moreau envelopes under relative prox-regularity, A variational proximal alternating linearized minimization in a given metric for limited-angle CT image reconstruction, An inexact augmented Lagrangian method for computing strongly orthogonal decompositions of tensors, A hybrid Bregman alternating direction method of multipliers for the linearly constrained difference-of-convex problems, A Gauss-Seidel type inertial proximal alternating linearized minimization for a class of nonconvex optimization problems, The modified second APG method for DC optimization problems, A new proximal iterative hard thresholding method with extrapolation for \(\ell _0\) minimization, Using Landweber iteration to quantify source conditions -- a numerical study, Optimal multivariate Gaussian fitting with applications to PSF modeling in two-photon microscopy imaging, Block-proximal methods with spatially adapted acceleration, Optimization problems involving group sparsity terms, A general double-proximal gradient algorithm for d.c. programming, CUSTOM: a calibration region recovery approach for highly subsampled dynamic parallel magnetic resonance imaging, Forward-backward quasi-Newton methods for nonsmooth optimization problems, Feasible methods for nonconvex nonsmooth problems with applications in green communications, Nonconvex and nonsmooth optimization with generalized orthogonality constraints: an approximate augmented Lagrangian method, Inertial proximal alternating minimization for nonconvex and nonsmooth problems, Wavelet tight frame and prior image-based image reconstruction from limited-angle projection data, Backward-forward algorithms for structured monotone inclusions in Hilbert spaces, Convex optimization approach to signals with fast varying instantaneous frequency, An alternating trust region algorithm for distributed linearly constrained nonlinear programs, application to the optimal power flow problem, Alternating direction method of multipliers for nonconvex fused regression problems, A refined convergence analysis of \(\mathrm{pDCA}_{e}\) with applications to simultaneous sparse recovery and outlier detection, General inertial proximal gradient method for a class of nonconvex nonsmooth optimization problems, Iteratively reweighted \(\ell _1\) algorithms with extrapolation, A nonconvex model with minimax concave penalty for image restoration, Non-smooth non-convex Bregman minimization: unification and new algorithms, Serial and parallel approaches for image segmentation by numerical minimization of a second-order functional, First-order methods almost always avoid strict saddle points, Enhanced proximal DC algorithms with extrapolation for a class of structured nonsmooth DC minimization, Misspecified nonconvex statistical optimization for sparse phase retrieval, Robust low transformed multi-rank tensor methods for image alignment, Convergence and stability analysis of the half thresholding based few-view CT reconstruction, New convergence results for the inexact variable metric forward-backward method, A forward-backward dynamical approach for nonsmooth problems with block structure coupled by a smooth function, An approximation method of CP rank for third-order tensor completion, Proximal gradient methods for general smooth graph total variation model in unsupervised learning, Proximal linearization methods for Schatten \(p\)-quasi-norm minimization, A generalized forward-backward splitting operator: degenerate analysis and applications, An exact penalty approach for optimization with nonnegative orthogonality constraints, 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, Revisiting the approximate Carathéodory problem via the Frank-Wolfe algorithm, Unnamed Item, Unnamed Item, Unnamed Item, A Scale-Invariant Approach for Sparse Signal Recovery, On the Convergence to Stationary Points of Deterministic and Randomized Feasible Descent Directions Methods, Douglas--Rachford Splitting and ADMM for Nonconvex Optimization: Tight Convergence Results, Proximal Gradient Method for Nonsmooth Optimization over the Stiefel Manifold, Sharpness, Restart, and Acceleration, Symmetric rank-1 approximation of symmetric high-order tensors, A second-order dynamical approach with variable damping to nonconvex smooth minimization, RECENT ADVANCES IN DOMAIN DECOMPOSITION METHODS FOR TOTAL VARIATION MINIMIZATION, Nonconvex Lagrangian-Based Optimization: Monitoring Schemes and Global Convergence, Greedy approximate projection for magnetic resonance fingerprinting with partial volumes, The Boosted Difference of Convex Functions Algorithm for Nonsmooth Functions, Adaptive Low-Nonnegative-Rank Approximation for State Aggregation of Markov Chains, Composite Optimization by Nonconvex Majorization-Minimization, Modern regularization methods for inverse problems, Parallelizable Algorithms for Optimization Problems with Orthogonality Constraints, A Proximal Minimization Algorithm for Structured Nonconvex and Nonsmooth Problems, Alternating Structure-Adapted Proximal Gradient Descent for Nonconvex Nonsmooth Block-Regularized Problems, An Inertial Newton Algorithm for Deep Learning, Variational Image Regularization with Euler's Elastica Using a Discrete Gradient Scheme, Scalable Bayesian Uncertainty Quantification in Imaging Inverse Problems via Convex Optimization, Blind Ptychographic Phase Retrieval via Convergent Alternating Direction Method of Multipliers, Non-Lipschitz Models for Image Restoration with Impulse Noise Removal, Matrix completion via minimizing an approximate rank, Proximal Heterogeneous Block Implicit-Explicit Method and Application to Blind Ptychographic Diffraction Imaging, Luminance-Chrominance Model for Image Colorization, Alternating Direction Method of Multipliers for a Class of Nonconvex and Nonsmooth Problems with Applications to Background/Foreground Extraction, A penalty PALM method for sparse portfolio selection problems, Convergence Analysis of Douglas--Rachford Splitting Method for “Strongly + Weakly” Convex Programming, Convergence guarantees for a class of non-convex and non-smooth optimization problems, Regularization of inverse problems via time discrete geodesics in image spaces, Rayleigh quotient minimization for absolutely one-homogeneous functionals, Alternating Proximal Regularized Dictionary Learning, A nonconvex ADMM for a class of sparse inverse semidefinite quadratic programming problems, Stochastic Quasi-Fejér Block-Coordinate Fixed Point Iterations with Random Sweeping, An introduction to continuous optimization for imaging, On Algorithms for Difference of Monotone Operators, On Algorithms for Difference of Monotone Operators, A Bregman Forward-Backward Linesearch Algorithm for Nonconvex Composite Optimization: Superlinear Convergence to Nonisolated Local Minima, Nonlocal robust tensor recovery with nonconvex regularization ^*, Approximation of the Mumford–Shah functional by phase fields of bounded variation, Choose Your Path Wisely: Gradient Descent in a Bregman Distance Framework, An Inexact Semismooth Newton Method on Riemannian Manifolds with Application to Duality-Based Total Variation Denoising, Efficient Boosted DC Algorithm for Nonconvex Image Restoration with Rician Noise, Robust Tensor Completion: Equivalent Surrogates, Error Bounds, and Algorithms, An Orthogonalization-Free Parallelizable Framework for All-Electron Calculations in Density Functional Theory, Embedding of a homothete in a convex compactum: an algorithm and its convergence, Extrapolated Proximal Subgradient Algorithms for Nonconvex and Nonsmooth Fractional Programs, Bregman Finito/MISO for Nonconvex Regularized Finite Sum Minimization without Lipschitz Gradient Continuity, The Exact Modulus of the Generalized Concave Kurdyka-Łojasiewicz Property, Two-Phase Image Segmentation by Nonconvex Nonsmooth Models with Convergent Alternating Minimization Algorithms, Block delayed Majorize-Minimize subspace algorithm for large scale image restoration ^*, An Optimized Dynamic Mode Decomposition Model Robust to Multiplicative Noise, A combined dictionary learning and TV model for image restoration with convergence analysis, Solving sparse principal component analysis with global support, Linear convergence of an alternating polar decomposition method for low rank orthogonal tensor approximations, Half-quadratic alternating direction method of multipliers for robust orthogonal tensor approximation, A converged deep graph semi-NMF algorithm for learning data representation, On an iteratively reweighted linesearch based algorithm for nonconvex composite optimization, New Bregman proximal type algoritms for solving DC optimization problems, An extrapolated iteratively reweighted \(\ell_1\) method with complexity analysis, Robust sensing of low-rank matrices with non-orthogonal sparse decomposition, Zero-norm regularized problems: equivalent surrogates, proximal MM method and statistical error bound, Global convergence of the gradient method for functions definable in o-minimal structures, Nonconvex optimization with inertial proximal stochastic variance reduction gradient, Low-rank matrix recovery problem minimizing a new ratio of two norms approximating the rank function then using an ADMM-type solver with applications, An Unrolled Implicit Regularization Network for Joint Image and Sensitivity Estimation in Parallel MR Imaging with Convergence Guarantee, Some accelerated alternating proximal gradient algorithms for a class of nonconvex nonsmooth problems, Convergence of the Momentum Method for Semialgebraic Functions with Locally Lipschitz Gradients, Convergence Analysis of the Proximal Gradient Method in the Presence of the Kurdyka–Łojasiewicz Property Without Global Lipschitz Assumptions, The convergence properties of infeasible inexact proximal alternating linearized minimization, A Bregman stochastic method for nonconvex nonsmooth problem beyond global Lipschitz gradient continuity, A branch and bound method solving the max–min linear discriminant analysis problem, Fully-connected tensor network decomposition for robust tensor completion problem, Convergence analysis of an improved Bregman-type Peaceman-Rachford splitting algorithm for nonconvex nonseparable linearly constrained optimization problems, A Bregman-style partially symmetric alternating direction method of multipliers for nonconvex multi-block optimization, Spurious Valleys, NP-Hardness, and Tractability of Sparse Matrix Factorization with Fixed Support, Study on \(L_1\) over \(L_2\) Minimization for nonnegative signal recovery, A Bayesian-variational cyclic method for solving estimation problems characterized by non-uniqueness (equifinality), A new Lagrangian-based first-order method for nonconvex constrained optimization, A generalized inertial proximal alternating linearized minimization method for nonconvex nonsmooth problems, A semismooth Newton based augmented Lagrangian method for nonsmooth optimization on matrix manifolds, Joint Reconstruction-Segmentation on Graphs, Impulse noise removal by using a nonconvex TGV regularizer and nonconvex fidelity, A framelet sparse reconstruction method for pansharpening with guaranteed convergence, A Regularized Newton Method for \({\boldsymbol{\ell}}_{q}\) -Norm Composite Optimization Problems, Tensor factorization via transformed tensor-tensor product for image alignment, A generalized non-convex method for robust tensor completion, An \(l_0\)-norm based color image deblurring model under mixed random-valued impulse and Gaussian noise, Convergence rate analysis of an extrapolated proximal difference-of-convex algorithm, An inertial alternating minimization with Bregman distance for a class of nonconvex and nonsmooth problems, Nested alternating minimization with FISTA for non-convex and non-smooth optimization problems, A class of modified accelerated proximal gradient methods for nonsmooth and nonconvex minimization problems, Convergence of Bregman Peaceman-Rachford splitting method for nonconvex nonseparable optimization, The low-rank approximation of fourth-order partial-symmetric and conjugate partial-symmetric tensor, A singular value shrinkage thresholding algorithm for folded concave penalized low-rank matrix optimization problems, Regularising inverse problems with generative machine learning models, A forward-backward dynamical approach to the minimization of the sum of a nonsmooth convex with a smooth nonconvex function, Composite Difference-Max Programs for Modern Statistical Estimation Problems, A Nonmonotone Alternating Updating Method for a Class of Matrix Factorization Problems, PET-MRI joint reconstruction with common edge weighted total variation regularization, Globally Solving the Trust Region Subproblem Using Simple First-Order Methods, First Order Methods Beyond Convexity and Lipschitz Gradient Continuity with Applications to Quadratic Inverse Problems, Projecting onto the Intersection of a Cone and a Sphere, Forward-Backward Envelope for the Sum of Two Nonconvex Functions: Further Properties and Nonmonotone Linesearch Algorithms, A Symmetric Alternating Direction Method of Multipliers for Separable Nonconvex Minimization Problems, Proximal Mapping for Symmetric Penalty and Sparsity, Unifying Abstract Inexact Convergence Theorems and Block Coordinate Variable Metric iPiano, Non-convex clustering via proximal alternating linearized minimization method, Blind image fusion for hyperspectral imaging with the directional total variation, RSG: Beating Subgradient Method without Smoothness and Strong Convexity, Estimation of Graphical Models through Structured Norm Minimization, On the convergence of higher-order orthogonal iteration, Variational Phase Retrieval with Globally Convergent Preconditioned Proximal Algorithm, Coherence Retrieval Using Trace Regularization, Interactive Video Colorization Within a Variational Framework, PET-MRI Joint Reconstruction by Joint Sparsity Based Tight Frame Regularization, Blind Source Separation with Outliers in Transformed Domains, On Collaborative Compressive Sensing Systems: The Framework, Design, and Algorithm, A remark on accelerated block coordinate descent for computing the proximity operators of a sum of convex functions, Sparsity promoting regularization for effective noise suppression in SPECT image reconstruction, Convergence of alternating direction method for minimizing sum of two nonconvex functions with linear constraints, Sequence Convergence of Inexact Nonconvex and Nonsmooth Algorithms with More Realistic Assumptions, Variable Metric Forward-Backward Algorithm for Composite Minimization Problems, Analysis and Algorithms for Some Compressed Sensing Models Based on L1/L2 Minimization, Overlapping Domain Decomposition Methods for Ptychographic Imaging, Incremental CP Tensor Decomposition by Alternating Minimization Method, On a general smoothly truncated regularization for variational piecewise constant image restoration: construction and convergent algorithms, A stochastic alternating direction method of multipliers for non-smooth and non-convex optimization, A Three-Operator Splitting Algorithm for Nonconvex Sparsity Regularization, Convergence Rate Analysis of a Sequential Convex Programming Method with Line Search for a Class of Constrained Difference-of-Convex Optimization Problems, Continuous-domain assignment flows, An accelerated majorization-minimization algorithm with convergence guarantee for non-Lipschitz wavelet synthesis model ^*, A Stochastic Proximal Alternating Minimization for Nonsmooth and Nonconvex Optimization, Optimization on Spheres: Models and Proximal Algorithms with Computational Performance Comparisons, Proximal Gradient Methods for Machine Learning and Imaging, Block Bregman Majorization Minimization with Extrapolation, Convex-Concave Backtracking for Inertial Bregman Proximal Gradient Algorithms in Nonconvex Optimization, Finding zeros of Hölder metrically subregular mappings via globally convergent Levenberg–Marquardt methods, A Spatial Color Compensation Model Using Saturation-Value Total Variation, A General Non-Lipschitz Infimal Convolution Regularized Model: Lower Bound Theory and Algorithm, ADJUST: a dictionary-based joint reconstruction and unmixing method for spectral tomography, On $\ell_p$-Support Vector Machines and Multidimensional Kernels, A Columnwise Update Algorithm for Sparse Stochastic Matrix Factorization, Revisiting linearized Bregman iterations under Lipschitz-like convexity condition, A semi-alternating algorithm for solving nonconvex split equality problems, A new nonlocal low-rank regularization method with applications to magnetic resonance image denoising, Nonconvex flexible sparsity regularization: theory and monotone numerical schemes, Data-Driven Tight Frame Construction for Impulsive Noise Removal, A Proximal Quasi-Newton Trust-Region Method for Nonsmooth Regularized Optimization, Column $\ell_{2,0}$-Norm Regularized Factorization Model of Low-Rank Matrix Recovery and Its Computation, A New Boosted Proximal Point Algorithm for Minimizing Nonsmooth DC Functions, Trimmed Statistical Estimation via Variance Reduction, Novel Proximal Gradient Methods for Nonnegative Matrix Factorization with Sparsity Constraints, Analysis of the Block Coordinate Descent Method for Linear Ill-Posed Problems, A Subgradient-Based Approach for Finding the Maximum Feasible Subsystem with Respect to a Set, The Proximal Alternating Direction Method of Multipliers in the Nonconvex Setting: Convergence Analysis and Rates, Relax-and-split method for nonconvex inverse problems, Nonnegative Matrix Factorization Via Archetypal Analysis, Convergence of Inexact Forward--Backward Algorithms Using the Forward--Backward Envelope, Zero norm based analysis model for image smoothing and reconstruction, Data Driven Tight Frame for Compressed Sensing MRI Reconstruction via Off-the-Grid Regularization, Multiplicative Noise Removal: Nonlocal Low-Rank Model and Its Proximal Alternating Reweighted Minimization Algorithm, The Epsilon-Alternating Least Squares for Orthogonal Low-Rank Tensor Approximation and Its Global Convergence, Efficient Numerical Methods for Computing the Stationary States of Phase Field Crystal Models, Convergence and Dynamical Behavior of the ADAM Algorithm for Nonconvex Stochastic Optimization, A globally convergent algorithm for a class of gradient compounded non-Lipschitz models applied to non-additive noise removal, Convergence analysis of an ALF-based nonconvex splitting algorithm with SQP structure, Alternating direction method of multipliers for nonconvex log total variation image restoration, Retraction-based first-order feasible methods for difference-of-convex programs with smooth inequality and simple geometric constraints, The partially symmetric rank-1 approximation of fourth-order partially symmetric tensors, An abstract convergence framework with application to inertial inexact forward-backward methods, A global exact penalty for rank-constrained optimization problem and applications, A two-level distributed algorithm for nonconvex constrained optimization, Nonconvex model for mixing noise with fractional-order regularization, Proximal gradient algorithm for nonconvex low tubal rank tensor recovery, Sparse estimation: an MMSE approach, An inexact Riemannian proximal gradient method, An alternative extrapolation scheme of PDHGM for saddle point problem with nonlinear function, Energy Minimization Methods, On the Minimization Over Sparse Symmetric Sets: Projections, Optimality Conditions, and Algorithms, Majorization-Minimization Procedures and Convergence of SQP Methods for Semi-Algebraic and Tame Programs, Computational Methods for Solving Nonconvex Block-Separable Constrained Quadratic Problems, An Alternating Semiproximal Method for Nonconvex Regularized Structured Total Least Squares Problems, Constraint matrix factorization for space variant PSFs field restoration, Computing B-Stationary Points of Nonsmooth DC Programs, Convergence analysis of a proximal point algorithm for minimizing differences of functions, Globally Convergent Jacobi-Type Algorithms for Simultaneous Orthogonal Symmetric Tensor Diagonalization, Nonconvex-TV Based Image Restoration with Impulse Noise Removal, Inertial Proximal Alternating Linearized Minimization (iPALM) for Nonconvex and Nonsmooth Problems, An Augmented Lagrangian Method for $\ell_{1}$-Regularized Optimization Problems with Orthogonality Constraints, A Wavelet Frame Method with Shape Prior for Ultrasound Video Segmentation, CT Image Reconstruction by Spatial-Radon Domain Data-Driven Tight Frame Regularization, The Kurdyka–Łojasiewicz Inequality as Regularity Condition, Local Minimizers of Semi-Algebraic Functions from the Viewpoint of Tangencies, Joint Phase Reconstruction and Magnitude Segmentation from Velocity-Encoded MRI Data, 5D respiratory motion model based image reconstruction algorithm for 4D cone-beam computed tomography

Cites Work

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:403666&oldid=12274003"