Show simple item record

dc.contributor.authorKetabchi, S.
dc.contributor.authorParandegan, M.
dc.contributor.authorNavidi, H.
dc.date.accessioned2020-08-31T07:45:46Z
dc.date.available2020-08-31T07:45:46Z
dc.date.issued2009en_US
dc.identifier.citationKetabci, S., Parandegan, M. ve Navidi, H. (2009). Armijo rule and strong wolfe line search in generalized newton method. Maltepe Üniversitesi. s. 350.en_US
dc.identifier.isbn9786052124154
dc.identifier.urihttps://hdl.handle.net/20.500.12415/6097
dc.description.abstractThe line search method is one of the two fundamental strategies to solve unconstrained optimization problem that have been developed up to now. The second strategy is trust region method. In the line search method, the success of the algorithm not only depends on well-chosen search direction but also well-chosen step length. In this paper we compare the Armijo step size regulation and Strong Wolfe conditions in generalized Newton algorithm to minimizing a piecewise quadratic convex function. This function arises from dual exterior penalty problem for the problem of finding normal solution of the system of linear equalities. Numerical experience for systems which are selected in NETLIB indicates the behavior of the two inexact line searches differs markedly.en_US
dc.language.isoengen_US
dc.publisherMaltepe Üniversitesien_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.rightsCC0 1.0 Universal*
dc.rights.urihttp://creativecommons.org/publicdomain/zero/1.0/*
dc.titleArmijo rule and strong wolfe line search in generalized newton methoden_US
dc.typeconferenceObjecten_US
dc.relation.journalInternational Conference of Mathematical Sciencesen_US
dc.contributor.departmentMaltepe Üniversitesi, İnsan ve Toplum Bilimleri Fakültesien_US
dc.identifier.startpage350en_US
dc.identifier.endpage351en_US
dc.relation.publicationcategoryUluslararası Konferans Öğesi - Başka Kurum Yazarıen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

info:eu-repo/semantics/openAccess
Except where otherwise noted, this item's license is described as info:eu-repo/semantics/openAccess