On linear convergence of gradient-type minimization algorithms

Journal of Optimization Theory and Applications

Volumn 98, Issue 2, 1998, Pages 475-487

  Gaviano, M ^a   Lera, D ^a  

^a UNIVERSITY OF CAGLIARI   (Italy)

Author keywords

Convergence rates; Convex programming; Descent algorithms; Optimization algorithms

Indexed keywords

CONVERGENCE RATES; DESCENT ALGORITHM; GRADIENT TYPE; LINEAR CONVERGENCE; LOCAL MINIMUMS; MINIMIZATION ALGORITHMS; MINIMIZATION PROBLEMS; OPTIMIZATION ALGORITHMS; REAL-VALUED FUNCTIONS; UNIFORM CONVEXITY;

CONVEX OPTIMIZATION;

EID: 0032382835     PISSN: 00223239     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1022601920647     Document Type: Article

References (4)

1. ALLWRIGHT, J. C., Global Convergence Rates for Descent Algorithms: Improved Results for Strictly Convex Problems, Journal of Optimization Theory and Applications, Vol. 26, pp. 367-372, 1978.
2. POLAK, E., Computational Methods in Optimization: A Unified Approach, Academic Press, New York, New York, 1971.
3. ORTEGA, J. M., and RHEINBOLDT, W. C., Iterative Solution of Nonlinear Equations in Several Variables, Academic Press, New York, New York, 1970.
4. KANTOROVIČ, L. V., and AKILOV, G. P., Functional Analysis in Normed Spaces, Pergamon Press, Oxford, England, 1964.