Newton-like methods for efficient solutions in vector optimization

Thai Chuong ()

Computational Optimization and Applications, 2013, vol. 54, issue 3, 495-516

Abstract: In this work we study the Newton-like methods for finding efficient solutions of the vector optimization problem for a map from a finite dimensional Hilbert space X to a Banach space Y, with respect to the partial order induced by a closed, convex and pointed cone C with a nonempty interior. We present both exact and inexact versions, in which the subproblems are solved approximately, within a tolerance. Furthermore, we prove that under reasonable hypotheses, the sequence generated by our method converges to an efficient solution of this problem. Copyright Springer Science+Business Media, LLC 2013

Keywords: Vector optimization; Stationary point; Efficient solution; Newton-like methods; C-positive definite (search for similar items in EconPapers)
Date: 2013
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (8)

Downloads: (external link)
http://hdl.handle.net/10.1007/s10589-012-9495-6 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:coopap:v:54:y:2013:i:3:p:495-516

Ordering information: This journal article can be ordered from
http://www.springer.com/math/journal/10589

DOI: 10.1007/s10589-012-9495-6

Access Statistics for this article

Computational Optimization and Applications is currently edited by William W. Hager

More articles in Computational Optimization and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().