Convergence analysis of perturbed feasible descent methods
From MaRDI portal
Publication:1379956
DOI10.1023/A:1022602123316zbMath0899.90149OpenAlexW1524647815MaRDI QIDQ1379956
Publication date: 1997
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1022602123316
Related Items (8)
A Unified Analysis of Descent Sequences in Weakly Convex Optimization, Including Convergence Rates for Bundle Methods ⋮ Smooth sparse coding via marginal regression for learning sparse representations ⋮ Descent methods with linesearch in the presence of perturbations ⋮ On approximations with finite precision in bundle methods for nonsmooth optimization ⋮ Convergence property of gradient-type methods with non-monotone line search in the presence of perturbations ⋮ Bounded perturbation resilience of projected scaled gradient methods ⋮ Error stability properties of generalized gradient-type algorithms ⋮ Global convergence of the Dai-Yuan conjugate gradient method with perturbations
Cites Work
- Unnamed Item
- Unnamed Item
- On a global projection-type error bound for the linear complementarity problem
- Computational methods in optimization. A unified approach.
- Incremental gradient algorithms with stepsizes bounded away from zero
- Error stability properties of generalized gradient-type algorithms
- Error bounds and convergence analysis of feasible descent methods: A general approach
- New inexact parallel variable distribution algorithms
- On linear convergence of iterative methods for the variational inequality problem
- Application Of Khobotov’s Algorithm To Variational Inequalities And Network Equilibrium Problems
- Two-Metric Projection Methods for Constrained Optimization
- Some continuity properties of polyhedral multifunctions
- Inexact Newton Methods
- Convergence of Iterates of an Inexact Matrix Splitting Algorithm for the Symmetric Monotone Linear Complementarity Problem
- Error Bound and Convergence Analysis of Matrix Splitting Algorithms for the Affine Variational Inequality Problem
- A Stability Analysis for Perturbed Nonlinear Iterative Methods
- Monotone Operators and the Proximal Point Algorithm
- Mathematical Programming in Neural Networks
- An Incremental Gradient(-Projection) Method with Momentum Term and Adaptive Stepsize Rule
- Remarks on Convergence of the Matrix Splitting Algorithm for the Symmetric Linear Complementarity Problem
- New Error Bounds for the Linear Complementarity Problem
- Convergence properties of the gradient method under conditions of variable-level interference
- Modified Projection-Type Methods for Monotone Variational Inequalities
- Incremental Least Squares Methods and the Extended Kalman Filter
- Convex programming in Hilbert space
- Convex Analysis
This page was built for publication: Convergence analysis of perturbed feasible descent methods
