Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality

DOI10.1287/moor.1100.0449zbMath1214.65036arXiv0801.1780MaRDI QIDQ3169101

Jérôme Bolte, Patrick Redont, Hedy Attouch, Antoine Soubeyran

Publication date: 27 April 2011

Published in: Mathematics of Operations Research (Search for Journal in Brave)

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

zbMATH Keywords

regularization; critical point; nonconvex optimization; convergence rate; Gauss-Seidel method; gradient systems; Kurdyka-Łojasiewicz inequality; o-minimal structures; sparse reconstruction; proximal algorithms; tame optimization; alternating minimization algorithms; finite convergence time; alternating projections algorithms

Mathematics Subject Classification ID

90C26: Nonconvex programming, global optimization

65K10: Numerical optimization and variational techniques

49J52: Nonsmooth analysis

49M27: Decomposition methods

Related Items

Unnamed Item, A globally convergent algorithm for a class of gradient compounded non-Lipschitz models applied to non-additive noise removal, Proximal Gradient Method for Nonsmooth Optimization over the Stiefel Manifold, Sharpness, Restart, and Acceleration, ADMM for multiaffine constrained optimization, A second-order dynamical approach with variable damping to nonconvex smooth minimization, A self-adaptive regularized alternating least squares method for tensor decomposition problems, The Boosted Difference of Convex Functions Algorithm for Nonsmooth Functions, Modern regularization methods for inverse problems, A Proximal Minimization Algorithm for Structured Nonconvex and Nonsmooth Problems, Alternating Structure-Adapted Proximal Gradient Descent for Nonconvex Nonsmooth Block-Regularized Problems, A Simple Framework for Stability Analysis of State-Dependent Networks of Heterogeneous Agents, An Inertial Newton Algorithm for Deep Learning, Blind Ptychographic Phase Retrieval via Convergent Alternating Direction Method of Multipliers, Non-Lipschitz Models for Image Restoration with Impulse Noise Removal, Proximal Heterogeneous Block Implicit-Explicit Method and Application to Blind Ptychographic Diffraction Imaging, The Primal-Dual Hybrid Gradient Method for Semiconvex Splittings, Alternating Direction Method of Multipliers for a Class of Nonconvex and Nonsmooth Problems with Applications to Background/Foreground Extraction, 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, Alternating Proximal Regularized Dictionary Learning, A nonconvex ADMM for a class of sparse inverse semidefinite quadratic programming problems, Proximal Distance Algorithms: Theory and Examples, 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 ^*, Approximate first-order primal-dual algorithms for saddle point problems, Triple Decomposition and Tensor Recovery of Third Order Tensors, Mathematical programs with equilibrium constraints: a sequential optimality condition, new constraint qualifications and algorithmic consequences, Choose Your Path Wisely: Gradient Descent in a Bregman Distance Framework, Learnable Descent Algorithm for Nonsmooth Nonconvex Image Reconstruction, Variational Rician Noise Removal via Splitting on Spheres, Robust Tensor Completion: Equivalent Surrogates, Error Bounds, and Algorithms, Tensor Manifold with Tucker Rank Constraints, On Optimality Conditions for Nonlinear Conic Programming, Bregman Finito/MISO for Nonconvex Regularized Finite Sum Minimization without Lipschitz Gradient Continuity, The Exact Modulus of the Generalized Concave Kurdyka-Łojasiewicz Property, Hölderian Error Bounds and Kurdyka-Łojasiewicz Inequality for the Trust Region Subproblem, Two-Phase Image Segmentation by Nonconvex Nonsmooth Models with Convergent Alternating Minimization Algorithms, Block delayed Majorize-Minimize subspace algorithm for large scale image restoration ^*, A combined dictionary learning and TV model for image restoration with convergence analysis, Unnamed Item, Solving sparse principal component analysis with global support, Linear convergence of an alternating polar decomposition method for low rank orthogonal tensor approximations, Simultaneous recovery of attenuation and source density in SPECT, A converged deep graph semi-NMF algorithm for learning data representation, An extrapolated iteratively reweighted \(\ell_1\) method with complexity analysis, Error bounds, facial residual functions and applications to the exponential cone, Robust sensing of low-rank matrices with non-orthogonal sparse decomposition, A tensor optimization algorithm for computing Lagrangians of hypergraphs, 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, Lyapunov stability of the subgradient method with constant step size, Nonconvex optimization with inertial proximal stochastic variance reduction gradient, An Unrolled Implicit Regularization Network for Joint Image and Sensitivity Estimation in Parallel MR Imaging with Convergence Guarantee, A proximal alternating minimization algorithm for the largest C-eigenvalue of piezoelectric-type tensors, Some accelerated alternating proximal gradient algorithms for a class of nonconvex nonsmooth problems, 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, Conditions for linear convergence of the gradient method for non-convex optimization, Doubly iteratively reweighted algorithm for constrained compressed sensing models, 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, 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, A convergent iterative support shrinking algorithm for non-Lipschitz multi-phase image labeling model, Joint Reconstruction-Segmentation on Graphs, A Regularized Newton Method for \({\boldsymbol{\ell}}_{q}\) -Norm Composite Optimization Problems, Topology optimization for inverse magnetostatics as sparse regression: application to electromagnetic coils for stellarators, Tensor factorization via transformed tensor-tensor product for image alignment, 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, First order inertial optimization algorithms with threshold effects associated with dry friction, Convergence of Bregman Peaceman-Rachford splitting method for nonconvex nonseparable optimization, Image cartoon-texture decomposition by a generalized non-convex low-rank minimization method, Quaternion-based color image completion via logarithmic approximation, Convergence of a Class of Nonmonotone Descent Methods for Kurdyka–Łojasiewicz Optimization Problems, Linear Convergence of a Proximal Alternating Minimization Method with Extrapolation for \(\boldsymbol{\ell_1}\) -Norm Principal Component Analysis, On the Global Convergence of Randomized Coordinate Gradient Descent for Nonconvex Optimization, Convergence of Random Reshuffling under the Kurdyka–Łojasiewicz Inequality, 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, Accelerating inexact successive quadratic approximation for regularized optimization through manifold identification, 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, Fast optimization via inertial dynamics with closed-loop damping, 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, MF-OMO: An Optimization Formulation of Mean-Field Games, A Fast Minimization Algorithm for the Euler Elastica Model Based on a Bilinear Decomposition, Hyperspectral super-resolution via low rank tensor triple decomposition, Reexamining low rank matrix factorization for trace norm regularization, An accelerated forward-backward-half forward splitting algorithm for monotone inclusion with applications to image restoration, An iDCA with sieving strategy for PDE-constrained optimization problems with \(L^{1-2}\)-control cost, A forward-backward dynamical approach to the minimization of the sum of a nonsmooth convex with a smooth nonconvex function, PET-MRI joint reconstruction with common edge weighted total variation regularization, 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, Unifying Abstract Inexact Convergence Theorems and Block Coordinate Variable Metric iPiano, Distributed model predictive control for continuous‐time nonlinear systems based on suboptimal ADMM, Non-convex clustering via proximal alternating linearized minimization method, Blind image fusion for hyperspectral imaging with the directional total variation, Decomposition Methods for Computing Directional Stationary Solutions of a Class of Nonsmooth Nonconvex Optimization Problems, RSG: Beating Subgradient Method without Smoothness and Strong Convexity, On the convergence of higher-order orthogonal iteration, Variational Phase Retrieval with Globally Convergent Preconditioned Proximal Algorithm, Coherence Retrieval Using Trace Regularization, Inexact Half-Quadratic Optimization for Linear Inverse Problems, PET-MRI Joint Reconstruction by Joint Sparsity Based Tight Frame Regularization, On Collaborative Compressive Sensing Systems: The Framework, Design, and Algorithm, Unnamed Item, Unnamed Item, Unnamed Item, 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, Computational approaches to non-convex, sparsity-inducing multi-penalty regularization, Variable Metric Forward-Backward Algorithm for Composite Minimization Problems, Analysis and Algorithms for Some Compressed Sensing Models Based on L1/L2 Minimization, Orthogonal Trace-Sum Maximization: Applications, Local Algorithms, and Global Optimality, On a general smoothly truncated regularization for variational piecewise constant image restoration: construction and convergent algorithms, Outlier accommodation in moving‐horizon state estimation: A risk‐averse performance‐specified approach, 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, Infeasibility and Error Bound Imply Finite Convergence of Alternating Projections, An accelerated majorization-minimization algorithm with convergence guarantee for non-Lipschitz wavelet synthesis model ^*, A Stochastic Proximal Alternating Minimization for Nonsmooth and Nonconvex Optimization, First-Order Algorithms for a Class of Fractional Optimization Problems, Proximal Gradient Methods for Machine Learning and Imaging, An inertial proximal alternating direction method of multipliers for nonconvex optimization, 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, $L_1$-Norm Regularization for Short-and-Sparse Blind Deconvolution: Point Source Separability and Region Selection, A General Non-Lipschitz Infimal Convolution Regularized Model: Lower Bound Theory and Algorithm, Flexible parameter selection methods for Rician noise removal with convergence guarantee, ADJUST: a dictionary-based joint reconstruction and unmixing method for spectral tomography, A Columnwise Update Algorithm for Sparse Stochastic Matrix Factorization, Minimizing L ₁ over L ₂ norms on the gradient, Error bounds revisited, Nonconvex flexible sparsity regularization: theory and monotone numerical schemes, Convergence Analysis on SS-HOPM for BEC-Like Nonlinear Eigenvalue Problems, Data-Driven Tight Frame Construction for Impulsive Noise Removal, Column $\ell_{2,0}$-Norm Regularized Factorization Model of Low-Rank Matrix Recovery and Its Computation, On Cluster-Aware Supervised Learning: Frameworks, Convergent Algorithms, and Applications, A Splitting Scheme for Flip-Free Distortion Energies, Novel Proximal Gradient Methods for Nonnegative Matrix Factorization with Sparsity Constraints, 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, Second-Order Guarantees of Distributed Gradient Algorithms, Convergence of Inexact Forward--Backward Algorithms Using the Forward--Backward Envelope, SPECT with a multi-bang assumption on attenuation, Data Driven Tight Frame for Compressed Sensing MRI Reconstruction via Off-the-Grid Regularization, Overparameterized Models for Vector Fields, Multiplicative Noise Removal: Nonlocal Low-Rank Model and Its Proximal Alternating Reweighted Minimization Algorithm, Generalized Subdifferentials of Spectral Functions over Euclidean Jordan Algebras, A proximal algorithm with backtracked extrapolation for a class of structured fractional programming, Nonnegative low rank tensor approximations with multidimensional image applications, Proximal linearization methods for Schatten \(p\)-quasi-norm minimization, Solution methodologies for minimizing a sum of pointwise minima of two functions, 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, 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, Calmness of partial perturbation to composite rank constraint systems and its applications, An abstract convergence framework with application to inertial inexact forward-backward methods, A global exact penalty for rank-constrained optimization problem and applications, A matrix nonconvex relaxation approach to unconstrained binary polynomial programs, Proximal gradient algorithm for nonconvex low tubal rank tensor recovery, Sparse estimation: an MMSE approach, An inexact Riemannian proximal gradient method, Majorization-Minimization Procedures and Convergence of SQP Methods for Semi-Algebraic and Tame Programs, DC Approximation Approach for ℓ0-minimization in Compressed Sensing, On the distance to singularity via low rank perturbations, Computing Eigenvalues of Large Scale Sparse Tensors Arising from a Hypergraph, Convergence Rate Analysis for Averaged Fixed Point Iterations in Common Fixed Point Problems, Convergence Results for Projected Line-Search Methods on Varieties of Low-Rank Matrices Via Łojasiewicz Inequality, Convergence analysis of a proximal point algorithm for minimizing differences of functions, Nonconvex-TV Based Image Restoration with Impulse Noise Removal, A proximal algorithm with quasi distance. Application to habit's formation, 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, An Efficient Algorithm for Video Superresolution Based on a Sequential Model, CT Image Reconstruction by Spatial-Radon Domain Data-Driven Tight Frame Regularization, Local Minimizers of Semi-Algebraic Functions from the Viewpoint of Tangencies, Efficient Blind Compressed Sensing Using Sparsifying Transforms with Convergence Guarantees and Application to Magnetic Resonance Imaging, Global Convergence of Splitting Methods for Nonconvex Composite Optimization, 5D respiratory motion model based image reconstruction algorithm for 4D cone-beam computed tomography, Sparse Principal Component Analysis via Variable Projection, Nonsmooth bundle trust-region algorithm with applications to robust stability, Half-linear regularization for nonconvex image restoration models, A note on the complexity of proximal iterative hard thresholding algorithm, A new approach to the proximal point method: convergence on general Riemannian manifolds, On local convergence of the method of alternating projections, Wavelet inpainting with the \(\ell_{0}\) sparse regularization, An inertial forward-backward algorithm for the minimization of the sum of two nonconvex functions, Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems, 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, Alternating projections on nontangential manifolds, Proximal alternating linearized minimization for nonconvex and nonsmooth problems, Restricted normal cones and sparsity optimization with affine constraints, Proximal point method on Finslerian manifolds and the ``effort-accuracy trade-off, About \([q\)-regularity properties of collections of sets], Generalized inexact proximal algorithms: routine's formation with resistance to change, following worthwhile changes, A generalized inexact proximal point method for nonsmooth functions that satisfies Kurdyka Łojasiewicz inequality, A new alternating direction method for linearly constrained nonconvex optimization problems, Local search proximal algorithms as decision dynamics with costs to move, About subtransversality of collections of sets, A convergent relaxation of the Douglas-Rachford algorithm, Dual descent methods as tension reduction systems, 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})\), Inexact proximal point methods in metric spaces, The \(\ell_{2,q}\) regularized group sparse optimization: lower bound theory, recovery bound and algorithms, Key-frame detection and super-resolution of hyperspectral video via sparse-based cumulative tensor factorization, An alternating linearization bundle method for a class of nonconvex nonsmooth optimization problems, Bregman proximal gradient algorithms for deep matrix factorization, Continuous dynamics related to monotone inclusions and non-smooth optimization problems, Dual sufficient characterizations of transversality properties, Transversality and alternating projections for nonconvex sets, Error bounds and Hölder metric subregularity, Convergence rate analysis for the higher order power method in best rank one approximations of tensors, A seminorm regularized alternating least squares algorithm for canonical tensor decomposition, A convergent least-squares regularized blind deconvolution approach, Local convergence of the heavy-ball method and iPiano for non-convex optimization, Approaching nonsmooth nonconvex optimization problems through first order dynamical systems with hidden acceleration and Hessian driven damping terms, 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, Peaceman-Rachford splitting for a class of nonconvex optimization problems, Convergence of ADMM for multi-block nonconvex separable optimization models, 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, Large-scale unit commitment under uncertainty: an updated literature survey, Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis, Cauchy noise removal by nonconvex ADMM with convergence guarantees, On accelerating the regularized alternating least-squares algorithm for tensors, A proximal difference-of-convex algorithm with extrapolation, Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods, Proximal algorithms in statistics and machine learning, A block coordinate variable metric linesearch based proximal gradient method, Practical matrix completion and corruption recovery using proximal alternating robust subspace minimization, Toward fast transform learning, A storm of feasibility pumps for nonconvex MINLP, Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods, 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, Approximate versions of proximal iteratively reweighted algorithms including an extended IP-ICMM for signal and image processing problems, Approaching nonsmooth nonconvex minimization through second-order proximal-gradient dynamical systems, A new globally convergent algorithm for non-Lipschitz \(\ell_{p}-\ell_q\) minimization, Selection dynamics for deep neural networks, On the convergence of the iterates of proximal gradient algorithm with extrapolation for convex nonsmooth minimization problems, On the robust PCA and Weiszfeld's algorithm, Convergence rates of an inertial gradient descent algorithm under growth and flatness conditions, Linear convergence of inexact descent method and inexact proximal gradient algorithms for lower-order regularization problems, Local linear convergence of the alternating direction method of multipliers for nonconvex separable optimization problems, Kurdyka-Łojasiewicz property of zero-norm composite functions, Tractable ADMM schemes for computing KKT points and local minimizers for \(\ell_0\)-minimization problems, Nonisometric surface registration via conformal Laplace-Beltrami basis pursuit, A proximal DC approach for quadratic assignment problem, A bundle method for nonsmooth DC programming with application to chance-constrained problems, An accelerated IRNN-iteratively reweighted nuclear norm algorithm for nonconvex nonsmooth low-rank minimization problems, 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, Simultaneous image enhancement and restoration with non-convex total variation, Algorithms for nonnegative matrix factorization with the Kullback-Leibler divergence, Maximum time step for the BDF3 scheme applied to gradient flows, 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, Inexact stochastic subgradient projection method for stochastic equilibrium problems with nonmonotone bifunctions: application to expected risk minimization in machine learning, 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, On DC based methods for phase retrieval, A preconditioned difference of convex algorithm for truncated quadratic regularization with application to imaging, An approximate augmented Lagrangian method for nonnegative low-rank matrix approximation, A Barzilai-Borwein gradient algorithm for spatio-temporal Internet traffic data completion via tensor triple decomposition, Error bound of critical points and KL property of exponent 1/2 for squared F-norm regularized factorization, MAP inference via \(\ell_2\)-sphere linear program reformulation, Correction to: ``An approximate augmented Lagrangian method for nonnegative low-rank matrix approximation, An inexact proximal gradient algorithm with extrapolation for a class of nonconvex nonsmooth optimization problems, A regularized alternating direction method of multipliers for a class of nonconvex problems, Unnamed Item, Convergence Rate Analysis of a Dykstra-Type Projection Algorithm, An ADMM-based SQP method for separably smooth nonconvex optimization, Alternating projections with applications to Gerchberg-Saxton error reduction, 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, A geometric integration approach to nonsmooth, nonconvex optimisation, Exponential convexifying of polynomials, 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, Multi-dimensional image recovery via fully-connected tensor network decomposition under the learnable transforms, 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, Restarting Frank-Wolfe: faster rates under Hölderian error bounds, Alternating DC algorithm for partial DC programming problems, Complexity of an inexact proximal-point penalty method for constrained smooth non-convex optimization, Convergence results of a new monotone inertial forward-backward splitting algorithm under the local Hölder error bound condition, Block-coordinate and incremental aggregated proximal gradient methods for nonsmooth nonconvex problems, A survey on some recent developments of alternating direction method of multipliers, 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, 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, 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, On the rotational invariant \(L_1\)-norm PCA, Semi-blind image deblurring by a proximal alternating minimization method with convergence guarantees, A gradient-type algorithm with backward inertial steps associated to a nonconvex minimization problem, Geometric and metric characterizations of transversality properties, On the Łojasiewicz-Simon gradient inequality on submanifolds, Image restoration via the adaptive \(TV^p\) regularization, Phase retrieval: a data-driven wavelet frame based approach, A difference-of-convex approach for split feasibility with applications to matrix factorizations and outlier detection, Tensor factorization with total variation and Tikhonov regularization for low-rank tensor completion in imaging data, A proximal interior point algorithm with applications to image processing, How can machine learning and optimization help each other better?, Adaptive total variation and second-order total variation-based model for low-rank tensor completion, Bregman reweighted alternating minimization and its application to image deblurring, A QCQP-based splitting SQP algorithm for two-block nonconvex constrained optimization problems with application, An incremental aggregated proximal ADMM for linearly constrained nonconvex optimization with application to sparse logistic regression problems, 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, Local linear convergence of an ADMM-type splitting framework for equality constrained optimization, 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, A parameterized Douglas-Rachford splitting algorithm for nonconvex optimization, Prox-regularity of rank constraint sets and implications for algorithms, Convergence of non-smooth descent methods using the Kurdyka-Łojasiewicz inequality, A trust-region method for unconstrained multiobjective problems with applications in satisficing processes, Quantitative characterizations of regularity properties of collections of sets, Nonconvex proximal incremental aggregated gradient method with linear convergence, Convergence analysis of the generalized splitting methods for a class of nonconvex optimization problems, Robust Schatten-\(p\) norm based approach for tensor completion, 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, Majorized proximal alternating imputation for regularized rank constrained matrix completion, Bregman proximal mappings and Bregman-Moreau envelopes under relative prox-regularity, A ``nonconvex+nonconvex approach for image restoration with impulse noise removal, A variational model with hybrid hyper-Laplacian priors for Retinex, 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, An inexact augmented Lagrangian multiplier method for solving quadratic complementary problems: an adapted algorithmic framework combining specific resolution techniques, Optimal multivariate Gaussian fitting with applications to PSF modeling in two-photon microscopy imaging, Designing Gabor windows using convex optimization, A general double-proximal gradient algorithm for d.c. programming, Proximal-type algorithms for split minimization problem in P-uniformly convex metric spaces, Convergence analysis for iterative data-driven tight frame construction scheme, Splitting methods with variable metric for Kurdyka-Łojasiewicz functions and general convergence rates, Large-scale unit commitment under uncertainty, On damped second-order gradient systems, CUSTOM: a calibration region recovery approach for highly subsampled dynamic parallel magnetic resonance imaging, Inexact proximal point methods for quasiconvex minimization on Hadamard manifolds, Forward-backward quasi-Newton methods for nonsmooth optimization problems, Further properties of the forward-backward envelope with applications to difference-of-convex programming, Nonconvex and nonsmooth optimization with generalized orthogonality constraints: an approximate augmented Lagrangian method, Computing extreme eigenvalues of large scale Hankel tensors, A proximal method for equilibrium problems under growth conditions, Inertial proximal alternating minimization for nonconvex and nonsmooth problems, Backward-forward algorithms for structured monotone inclusions in Hilbert spaces, Alternating direction method of multipliers for nonconvex fused regression problems, Global and local structure preserving sparse subspace learning: an iterative approach to unsupervised feature selection, 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, First-order methods almost always avoid strict saddle points, Convergence of linear Bregman ADMM for nonconvex and nonsmooth problems with nonseparable structure, Robust low transformed multi-rank tensor methods for image alignment, Robust recovery of low-rank matrices with non-orthogonal sparse decomposition from incomplete measurements, An approximation method of CP rank for third-order tensor completion, Image completion and blind deconvolution: model and algorithm