×

Inertial forward-backward methods for solving vector optimization problems. (English) Zbl 1402.90163

Summary: We propose two forward-backward proximal point type algorithms with inertial/memory effects for determining weakly efficient solutions to a vector optimization problem consisting in vector-minimizing with respect to a given closed convex pointed cone the sum of a proper cone-convex vector function with a cone-convex differentiable one, both mapping from a Hilbert space to a Banach one. Inexact versions of the algorithms, more suitable for implementation, are provided as well, while as a byproduct one can also derive a forward-backward method for solving the mentioned problem. Numerical experiments with the proposed methods are carried out in the context of solving a portfolio optimization problem.

MSC:

90C29 Multi-objective and goal programming
90C48 Programming in abstract spaces
90C51 Interior-point methods
Full Text: DOI

References:

[1] Alvarez, F; Attouch, H, An inertial proximal method for maximal monotone operators via discretization of a nonlinear oscillator with damping, Set-Valued Anal, 9, 3-11, (2001) · Zbl 0991.65056
[2] Alvarez, F, On the minimizing property of a second order dissipative system in Hilbert spaces, SIAM J Control Optim, 38, 1102-1119, (2000) · Zbl 0954.34053
[3] Buong, N, Inertial proximal point regularization algorithm for unconstrained vector convex optimization problems, Ukrainian Math J, 60, 1483-1491, (2008) · Zbl 1240.65195
[4] Bonnel, H; Iusem, AN; Svaiter, BF, Proximal methods in vector optimization, SIAM J Optim, 15, 953-970, (2005) · Zbl 1093.90054
[5] Miglierina, E; Molho, E; Recchioni, MC, Box-constrained multi-objective optimization: a gradient-like method without ‘a priori’ scalarization, Eur J Oper Res, 188, 662-682, (2008) · Zbl 1144.90482
[6] Graña Drummond, LM; Maculan, N; Svaiter, BF, On the choice of parameters for the weighting method in vector optimization, Math Program, 111, 201-216, (2008) · Zbl 1163.90021
[7] Fliege, J; Graña Drummond, LM; Svaiter, BF, Newton’s method for multiobjective optimization, SIAM J Optim, 20, 602-626, (2009) · Zbl 1195.90078
[8] Graña Drummond, LM; Iusem, AN, A projected gradient method for vector optimization problems, Comput Optim Appl, 28, 5-29, (2004) · Zbl 1056.90126
[9] Villacorta, KDV; Oliveira, PR, An interior proximal method in vector optimization, Eur J Oper Res, 214, 485-492, (2011) · Zbl 1244.90244
[10] Boţ, RI; Grad, S-M; Wanka, G, Duality in vector optimization, (2009), Springer-Verlag, Berlin · Zbl 1177.90355
[11] Opial, Z, Weak convergence of the sequence of successive approximations for nonexpansive mappings, Bull Am Math Soc, 73, 591-597, (1967) · Zbl 0179.19902
[12] Moudafi, A; Oliny, M, Convergence of a splitting inertial proximal method for monotone operators, J Comput Appl Math, 155, 447-454, (2003) · Zbl 1027.65077
[13] Beck, A; Teboulle, M, A fast iterative shrinkage-tresholding algorithm for linear inverse problems, SIAM J Imaging Sci, 2, 183-202, (2009) · Zbl 1175.94009
[14] Bauschke, HH; Combettes, PL, Convex analysis and monotone operator theory in Hilbert spaces. CMS Books in Mathematics/Ouvrages de mathématiques de la SMC, (2011), Springer-Verlag, New York (NY) · Zbl 1218.47001
[15] Bolintineanu, Ş, Approximate efficiency and scalar stationarity in unbounded nonsmooth convex vector optimization problems, J Optim Theory Appl, 106, 265-296, (2000) · Zbl 1003.49018
[16] Boţ, RI; Hendrich, C, A Douglas-Rachford type primal-dual method for solving inclusions with mixtures of composite and parallel-sum type monotone operators, SIAM J Optim, 23, 2541-2565, (2013) · Zbl 1295.47066
[17] Boţ, RI; Csetnek, ER; Heinrich, A, A primal-dual splitting algorithm for finding zeros of sums of maximal monotone operators, SIAM J Optim, 23, 2011-2036, (2013) · Zbl 1314.47102
[18] Aliprantis, CD; Florenzano, M; Martins-da-Rocha, VF; Tourky, R, Equilibrium analysis in financial markets with countably many securities, J Math Econ, 40, 683-699, (2004) · Zbl 1137.91395
[19] Gong, X-H, Optimality conditions for Henig and globally proper efficient solutions with ordering cone has empty interior, J Math Anal Appl, 307, 12-31, (2005) · Zbl 1112.90077
[20] Grad, S-M, Vector optimization and monotone operators via convex duality, (2015), Springer-Verlag, Cham · Zbl 1337.90080
[21] Grad, S-M; Pop, EL, Vector duality for convex vector optimization problems by means of the quasi interior of the ordering cone, Optimization, 63, 21-37, (2014) · Zbl 1287.49037
[22] Duan, YC, A multi-objective approach to portfolio optimization, Undergrad Math J, 8, 1, 18p, (2007)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.