Pages that link to "Item:Q1379956"
From MaRDI portal
The following pages link to Convergence analysis of perturbed feasible descent methods (Q1379956):
Displaying 13 items.
- Global convergence of the Dai-Yuan conjugate gradient method with perturbations (Q263134) (← links)
- Smooth sparse coding via marginal regression for learning sparse representations (Q309913) (← links)
- On approximations with finite precision in bundle methods for nonsmooth optimization (Q597165) (← links)
- Error stability properties of generalized gradient-type algorithms (Q1273917) (← links)
- Error bounds and convergence analysis of feasible descent methods: A general approach (Q1312756) (← links)
- Descent methods with linesearch in the presence of perturbations (Q1360171) (← links)
- Perturbation techniques for convergence analysis of proximal gradient method and other first-order algorithms via variational analysis (Q2116020) (← links)
- Convergence property of gradient-type methods with non-monotone line search in the presence of perturbations (Q2489332) (← links)
- (Q3819917) (← links)
- On the Convergence to Stationary Points of Deterministic and Randomized Feasible Descent Directions Methods (Q5210513) (← links)
- Convergence analysis of the ChebFilterCG algorithm (Q5355095) (← links)
- A Unified Analysis of Descent Sequences in Weakly Convex Optimization, Including Convergence Rates for Bundle Methods (Q5883316) (← links)
- Bounded perturbation resilience of projected scaled gradient methods (Q5963677) (← links)
