GENERAL DESCENT ALGORITHM ON AFFINE MANIFOLDS
2001
We study stopping and convergence criteria for the general descent algorithm, with affine differential notions and techniques only. An example is provided which shows that this framework is more natural for optimization problems than the Riemannian one. Mathematical Subject Classification: 49M10, 90C30, 53B05 .
Keywords:
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
4
References
3
Citations
NaN
KQI