A new conic method for unconstrained minimization

 
see the original item page
in the repository's web site and access all digital files if the item*
share




1992 (EN)
A new conic method for unconstrained minimization (EN)

Botsaris, CA (EN)
Bacopoulos, A (EN)

N/A (EN)

A new algorithm for unconstrained minimization is presented which is based on a conic model. The algorithm converges in (n + 1) iterations on conic functions of n variables and it does not require evaluation or estimation of the matrix of second partial derivatives. Numerical results on many standard general test functions indicate that the algorithm is very robust and superior in function evaluations and number of iterations to the corresponding quadratic method. © 1992. (EN)

journalArticle

Εθνικό Μετσόβιο Πολυτεχνείο (EL)
National Technical University of Athens (EN)

Journal of Mathematical Analysis and Applications (EN)

1992


ACADEMIC PRESS INC JNL-COMP SUBSCRIPTIONS (EN)



*Institutions are responsible for keeping their URLs functional (digital file, item page in repository site)