期刊
SIAM JOURNAL ON OPTIMIZATION
卷 20, 期 2, 页码 602-626出版社
SIAM PUBLICATIONS
DOI: 10.1137/08071692X
关键词
multicriteria optimization; multiobjective programming; Pareto points; Newton's method
资金
- CNPq [480101/2008-6, 303583/2008-8]
- FAPERJ
We propose an extension of Newton's method for unconstrained multiobjective optimization (multicriteria optimization). This method does not use a priori chosen weighting factors or any other form of a priori ranking or ordering information for the different objective functions. Newton's direction at each iterate is obtained by minimizing the max-ordering scalarization of the variations on the quadratic approximations of the objective functions. The objective functions are assumed to be twice continuously differentiable and locally strongly convex. Under these hypotheses, the method, as in the classical case, is locally superlinear convergent to optimal points. Again as in the scalar case, if the second derivatives are Lipschitz continuous, the rate of convergence is quadratic. Our convergence analysis uses a Kantorovich-like technique. As a byproduct, existence of optima is obtained under semilocal assumptions.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据