Convergence Analysis of Perturbed Feasible Descent Methods
Author:
- 1 May 1997
- journal article
- research article
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 93 (2) , 337-353
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- On a global projection-type error bound for the linear complementarity problemLinear Algebra and its Applications, 1997
- Serial and parallel backpropagation convergence via nonmonotone perturbed minimizationOptimization Methods and Software, 1994
- Analysis of an approximate gradient projection method with applications to the backpropagation algorithmOptimization Methods and Software, 1994
- Error bounds and convergence analysis of feasible descent methods: a general approachAnnals of Operations Research, 1993
- On the Convergence of the LMS Algorithm with Adaptive Learning Rate for Linear Feedforward NetworksNeural Computation, 1991
- Convergence properties of the gradient method under conditions of variable-level interferenceUSSR Computational Mathematics and Mathematical Physics, 1990
- Some continuity properties of polyhedral multifunctions1981
- A stability analysis for perturbed nonlinear iterative methodsMathematics of Computation, 1976
- Constrained minimization methodsUSSR Computational Mathematics and Mathematical Physics, 1966
- Convex programming in Hilbert spaceBulletin of the American Mathematical Society, 1964