A Newton-Like Method for Variable Order Vector Optimization Problems
- 155 Downloads
A Newton approach is proposed for solving variable order smooth constrained vector optimization problems. The concept of strong convexity is presented, and its properties are analyzed. It is thus obtained that the Newton direction is well defined and that the algorithm converges. Moreover, the rate of convergence is obtained under ordering structures satisfying a mild hypothesis.
KeywordsDescent direction Efficient points K-strong convexity Newton method Variable order vector optimization
Mathematics Subject Classification90C29 90C30 26B25 65K05
The first author was partially supported by CNPq Grants 458479/2014-4 and 3122077/2014-9, the second author was partially supported by CAPES/FAPEG 10/2013 and 08/2014, and the third author was partially supported by CAPES, CAPES/MES/Cuba Project 226/2012 Optimization and Applications. The second author was also partially supported by Alexander von Humboldt Foundation during his stay at Martin Luther University, where part of this research was carried out.