Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods

From MaRDI portal

Publication:1942265

Jump to:navigation, search

DOI10.1007/s10107-011-0484-9zbMath1260.49048OpenAlexW1967138577MaRDI QIDQ1942265

Jérôme Bolte, Hedy Attouch, Benar Fux Svaiter

Publication date: 18 March 2013

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

Full work available at URL: https://doi.org/10.1007/s10107-011-0484-9

zbMATH Keywords

relative error descent methods sufficient decrease forward-backward splitting nonconvex nonsmooth optimization Kurdyka-Łojasiewicz inequality o-minimal structures proximal algorithms alternating minimization iterative thresholding block-coordinate methods semi-algebraic optimization tame optimization

Mathematics Subject Classification ID

Convex programming (90C25) Newton-type methods (49M15) Methods of quasi-Newton type (90C53) Variational methods involving nonlinear operators (47J30) Iterative procedures involving nonlinear operators (47J25) Numerical methods based on nonlinear programming (49M37) Evolution inclusions (34G25) Nonlinear evolution equations (47J35) Numerical methods for variational inequalities and related problems (65K15)

Related Items

Two-Phase Image Segmentation by Nonconvex Nonsmooth Models with Convergent Alternating Minimization Algorithms ⋮ On inexact stochastic splitting methods for a class of nonconvex composite optimization problems with relative error ⋮ A Unified Analysis of Descent Sequences in Weakly Convex Optimization, Including Convergence Rates for Bundle Methods ⋮ A Global Convergence Analysis for Computing a Symmetric Low-Rank Orthogonal Approximation ⋮ Zeroth-order optimization with orthogonal random directions ⋮ 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 ⋮ An extrapolated iteratively reweighted \(\ell_1\) method with complexity analysis ⋮ Error bounds, facial residual functions and applications to the exponential cone ⋮ A trust-region LP-Newton method for constrained nonsmooth equations under Hölder metric subregularity ⋮ A gradient sampling algorithm for stratified maps with applications to topological data analysis ⋮ Global convergence of the gradient method for functions definable in o-minimal structures ⋮ Dynamic string‐averaging CQ‐methods for the split feasibility problem with percentage violation constraints arising in radiation therapy treatment planning ⋮ 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 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 ⋮ Fully-connected tensor network decomposition for robust tensor completion problem ⋮ Preconditioned Algorithm for Difference of Convex Functions with Applications to Graph Ginzburg–Landau Model ⋮ Doubly iteratively reweighted algorithm for constrained compressed sensing models ⋮ Coercivity and generalized proximal algorithms: application -- traveling around the world ⋮ A generalized inertial proximal alternating linearized minimization method for nonconvex nonsmooth problems ⋮ A convergent iterative support shrinking algorithm for non-Lipschitz multi-phase image labeling model ⋮ 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 comparison of edge-preserving approaches for differential interference contrast microscopy ⋮ A generalized non-convex method for robust tensor completion ⋮ Non-convex fractional-order derivative for single image blind restoration ⋮ Convergence rate analysis of an extrapolated proximal difference-of-convex algorithm ⋮ Sequential Model Correction for Nonlinear Inverse Problems ⋮ Inertial Newton algorithms avoiding strict saddle points ⋮ 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 ⋮ On the relationship between the Kurdyka-Łojasiewicz property and error bounds on Hadamard manifolds ⋮ Image cartoon-texture decomposition by a generalized non-convex low-rank minimization method ⋮ A singular value shrinkage thresholding algorithm for folded concave penalized low-rank matrix optimization problems ⋮ 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 ⋮ 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 ⋮ A line search based proximal stochastic gradient algorithm with dynamical variance reduction ⋮ A refined inertial DC algorithm for DC programming ⋮ A Unified View of Exact Continuous Penalties for $\ell_2$-$\ell_0$ Minimization ⋮ Convergence of Random Reshuffling under the Kurdyka–Łojasiewicz Inequality ⋮ Inducing sparsity via the horseshoe prior in imaging problems ⋮ 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 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 ⋮ Provable Phase Retrieval with Mirror Descent ⋮ A Learnable Group-Tube Transform Induced Tensor Nuclear Norm and Its Application for Tensor Completion ⋮ The Variable Metric Forward-Backward Splitting Algorithm Under Mild Differentiability Assumptions ⋮ Unnamed Item ⋮ Alternating Proximal Regularized Dictionary Learning ⋮ A nonconvex ADMM for a class of sparse inverse semidefinite quadratic programming problems ⋮ 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 ⋮ A globally convergent algorithm for a class of gradient compounded non-Lipschitz models applied to non-additive noise removal ⋮ An introduction to continuous optimization for imaging ⋮ Douglas--Rachford Splitting and ADMM for Nonconvex Optimization: Tight Convergence Results ⋮ ADMM for multiaffine constrained optimization ⋮ A second-order dynamical approach with variable damping to nonconvex smooth minimization ⋮ On phase retrieval via matrix completion and the estimation of low rank PSD matrices ⋮ Spectral Operators of Matrices: Semismoothness and Characterizations of the Generalized Jacobian ⋮ Nonconvex Lagrangian-Based Optimization: Monitoring Schemes and Global Convergence ⋮ On Algorithms for Difference of Monotone Operators ⋮ On Algorithms for Difference of Monotone Operators ⋮ The Boosted Difference of Convex Functions Algorithm for Nonsmooth Functions ⋮ A nonconvex penalization algorithm with automatic choice of the regularization parameter in sparse imaging ⋮ Composite Optimization by Nonconvex Majorization-Minimization ⋮ 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 ⋮ Hessian Barrier Algorithms for Linearly Constrained Optimization Problems ⋮ Scalable Bayesian Uncertainty Quantification in Imaging Inverse Problems via Convex Optimization ⋮ Non-Lipschitz Models for Image Restoration with Impulse Noise Removal ⋮ Matrix completion via minimizing an approximate rank ⋮ Accelerate stochastic subgradient method by leveraging local growth condition ⋮ Complexity of a Quadratic Penalty Accelerated Inexact Proximal Point Method for Solving Linearly Constrained Nonconvex Composite Programs ⋮ Proximal Heterogeneous Block Implicit-Explicit Method and Application to Blind Ptychographic Diffraction Imaging ⋮ Luminance-Chrominance Model for Image Colorization ⋮ The Primal-Dual Hybrid Gradient Method for Semiconvex Splittings ⋮ 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 ⋮ 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 ⋮ A partially inexact ADMM with o(1/n) asymptotic convergence rate, 𝒪(1/n) complexity, and immediate relative error tolerance ⋮ Robust Tensor Completion: Equivalent Surrogates, Error Bounds, and Algorithms ⋮ Sparse Solutions of a Class of Constrained Optimization Problems ⋮ On Optimality Conditions for Nonlinear Conic Programming ⋮ Extrapolated Proximal Subgradient Algorithms for Nonconvex and Nonsmooth Fractional Programs ⋮ Bregman Finito/MISO for Nonconvex Regularized Finite Sum Minimization without Lipschitz Gradient Continuity ⋮ Examples of Pathological Dynamics of the Subgradient Method for Lipschitz Path-Differentiable Functions ⋮ 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 ⋮ Asynchronous variance-reduced block schemes for composite non-convex stochastic optimization: block-specific steplengths and adapted batch-sizes ⋮ A General Non-Lipschitz Infimal Convolution Regularized Model: Lower Bound Theory and Algorithm ⋮ Flexible parameter selection methods for Rician noise removal with convergence guarantee ⋮ Dynamical systems and forward–backward algorithms associated with the sum of a convex subdifferential and a monotone cocoercive operator ⋮ An Unbiased Approach to Low Rank Recovery ⋮ Limiting Aspects of Nonconvex ${TV}^{\phi}$ Models ⋮ Inertial Proximal Alternating Linearized Minimization (iPALM) for Nonconvex and Nonsmooth Problems ⋮ Global Convergence of Splitting Methods for Nonconvex Composite Optimization ⋮ Nonconvex Constrained Minimisation for 3D Left Ventricular Shape Recovery Using 2D Echocardiography Data ⋮ An Augmented Lagrangian Method for $\ell_{1}$-Regularized Optimization Problems with Orthogonality Constraints ⋮ A forward-backward dynamical approach to the minimization of the sum of a nonsmooth convex with a smooth nonconvex function ⋮ Trimmed Constrained Mixed Effects Models: Formulations and Algorithms ⋮ An Efficient Algorithm for Video Superresolution Based on a Sequential Model ⋮ CT Image Reconstruction by Spatial-Radon Domain Data-Driven Tight Frame Regularization ⋮ A semi-alternating algorithm for solving nonconvex split equality problems ⋮ A Continuous Exact $\ell_0$ Penalty (CEL0) for Least Squares Regularized Problem ⋮ Composite Difference-Max Programs for Modern Statistical Estimation Problems ⋮ A Nonmonotone Alternating Updating Method for a Class of Matrix Factorization Problems ⋮ Convergence Analysis on SS-HOPM for BEC-Like Nonlinear Eigenvalue Problems ⋮ Data-Driven Tight Frame Construction for Impulsive Noise Removal ⋮ Globally Solving the Trust Region Subproblem Using Simple First-Order Methods ⋮ A Nonconvex Optimization Approach to IMRT Planning with Dose–Volume Constraints ⋮ 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 ⋮ Difference-of-Convex Algorithms for a Class of Sparse Group $\ell_0$ Regularized Optimization Problems ⋮ Potential Function-Based Framework for Minimizing Gradients in Convex and Min-Max Optimization ⋮ A Splitting Scheme for Flip-Free Distortion Energies ⋮ The equivalence of three types of error bounds for weakly and approximately convex functions ⋮ Forward-Backward Envelope for the Sum of Two Nonconvex Functions: Further Properties and Nonmonotone Linesearch Algorithms ⋮ Proximal gradient methods for general smooth graph total variation model in unsupervised learning ⋮ An inexact scalarization proximal point method for multiobjective quasiconvex minimization ⋮ Proximal linearization methods for Schatten \(p\)-quasi-norm minimization ⋮ Convergence Results for Projected Line-Search Methods on Varieties of Low-Rank Matrices Via Łojasiewicz Inequality ⋮ A nonconvex approach to low-rank matrix completion using convex optimization ⋮ Novel Proximal Gradient Methods for Nonnegative Matrix Factorization with Sparsity Constraints ⋮ Thresholding gradient methods in Hilbert spaces: support identification and linear convergence ⋮ A generalized forward-backward splitting operator: degenerate analysis and applications ⋮ A Subgradient-Based Approach for Finding the Maximum Feasible Subsystem with Respect to a Set ⋮ 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 ⋮ A Symmetric Alternating Direction Method of Multipliers for Separable Nonconvex Minimization Problems ⋮ On optimal solutions of the constrained ℓ ₀ regularization and its penalty problem ⋮ Convergence analysis of an ALF-based nonconvex splitting algorithm with SQP structure ⋮ Retraction-based first-order feasible methods for difference-of-convex programs with smooth inequality and simple geometric constraints ⋮ A survey on operator splitting and decomposition of convex programs ⋮ The Proximal Alternating Direction Method of Multipliers in the Nonconvex Setting: Convergence Analysis and Rates ⋮ An abstract convergence framework with application to inertial inexact forward-backward methods ⋮ A global exact penalty for rank-constrained optimization problem and applications ⋮ On global convergence of alternating least squares for tensor approximation ⋮ Nonconvex model for mixing noise with fractional-order regularization ⋮ Proximal gradient algorithm for nonconvex low tubal rank tensor recovery ⋮ General descent method using w-distance. Application to emergence of habits following worthwhile moves ⋮ Geodesic PCA versus Log-PCA of Histograms in the Wasserstein Space ⋮ Sparse estimation: an MMSE approach ⋮ An inexact Riemannian proximal gradient method ⋮ Computing B-Stationary Points of Nonsmooth DC Programs ⋮ Convergence analysis of a proximal point algorithm for minimizing differences of functions ⋮ Approximate Matrix and Tensor Diagonalization by Unitary Transformations: Convergence of Jacobi-Type Algorithms ⋮ Second-Order Guarantees of Distributed Gradient Algorithms ⋮ Convergence of Inexact Forward--Backward Algorithms Using the Forward--Backward Envelope ⋮ An unbiased approach to compressed sensing ⋮ Unifying Abstract Inexact Convergence Theorems and Block Coordinate Variable Metric iPiano ⋮ Relaxed Gauss--Newton Methods with Applications to Electrical Impedance Tomography ⋮ Local Minimizers of Semi-Algebraic Functions from the Viewpoint of Tangencies ⋮ Unnamed Item ⋮ RSG: Beating Subgradient Method without Smoothness and Strong Convexity ⋮ Unnamed Item ⋮ Energy Minimization Methods ⋮ Inexact Half-Quadratic Optimization for Linear Inverse Problems ⋮ On Collaborative Compressive Sensing Systems: The Framework, Design, and Algorithm ⋮ Convergent Semidefinite Programming Relaxations for Global Bilevel Polynomial Optimization Problems ⋮ Preconditioning of a Generalized Forward-Backward Splitting and Application to Optimization on Graphs ⋮ Low Complexity Regularization of Linear Inverse Problems ⋮ On the Minimization Over Sparse Symmetric Sets: Projections, Optimality Conditions, and Algorithms ⋮ Variable Metric Inexact Line-Search-Based Methods for Nonsmooth Optimization ⋮ Gradient stability of high-order BDF methods and some applications ⋮ Majorization-Minimization Procedures and Convergence of SQP Methods for Semi-Algebraic and Tame Programs ⋮ A remark on accelerated block coordinate descent for computing the proximity operators of a sum of convex functions ⋮ Sparse inverse covariance matrix estimation via the $ \newcommand{\e}{{\rm e}} \ell_{0}$ -norm with Tikhonov regularization ⋮ 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 ⋮ Numerical aspects of large-time optimal control of Burgers equation ⋮ 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 ⋮ 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 ⋮ Nonconvex-TV Based Image Restoration with Impulse Noise Removal ⋮ An accelerated majorization-minimization algorithm with convergence guarantee for non-Lipschitz wavelet synthesis model ^* ⋮ Optimization on Spheres: Models and Proximal Algorithms with Computational Performance Comparisons ⋮ First-Order Algorithms for a Class of Fractional Optimization Problems ⋮ Proximal Gradient Methods for Machine Learning and Imaging ⋮ Alternating DC algorithm for partial DC programming problems ⋮ Forward-backward quasi-Newton methods for nonsmooth optimization problems ⋮ Further properties of the forward-backward envelope with applications to difference-of-convex programming ⋮ Understanding generalization error of SGD in nonconvex optimization ⋮ Block-coordinate and incremental aggregated proximal gradient methods for nonsmooth nonconvex problems ⋮ A survey on some recent developments of alternating direction method of multipliers ⋮ Quaternion matrix optimization: motivation and analysis ⋮ 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 ⋮ A fast proximal iteratively reweighted nuclear norm algorithm for nonconvex low-rank matrix minimization problems ⋮ Proximal methods avoid active strict saddles of weakly convex functions ⋮ Moreau envelope augmented Lagrangian method for nonconvex optimization with linear constraints ⋮ Tensor completion via fully-connected tensor network decomposition with regularized factors ⋮ Riemannian proximal gradient methods ⋮ Global convergence of model function based Bregman proximal minimization algorithms ⋮ Bias versus non-convexity in compressed sensing ⋮ A generalized proximal linearized algorithm for DC functions with application to the optimal size of the firm problem ⋮ 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 ⋮ Nonconvex and nonsmooth optimization with generalized orthogonality constraints: an approximate augmented Lagrangian method ⋮ Proximal methods for reweighted \(l_Q\)-regularization of sparse signal recovery ⋮ Convergence of linear Bregman ADMM for nonconvex and nonsmooth problems with nonseparable structure ⋮ A proximal method for equilibrium problems under growth conditions ⋮ Robust low transformed multi-rank tensor methods for image alignment ⋮ A globally convergent algorithm for a constrained non-Lipschitz image restoration model ⋮ 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 ⋮ On the rotational invariant \(L_1\)-norm PCA ⋮ Backward-forward algorithms for structured monotone inclusions in Hilbert spaces ⋮ Newton method for \(\ell_0\)-regularized optimization ⋮ Image completion and blind deconvolution: model and algorithm ⋮ Semi-blind image deblurring by a proximal alternating minimization method with convergence guarantees ⋮ A proximal algorithm with backtracked extrapolation for a class of structured fractional programming ⋮ A gradient-type algorithm with backward inertial steps associated to a nonconvex minimization problem ⋮ On the strong convergence of forward-backward splitting in reconstructing jointly sparse signals ⋮ 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 ⋮ Non-smooth non-convex Bregman minimization: unification and new algorithms ⋮ An envelope for Davis-Yin splitting and strict saddle-point avoidance ⋮ 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 ⋮ 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 ⋮ New insights on the optimality conditions of the \(\ell_2-\ell_0\) minimization problem ⋮ 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 ⋮ Variational models for color image correction inspired by visual perception and neuroscience ⋮ Adaptive total variation and second-order total variation-based model for low-rank tensor completion ⋮ 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 ⋮ 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 ⋮ 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 ⋮ Primal-dual proximal splitting and generalized conjugation in non-smooth non-convex optimization ⋮ Convergence rates for an inertial algorithm of gradient type associated to a smooth non-convex minimization ⋮ A LogTVSCAD nonconvex regularization model for image deblurring in the presence of impulse noise ⋮ A parameterized Douglas-Rachford splitting algorithm for nonconvex optimization ⋮ Convergence of non-smooth descent methods using the Kurdyka-Łojasiewicz inequality ⋮ On convex envelopes and regularization of non-convex functionals without moving global minima ⋮ Nonconvex proximal incremental aggregated gradient method with linear convergence ⋮ Structured sparsity promoting functions ⋮ Convergence analysis of the generalized splitting methods for a class of nonconvex optimization problems ⋮ Computing Riemannian center of mass on Hadamard manifolds ⋮ Sparse mean-reverting portfolios via penalized likelihood optimization ⋮ A non-Euclidean gradient descent method with sketching for unconstrained matrix minimization ⋮ New analysis of linear convergence of gradient-type methods via unifying error bound conditions ⋮ Faster subgradient methods for functions with Hölderian growth ⋮ Local convergence of the Levenberg-Marquardt method under Hölder metric subregularity ⋮ A ``nonconvex+nonconvex approach for image restoration with impulse noise removal ⋮ An inexact augmented Lagrangian method for computing strongly orthogonal decompositions of tensors ⋮ An active set Barzilar-Borwein algorithm for \(l_0\) regularized optimization ⋮ 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 ⋮ A general double-proximal gradient algorithm for d.c. programming ⋮ On the geometric analysis of a quartic-quadratic optimization problem under a spherical constraint ⋮ 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 to equilibrium for time and space discretizations of the Cahn-Hilliard equation ⋮ Convergence properties of monotone and nonmonotone proximal gradient methods revisited ⋮ 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 ⋮ The proximity operator of the log-sum penalty ⋮ Minimization of non-smooth, non-convex functionals by iterative thresholding ⋮ Extrapolated smoothing descent algorithm for constrained nonconvex and nonsmooth composite problems ⋮ Splitting methods with variable metric for Kurdyka-Łojasiewicz functions and general convergence rates ⋮ Avoiding bad steps in Frank-Wolfe variants ⋮ Method of alternating projections for the general absolute value equation ⋮ Efficient low-rank regularization-based algorithms combining advanced techniques for solving tensor completion problems with application to color image recovering ⋮ Perturbation techniques for convergence analysis of proximal gradient method and other first-order algorithms via variational analysis ⋮ Fast optimization via inertial dynamics with closed-loop damping ⋮ A variable metric and Nesterov extrapolated proximal DCA with backtracking for a composite DC program ⋮ Proximal gradient method with extrapolation and line search for a class of non-convex and non-smooth problems ⋮ Analysis of a variable metric block coordinate method under proximal errors ⋮ Open issues and recent advances in DC programming and DCA ⋮ 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 structure noise-aware tensor dictionary learning method for high-dimensional data clustering ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Tensor train rank minimization with hybrid smoothness regularization for visual data recovery ⋮ An attention algorithm for solving large scale structured \(l_0\)-norm penalty estimation problems ⋮ Convergence of proximal algorithms with stepsize controls for non-linear inverse problems and application to sparse non-negative matrix factorization ⋮ A new approach to the proximal point method: convergence on general Riemannian manifolds ⋮ Continuous dynamics related to monotone inclusions and non-smooth optimization problems ⋮ Wavelet inpainting with the \(\ell_{0}\) sparse regularization ⋮ Relationship between the optimal solutions of least squares regularized with \(\ell_{0}\)-norm and constrained by \(k\)-sparsity ⋮ An inertial forward-backward algorithm for the minimization of the sum of two nonconvex functions ⋮ Weighted hyper-Laplacian prior with overlapping group sparsity for image restoration under Cauchy noise ⋮ Flows generating nonlinear eigenfunctions ⋮ Local convergence of the heavy-ball method and iPiano for non-convex optimization ⋮ Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems ⋮ A nonconvex formulation for low rank subspace clustering: algorithms and convergence analysis ⋮ An inexact proximal method for quasiconvex minimization ⋮ Global convergence of a proximal linearized algorithm for difference of convex functions ⋮ Techniques for gradient-based bilevel optimization with non-smooth lower level problems ⋮ Global optimality condition and fixed point continuation algorithm for non-Lipschitz \(\ell_p\) regularized matrix minimization ⋮ 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 ⋮ Convergence analysis of an SVD-based algorithm for the best rank-1 tensor approximation ⋮ An inertial Tseng's type proximal algorithm for nonsmooth and nonconvex optimization problems ⋮ A variational approach of the rank function ⋮ 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 ⋮ A primal dual active set with continuation algorithm for the \(\ell^0\)-regularized optimization problem ⋮ Peaceman-Rachford splitting for a class of nonconvex optimization problems ⋮ Proximal alternating linearized minimization for nonconvex and nonsmooth problems ⋮ Convergence of ADMM for multi-block nonconvex separable optimization models ⋮ An extension of proximal methods for quasiconvex minimization on the nonnegative orthant ⋮ Error bounds and Hölder metric subregularity ⋮ An extended sequential quadratically constrained quadratic programming algorithm for nonlinear, semidefinite, and second-order cone programming ⋮ Extragradient method in optimization: convergence and complexity ⋮ The value function approach to convergence analysis in composite optimization ⋮ An iterative support shrinking algorithm for non-Lipschitz optimization in image restoration ⋮ Variable metric forward-backward algorithm for minimizing the sum of a differentiable function and a convex function ⋮ A mathematical model for the 3D location estimation of 2D echocardiography data ⋮ Convergence analysis of difference-of-convex algorithm with subanalytic data ⋮ Nonconvex TGV regularization model for multiplicative noise removal with spatially varying parameters ⋮ Global convergence of ADMM in nonconvex nonsmooth optimization ⋮ 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 ⋮ The convergence rate analysis of the symmetric ADMM for the nonconvex separable optimization problems ⋮ Cauchy noise removal by nonconvex ADMM with convergence guarantees ⋮ An inexact PAM method for computing Wasserstein barycenter with unknown supports ⋮ On accelerating the regularized alternating least-squares algorithm for tensors ⋮ A proximal difference-of-convex algorithm with extrapolation ⋮ 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 ⋮ DC programming and DCA: thirty years of developments ⋮ GAITA: a Gauss-Seidel iterative thresholding algorithm for \(\ell_q\) regularized least squares regression ⋮ A projection method on measures sets ⋮ Approaching nonsmooth nonconvex minimization through second-order proximal-gradient dynamical systems ⋮ Variational contrast enhancement of gray-scale and RGB images ⋮ Convergence of iterative hard-thresholding algorithm with continuation ⋮ Stability of saddle points via explicit coderivatives of pointwise subdifferentials ⋮ Inertial alternating generalized forward-backward splitting for image colorization ⋮ A new globally convergent algorithm for non-Lipschitz \(\ell_{p}-\ell_q\) minimization ⋮ 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 ⋮ 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 ⋮ Local linear convergence of the alternating direction method of multipliers for nonconvex separable optimization problems ⋮ Kurdyka-Łojasiewicz property of zero-norm composite functions ⋮ Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods ⋮ Capped \(\ell_p\) approximations for the composite \(\ell_0\) regularization problem ⋮ Nonisometric surface registration via conformal Laplace-Beltrami basis pursuit ⋮ Acceleration of primal-dual methods by preconditioning and simple subproblem procedures ⋮ An accelerated IRNN-iteratively reweighted nuclear norm algorithm for nonconvex nonsmooth low-rank minimization problems ⋮ Effective two-stage image segmentation: a new non-Lipschitz decomposition approach with convergent algorithm ⋮ Nearly optimal first-order methods for convex optimization under gradient norm measure: an adaptive regularization approach ⋮ Dual descent methods as tension reduction systems ⋮ A block coordinate variable metric forward-backward algorithm ⋮ Proximal algorithms in statistics and machine learning ⋮ A block coordinate variable metric linesearch based proximal gradient method ⋮ Modified Fejér sequences and applications ⋮ Maximum time step for the BDF3 scheme applied to gradient flows ⋮ Priors with coupled first and second order differences for manifold-valued image processing ⋮ Whiteness constraints in a unified variational framework for image restoration ⋮ Toward fast transform 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 ⋮ A proximal point-type method for multicriteria optimization ⋮ An outer-inner linearization method for non-convex and nondifferentiable composite regularization problems ⋮ Level-set subdifferential error bounds and linear convergence of Bregman proximal gradient method ⋮ A block inertial Bregman proximal algorithm for nonsmooth nonconvex problems with application to symmetric nonnegative matrix tri-factorization ⋮ An optimally concentrated Gabor transform for localized time-frequency components ⋮ A preconditioned difference of convex algorithm for truncated quadratic regularization with application to imaging ⋮ Shifted eigenvalue decomposition method for computing C-eigenvalues of a piezoelectric-type tensor ⋮ An accelerated smoothing gradient method for nonconvex nonsmooth minimization in image processing ⋮ An inexact proximal gradient algorithm with extrapolation for a class of nonconvex nonsmooth optimization problems ⋮ A fundamental proof of convergence of alternating direction method of multipliers for weakly convex optimization ⋮ An ADMM-based SQP method for separably smooth nonconvex optimization ⋮ 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 ⋮ On solutions of sparsity constrained optimization ⋮ A note on the complexity of proximal iterative hard thresholding algorithm

Cites Work

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