Optimization Online


A quadratically convergent Newton method for vector optimization

L. M. Grana Drummond(lmgd***at***facc.ufrj.br)
F. M. P. Raupp(fraupp***at***puc-rio.br)
B. F. Svaiter(benar***at***impa.br)

Abstract: We propose a Newton method for solving smooth unconstrained vector optimization problems under partial orders induced by general closed convex pointed cones. The method extends the one proposed by Fliege, Grana Drummond and Svaiter for multicriteria, which in turn is an extension of the classical Newton method for scalar optimization. The steplength is chosen by means of an Armijo-like rule, guaranteeing an objective value decrease at each iteration. Under standard assumptions, we establish superlinear convergence to an efficient point. Additionally, as in the scalar case, assuming Lipschitz continuity of the second derivative of the objective vector-valued function, we prove Q-quadratic convergence.

Keywords: vector optimization, efficient points, convexity with respect to cones, Newton method

Category 1: Convex and Nonsmooth Optimization (Convex Optimization )

Category 2: Other Topics (Multi-Criteria Optimization )

Category 3: Nonlinear Optimization


Download: [PDF]

Entry Submitted: 07/27/2011
Entry Accepted: 07/27/2011
Entry Last Modified: 07/27/2011

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society