Pages that link to "Item:Q2349844"

The following pages link to Splitting methods with variable metric for Kurdyka-Łojasiewicz functions and general convergence rates (Q2349844):

Displaying 42 items.

• Variable Metric Forward-Backward Algorithm for Composite Minimization Problems (Q4989931) (← links)
• On a general smoothly truncated regularization for variational piecewise constant image restoration: construction and convergent algorithms (Q5000580) (← links)
• Proximal Gradient Methods for Machine Learning and Imaging (Q5028165) (← links)
• Asynchronous variance-reduced block schemes for composite non-convex stochastic optimization: block-specific steplengths and adapted batch-sizes (Q5038180) (← links)
• Thresholding gradient methods in Hilbert spaces: support identification and linear convergence (Q5109200) (← links)
• The Proximal Alternating Direction Method of Multipliers in the Nonconvex Setting: Convergence Analysis and Rates (Q5119852) (← links)
• General descent method using w-distance. Application to emergence of habits following worthwhile moves (Q5121449) (← links)
• Convergence of Inexact Forward--Backward Algorithms Using the Forward--Backward Envelope (Q5131965) (← links)
• Sharpness, Restart, and Acceleration (Q5210521) (← links)
• Greedy approximate projection for magnetic resonance fingerprinting with partial volumes (Q5220316) (← links)
• Adaptive FISTA for Nonconvex Optimization (Q5235485) (← links)
• Complexity of a Quadratic Penalty Accelerated Inexact Proximal Point Method for Solving Linearly Constrained Nonconvex Composite Programs (Q5237309) (← links)
• Proximal Heterogeneous Block Implicit-Explicit Method and Application to Blind Ptychographic Diffraction Imaging (Q5250001) (← links)
• A comparison of edge-preserving approaches for differential interference contrast microscopy (Q5356959) (← links)
• The Variable Metric Forward-Backward Splitting Algorithm Under Mild Differentiability Assumptions (Q5363380) (← links)
• Learnable Descent Algorithm for Nonsmooth Nonconvex Image Reconstruction (Q5860374) (← links)
• Extrapolated Proximal Subgradient Algorithms for Nonconvex and Nonsmooth Fractional Programs (Q5868963) (← links)
• Hölderian Error Bounds and Kurdyka-Łojasiewicz Inequality for the Trust Region Subproblem (Q5870365) (← links)
• On an iteratively reweighted linesearch based algorithm for nonconvex composite optimization (Q6042933) (← links)
• An extrapolated iteratively reweighted \(\ell_1\) method with complexity analysis (Q6043137) (← links)
• The convergence properties of infeasible inexact proximal alternating linearized minimization (Q6074854) (← links)
• A class of modified accelerated proximal gradient methods for nonsmooth and nonconvex minimization problems (Q6145571) (← links)
• Linear Convergence of a Proximal Alternating Minimization Method with Extrapolation for \(\boldsymbol{\ell_1}\) -Norm Principal Component Analysis (Q6158000) (← links)
• An accelerated proximal algorithm for regularized nonconvex and nonsmooth bi-level optimization (Q6161202) (← links)
• Convergence of Random Reshuffling under the Kurdyka–Łojasiewicz Inequality (Q6161313) (← links)
• A forward-backward algorithm with different inertial terms for structured non-convex minimization problems (Q6163956) (← links)
• The operator splitting schemes revisited: primal-dual gap and degeneracy reduction by a unified analysis (Q6181369) (← links)
• Proximal gradient method with extrapolation and line search for a class of non-convex and non-smooth problems (Q6182324) (← links)
• Template-based image reconstruction facing different topologies (Q6191359) (← links)
• Convergence Analysis for Bregman Iterations in Minimizing a Class of Landau Free Energy Functionals (Q6194524) (← links)
• Analysis of a variable metric block coordinate method under proximal errors (Q6195234) (← links)
• A boosted-DCA with power-sum-DC decomposition for linearly constrained polynomial programs (Q6536842) (← links)
• Convergence analysis of block majorize-minimize subspace approach (Q6542454) (← links)
• A structured L-BFGS method and its application to inverse problems (Q6557640) (← links)
• The level-set subdifferential error bound via Moreau envelopes (Q6561484) (← links)
• Bregman methods for large-scale optimization with applications in imaging (Q6606442) (← links)
• Extended angle conditions for the study of the asymptotic behaviour of some continuous and discrete forced dynamical systems (Q6615617) (← links)
• Eigenvalue programming beyond matrices (Q6624432) (← links)
• A VMiPG method for composite optimization with nonsmooth term having no closed-form proximal mapping (Q6639509) (← links)
• Gradient descent provably escapes saddle points in the training of shallow ReLU networks (Q6655804) (← links)
• Abstract generalized epsilon-descent algorithm (Q6658462) (← links)
• Optimization models and approaches for strongly correlated electrons systems (Q6665191) (← links)