Pages that link to "Item:Q1806023"

The following pages link to Linear convergence of epsilon-subgradient descent methods for a class of convex functions (Q1806023):

Displaying 21 items.

• Nomonotone spectral gradient method for sparse recovery (Q256063) (← links)
• New approach to the \(\eta \)-proximal point algorithm and nonlinear variational inclusion problems (Q613240) (← links)
• Convergence rates of subgradient methods for quasi-convex optimization problems (Q782917) (← links)
• A coordinate gradient descent method for nonsmooth separable minimization (Q959979) (← links)
• On Rockafellar's theorem using proximal point algorithm involving \(H\)-maximal monotonicity framework (Q1026379) (← links)
• Super-relaxed \((\eta)\)-proximal point algorithms, relaxed \((\eta)\)-proximal point algorithms, linear convergence analysis, and nonlinear variational inclusions (Q1035134) (← links)
• On the convergence of conditional \(\varepsilon\)-subgradient methods for convex programs and convex-concave saddle-point problems. (Q1410305) (← links)
• Computational efficiency of the simplex embedding method in convex nondifferentiable optimization (Q1644014) (← links)
• On the convergence of primal-dual hybrid gradient algorithms for total variation image restoration (Q1932983) (← links)
• Randomized smoothing variance reduction method for large-scale non-smooth convex optimization (Q2033403) (← links)
• Generalized Eckstein-Bertsekas proximal point algorithm based ona-maximal monotonicity design (Q2519532) (← links)
• Generalized Eckstein-Bertsekas proximal point algorithm involving \((H,\eta )\)-monotonicity framework (Q2643765) (← links)
• Scaling techniques for \(\epsilon\)-subgradient methods (Q2817840) (← links)
• Subgradient and Bundle Methods for Nonsmooth Optimization (Q2838345) (← links)
• Comparing different nonsmooth minimization methods and software (Q2885467) (← links)
• Gradient-based method with active set strategy for $\ell _1$ optimization (Q4605700) (← links)
• Survey Descent: A Multipoint Generalization of Gradient Descent for Nonsmooth Optimization (Q5883313) (← links)
• A Unified Analysis of Descent Sequences in Weakly Convex Optimization, Including Convergence Rates for Bundle Methods (Q5883316) (← links)
• A bundle-like progressive hedging algorithm (Q6137253) (← links)
• Linear convergence of the derivative-free proximal bundle method on convex nonsmooth functions, with application to the derivative-free \(\mathcal{VU}\)-algorithm (Q6564758) (← links)
• Weak convexity and approximate subdifferentials (Q6644255) (← links)