Convergence analysis of perturbed feasible descent methods
From MaRDI portal
Publication:1379956
Recommendations
- Error stability properties of generalized gradient-type algorithms
- Error bounds and convergence analysis of feasible descent methods: A general approach
- Convergence analysis of perturbed gradient methods and hybrid projection methods
- Convergence property of gradient-type methods with non-monotone line search in the presence of perturbations
- Convergence of algorithms for perturbed optimization problems
Cites work
- scientific article; zbMATH DE number 3534286 (Why is no real title available?)
- scientific article; zbMATH DE number 3310599 (Why is no real title available?)
- A Stability Analysis for Perturbed Nonlinear Iterative Methods
- An Incremental Gradient(-Projection) Method with Momentum Term and Adaptive Stepsize Rule
- Application Of Khobotov’s Algorithm To Variational Inequalities And Network Equilibrium Problems
- Computational methods in optimization. A unified approach.
- Convergence of Iterates of an Inexact Matrix Splitting Algorithm for the Symmetric Monotone Linear Complementarity Problem
- Convergence properties of the gradient method under conditions of variable-level interference
- Convex Analysis
- Convex programming in Hilbert space
- Error Bound and Convergence Analysis of Matrix Splitting Algorithms for the Affine Variational Inequality Problem
- Error bounds and convergence analysis of feasible descent methods: A general approach
- Error stability properties of generalized gradient-type algorithms
- Incremental Least Squares Methods and the Extended Kalman Filter
- Incremental gradient algorithms with stepsizes bounded away from zero
- Inexact Newton Methods
- Mathematical Programming in Neural Networks
- Modified Projection-Type Methods for Monotone Variational Inequalities
- Monotone Operators and the Proximal Point Algorithm
- New Error Bounds for the Linear Complementarity Problem
- New inexact parallel variable distribution algorithms
- On a global projection-type error bound for the linear complementarity problem
- On linear convergence of iterative methods for the variational inequality problem
- Remarks on Convergence of the Matrix Splitting Algorithm for the Symmetric Linear Complementarity Problem
- Some continuity properties of polyhedral multifunctions
- Two-Metric Projection Methods for Constrained Optimization
Cited in
(14)- Convergence property of gradient-type methods with non-monotone line search in the presence of perturbations
- A Unified Analysis of Descent Sequences in Weakly Convex Optimization, Including Convergence Rates for Bundle Methods
- Convergence of algorithms for perturbed optimization problems
- On the Convergence to Stationary Points of Deterministic and Randomized Feasible Descent Directions Methods
- Error stability properties of generalized gradient-type algorithms
- Descent methods with linesearch in the presence of perturbations
- On approximations with finite precision in bundle methods for nonsmooth optimization
- Bounded perturbation resilience of projected scaled gradient methods
- Perturbation techniques for convergence analysis of proximal gradient method and other first-order algorithms via variational analysis
- Convergence analysis of the ChebFilterCG algorithm
- Smooth sparse coding via marginal regression for learning sparse representations
- scientific article; zbMATH DE number 4092680 (Why is no real title available?)
- Error bounds and convergence analysis of feasible descent methods: A general approach
- Global convergence of the Dai-Yuan conjugate gradient method with perturbations
This page was built for publication: Convergence analysis of perturbed feasible descent methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1379956)
