期刊
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS
卷 54, 期 3, 页码 473-493出版社
SPRINGER
DOI: 10.1007/s10589-012-9501-z
关键词
Weak efficiency; Multiobjective optimization; Projected gradient method; Vector optimization
资金
- Fundacao de Amparo a Pesquisa do Estado de Sao Paulo [2010/20572-0]
- Fundacao de Amparo a Pesquisa do Estado de Rio de Janeiro
- Conselho Nacional de Desenvolvimento Cientifico e Tecnologico [480101/2008-6]
- Fundacao de Amparo a Pesquisa do Estado de Sao Paulo (FAPESP) [10/20572-0] Funding Source: FAPESP
In this work, we propose an inexact projected gradient-like method for solving smooth constrained vector optimization problems. In the unconstrained case, we retrieve the steepest descent method introduced by Graa Drummond and Svaiter. In the constrained setting, the method we present extends the exact one proposed by Graa Drummond and Iusem, since it admits relative errors on the search directions. At each iteration, a decrease of the objective value is obtained by means of an Armijo-like rule. The convergence results of this new method extend those obtained by Fukuda and Graa Drummond for the exact version. For partial orders induced by both pointed and nonpointed cones, under some reasonable hypotheses, global convergence to weakly efficient points of all sequences generated by the inexact projected gradient method is established for convex (respect to the ordering cone) objective functions. In the convergence analysis we also establish a connection between the so-called weighting method and the one we propose.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据