Convergence of implementable descent algorithms for unconstrained optimization

Journal of Optimization Theory and Applications

Volumn 104, Issue 3, 2000, Pages 749-750

  Dussault, J P ^a  

^a UNIVERSITÉ DE SHERBROOKE   (Canada)

Author keywords

Descent algorithms; Global convergence

Indexed keywords

CLUSTERING ALGORITHMS; OPTIMIZATION;

CLUSTER POINTS; DESCENT ALGORITHM; DESCENT DIRECTIONS; GLOBAL CONVER-GENCE; NECESSARY OPTIMALITY CONDITION; OBJECTIVE FUNCTIONS; QUASICONVEX; STEP SIZE; UNCONSTRAINED OPTIMIZATION;

ITERATIVE METHODS;

EID: 0034147191     PISSN: 00223239     EISSN: None     Source Type: Journal    
DOI: 10.1023/a:1004602012151     Document Type: Article

References (3)

1. 1. IUSEM, A. N., and SVAITER, B. F., A Proximal Regularization of the Steepest Descent Method, RAIRO-Recherche Opérationnelle, Vol. 29, pp. 123-130, 1995.
2. 2. ARMIJO, L., Minimum of Functions Having Lipschitz-Continuous First Partial Derivatives, Pacific Journal of Mathematics, Vol. 16, pp. 1-3, 1966.
3. 3. WOLFE, P., Convergence Conditions for Ascent Methods, SIAM Review, Vol. 11, pp. 226-235, 1969.