A new conic method for unconstrained minimization

Bacopoulos, A; Botsaris, CA

dc.contributor.author	Bacopoulos, A	en
dc.contributor.author	Botsaris, CA	en
dc.date.accessioned	2014-03-01T01:08:38Z
dc.date.available	2014-03-01T01:08:38Z
dc.date.issued	1992	en
dc.identifier.issn	0022-247X	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/10614
dc.relation.uri	http://www.scopus.com/inward/record.url?eid=2-s2.0-44049119535&partnerID=40&md5=d5f90f00ded4286266bcb62020aa881d	en
dc.subject.classification	Mathematics, Applied	en
dc.subject.classification	Mathematics	en
dc.title	A new conic method for unconstrained minimization	en
heal.type	journalArticle	en
heal.language	English	en
heal.publicationDate	1992	en
heal.abstract	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
heal.publisher	ACADEMIC PRESS INC JNL-COMP SUBSCRIPTIONS	en
heal.journalName	Journal of Mathematical Analysis and Applications	en
dc.identifier.isi	ISI:A1992HY65500002	en
dc.identifier.volume	167	en
dc.identifier.issue	1	en
dc.identifier.spage	12	en
dc.identifier.epage	31	en