Newton’s method for multicriteria optimization

Fliege, Joerg, Drummond, Mauricio G. and Svaiter, Benar F. (2009) Newton’s method for multicriteria optimization. SIAM Journal on Optimization, 20 (2), 602-626. (doi:10.1137/08071692X).

Record type: Article

Abstract

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.

This record has no associated files available for download.