×

A proximal bundle-based algorithm for nonsmooth constrained multiobjective optimization problems with inexact data. (English) Zbl 1483.90152

Summary: In this paper, a proximal bundle-based method for solving nonsmooth nonconvex constrained multiobjective optimization problems with inexact information is proposed and analyzed. In this method, each objective function is treated individually without employing any scalarization. Using the improvement function, we transform the problem into an unconstrained one. At each iteration, by the proximal bundle method, a piecewise linear model is built and by solving a convex subproblem, a new candidate iterate is obtained. For locally Lipschitz objective and constraint functions, we study the problem of computing an approximate substationary point (a substationary point), when only inexact (exact) information about the functions and subgradient values are accessible. At the end, some numerical experiments are provided to illustrate the effectiveness of the method and certify the theoretical results.

MSC:

90C29 Multi-objective and goal programming
90C26 Nonconvex programming, global optimization
49J52 Nonsmooth analysis
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Bagirov, AM; Karmitsa, N.; Mäkelä, MM, Introduction to nonsmooth optimization: theory, practice and software (2014), New York: Springer, New York · Zbl 1312.90053 · doi:10.1007/978-3-319-08114-4
[2] Bonnel, H.; Iusem, AN; Svaiter, BF, Proximal methods in vector optimization, SIAM J. Optim., 15, 953-970 (2005) · Zbl 1093.90054 · doi:10.1137/S1052623403429093
[3] Clarke, FH; Ledyaev, YS; Stern, RJ; Wolenski, PR, Nonsmooth analysis and control theory (1998), New York: Springer, New York · Zbl 1047.49500
[4] Dolan, ED; Moré, JJ, Benchmarking optimization software with performance profiles, Math. Program., 91, 2, 201-213 (2002) · Zbl 1049.90004 · doi:10.1007/s101070100263
[5] Gal, T., Hanne, T.: On the development and future aspects of vector optimization and MCDM. In: Cláco, J. (ed.) Multicriteria analysis, pp 130-145. Springer, Berlin (1997) · Zbl 0897.90165
[6] Gebken, B.; Peitz, S., An efficient descent method for locally lipschitz multiobjective optimization problems, J. Optim. Theory Appl., 188, 696-723 (2021) · Zbl 1469.90130 · doi:10.1007/s10957-020-01803-w
[7] Gupta, A.; Mehra, A.; Bhatia, D., Approximate convexity in vector optimisation, Bull. Aust. Math. Soc., 74, 207-218 (2006) · Zbl 1133.90013 · doi:10.1017/S0004972700035656
[8] Hare, W.; Sagastizábal, C., A redistributed proximal bundle method for nonconvex optimization, SIAM J. Optim., 20, 2442-2473 (2010) · Zbl 1211.90183 · doi:10.1137/090754595
[9] Hare, W.; Sagastizábal, C.; Solodov, M., A proximal bundle method for nonsmooth nonconvex functions with inexact information, Comput. Optim. Appl., 63, 1-28 (2016) · Zbl 1343.90069 · doi:10.1007/s10589-015-9762-4
[10] Hintermüller, M., A proximal bundle method based on approximate subgradients, Comput. Optim. Appl., 20, 245-266 (2001) · Zbl 1054.90053 · doi:10.1023/A:1011259017643
[11] Hiriart-Urruty, J-B, New concepts in nondifferentiable programming, Bull. Soc. Math. France, 60, 57-85 (1979) · Zbl 0469.90071
[12] Hoseini Monjezi, N.; Nobakhtian, S., A filter proximal bundle method for nonsmooth nonconvex constrained optimization, J. Glob. Optim., 79, 1-37 (2021) · Zbl 1465.90073 · doi:10.1007/s10898-020-00939-3
[13] Hoseini Monjezi, N.; Nobakhtian, S., A new infeasible proximal bundle algorithm for nonsmooth nonconvex constrained optimization, Comput. Optim. Appl., 74, 443-480 (2019) · Zbl 1425.90084 · doi:10.1007/s10589-019-00115-8
[14] Hoseini Monjezi, N., Nobakhtian, S.: An inexact multiple proximal bundle algorithm for nonsmooth nonconvex multiobjective optimization problems. Ann. Oper. Res. doi:10.1007/s10479-020-03808-0 (2020) · Zbl 1425.90084
[15] Joki, K.; Bagirov, AM; Karmitsa, N.; Mäkelä, MM, A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes, J. Global Optim., 68, 501-535 (2017) · Zbl 1369.90137 · doi:10.1007/s10898-016-0488-3
[16] Joki, K.; Bagirov, AM; Karmitsa, N.; Mäkelä, MM; Taheri, S., Double bundle method for finding Clarke stationary points in nonsmooth DC programming, SIAM J. Optim., 28, 2, 1892-1919 (2018) · Zbl 1401.90170 · doi:10.1137/16M1115733
[17] Kiwiel, KC, A descent method for nonsmooth convex multiobjective minimization, Large Scale Syst., 8, 119-129 (1985) · Zbl 0564.90068
[18] Kiwiel, KC, Approximations in proximal bundle methods and decomposition of convex programs, J. Optim. Theory Appl., 84, 529-548 (1995) · Zbl 0824.90110 · doi:10.1007/BF02191984
[19] Lemaréchal, C.: Bundle methods in nonsmooth optimization. In: Lemaréchal, C., Mifflin, R. (eds.) Nonsmooth optimization (Laxenburg, 1977). IIASA Proc. Ser. 3, pp 79-102. Pergamon Press, Oxford (1978) · Zbl 0398.90088
[20] Lv, J.; Pang, L.; Xu, N.; Xiao, Z., An infeasible bundle method for nonconvex constrained optimization with application to semi-infinite programming problems, Numer. Algor., 80, 397-427 (2019) · Zbl 1410.90169 · doi:10.1007/s11075-018-0490-6
[21] Lv, J.; Xiao, Z.; Pang, L., An incremental bundle method for portfolio selection problem under second-order stochastic dominance, Numer. Algor., 85, 653-681 (2020) · Zbl 1461.91281 · doi:10.1007/s11075-019-00831-6
[22] Mäkelä, M.M., Karmitsa, N., Wilppu, O.: Multiobjective proximal bundle method for nonsmooth optimization. No. 1120. TUCS, Technical Report (2014)
[23] Miettinen, K., Nonlinear multiobjective optimization (1999), Berlin: Springer Science & Business Media, Berlin · Zbl 0949.90082
[24] Miettinen, K.; Mäkelä, MM, An interactive method for nonsmooth multiobjective optimization with an application to optimal control, Optim. Methods Softw., 2, 31-44 (1993) · doi:10.1080/10556789308805533
[25] Montonen, O.; Karmitsa, N.; Mäkelä, MM, Multiple subgradient descent bundle method for convex nonsmooth multiobjective optimization, Optimization, 67, 139-158 (2018) · Zbl 1398.90158 · doi:10.1080/02331934.2017.1387259
[26] Noll, D., Cutting plane oracles to minimize non-smooth non-convex functions, Set-valued Var. Anal., 18, 531-568 (2010) · Zbl 1219.49013 · doi:10.1007/s11228-010-0159-3
[27] Noll, D.: Bundle method for non-convex minimization with inexact subgradients and function values. In: Computational and Analytical Mathematics, pp 555-592. Springer, New York (2013) · Zbl 1282.90241
[28] de Oliveira, W., Solodov, M.: Bundle methods for inexact data. In: Numerical Nonsmooth Optimization, pp 417-459. Springer, Cham (2020)
[29] Sagastizábal, C., Divide to conquer: decomposition methods for energy optimization, Math. Program. B., 137, 187-222 (2012) · Zbl 1254.90238 · doi:10.1007/s10107-012-0570-7
[30] Schütze, V.; Coello, C., Computing the set of epsilon-efficient solutions in multi-objective space mission design, J. Aerosp. Comput. Inf. Commun., 8, 53-70 (2011) · doi:10.2514/1.46478
[31] Solodov, MV, On approximations with finite precision in bundle methods for nonsmooth optimization, J. Optim. Theory Appl., 119, 151-165 (2003) · Zbl 1094.90046 · doi:10.1023/B:JOTA.0000005046.70410.02
[32] White, DJ, A bibliography on the applications of mathematical programming multiple objective methods, J. Oper. Res. Soc., 41, 669-691 (1990) · Zbl 0707.90083 · doi:10.1057/jors.1990.97
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.