References
- Moreau JJ. Proximité et dualité dans un espace Hilbertien. Bull Soc Math France. 1965;93:273–299. doi: https://doi.org/10.24033/bsmf.1625
- Martinet B. Régularisation d'inéquations variationnelles par approximations successives. Rev Française Informat Recherche Opérationnelle. 1970;4(Ser. (R-3)):154–158.
- Rockafellar RT. Monotone operators and the proximal point algorithm. SIAM J Control Optim. 1976;14:877–898. doi: https://doi.org/10.1137/0314056
- Bonnel H, Iusem AN, Svaiter BF. Proximal methods in vector optimization. SIAM J Optim. 2005;15:953–970. doi: https://doi.org/10.1137/S1052623403429093
- Cruz Neto JX, Oliveira PR, Soubeyran A, et al. A generalized proximal linearized algorithm for DC functions with application to the optimal size of the firm problem. Ann Oper Res. 2018: 1–27. doi:https://doi.org/10.1007/s10479-018-3104-8.
- Luc DT. Theory of vector optimization. New York: Springer-Verlag; 1989. (Lecture Notes in Econom. and Math. Syst).
- Bento GC, Soubeyran A. A proximal point-type method for multicriteria optimization. Set-Valued Var Anal. 2014;22:557–573. doi: https://doi.org/10.1007/s11228-014-0279-2
- Villacorta KDV, Oliveira PR. An interior proximal method in vector optimization. Euro J Oper Res. 2011;214:485–492. doi: https://doi.org/10.1016/j.ejor.2011.05.006
- Apolinário HCF, Papa Quiroz EA, Oliveira PR. A scalarization proximal point method for quasiconvex multiobjective minimization. J Global Optim. 2015;64:79–96. doi: https://doi.org/10.1007/s10898-015-0367-3
- Gregório R, Oliveira PR. A logarithmic-quadratic proximal point scalarization method for multiobjective programming. J Global Optim. 2010;49:281–291. doi: https://doi.org/10.1007/s10898-010-9544-6
- Fukuda EH, Graña Drummond LM, Raupp FMP. A barrier-type method for multiobjective optimization. Optimization. 2019. doi:https://doi.org/10.1080/02331934.2019.1576667.
- Bento GC, Bitar SDB, Cruz Neto JX, et al. A proximal point method for difference of convex functions in multi-objective optimization with application to group dynamic problems. Comput Optim Appl. 2019;1–28. doi:https://doi.org/10.1007/s10589-019-00139-0.
- Souza JCO, Oliveira PR. A proximal point algorithm for DC functions on Hadamard manifolds. J Global Optim. 2015;63(4):797–810. doi: https://doi.org/10.1007/s10898-015-0282-7
- Souza JCO, Oliveira PR, Soubeyran A. Global convergence of a proximal linearized algorithm for difference of convex functions. Optim Lett. 2016;10(7):1529–1539. doi: https://doi.org/10.1007/s11590-015-0969-1
- Qu S, Goh M, Wu S-Y, et al. Multiobjective DC programs with infinite convex constraints. J Global Optim. 2014;59:41–58. doi: https://doi.org/10.1007/s10898-013-0091-9
- Custódio L, Madeira JFA, Vaz IF, et al. Direct multisearch for multiobjective optimization. SIAM J Optim. 2011;21:1109–1140. doi: https://doi.org/10.1137/10079731X
- Clarke FH. Optimization and nonsmooth analysis. Classics in Applied Mathematics 5. Philadelphia: Siam; 1990.
- Clarke FH. Generalized gradients and applications. Trans. Amer. Math. Soc. 1975;205:247–262. doi: https://doi.org/10.1090/S0002-9947-1975-0367131-6
- Thibault L. Subdifferentials of nonconvex vector-valued functions. J Math Anal Appl. 1982;86:319–344. doi: https://doi.org/10.1016/0022-247X(82)90226-8
- Luc DTL, Tan NX, Tinh PN. Convex vector functions and their subdifferential. Acta Math Vietnam. 1998;23:107–127.
- Bento GC, Cruz Neto JX, López G, et al. The proximal point method for locally Lipschitz functions in multiobjective optimization with application to the compromise problem. SIAM J Optim. 2018;28(2):1104–1120. doi: https://doi.org/10.1137/16M107534X
- Minami M. Weak pareto-optimal necessary conditions in a nondifferentiable multiobjective program on a Banach space. J Optim Theory Appl. 1983;41:451–461. doi: https://doi.org/10.1007/BF00935364
- Burke JV, Ferris MC, Qian M. On the Clarke subdifferential of the distance function of a closed set. J Math Anal Appl. 1992;166:199–213. doi: https://doi.org/10.1016/0022-247X(92)90336-C
- Bregman LM. The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming. USSR Comput Math Math Phys. 1967;7:200–217. doi: https://doi.org/10.1016/0041-5553(67)90040-7
- Burachik RS, Iusem AN. A generalized proximal point algorithm for the variational inequality problem in a Hilbert space. SIAM J Optim. 1998;8:197–216. doi: https://doi.org/10.1137/S1052623495286302
- Censor Y, Zenios SA. The proximal minimization algorithm with with D-functions. J Optim Theory Appl. 1992;73:451–464. doi: https://doi.org/10.1007/BF00940051
- Chen G, Teboulle M. Convergence analysis of a proximal-like optimization algorithm using Bregman functions. SIAM J Optim. 1993;3:538–543. doi: https://doi.org/10.1137/0803026
- Eckstein J. Nonlinear proximal point algorithms using Bregman functions, with applications to convex programming. Math Oper Res. 1993;18:202–226. doi: https://doi.org/10.1287/moor.18.1.202
- Kiwiel KC. Proximal minimization methods with generalized Bregman functions. SIAM J Control Optim. 1997;35:1142–1168. doi: https://doi.org/10.1137/S0363012995281742
- Cruz Neto JX, Lopes JO, Santos PSM, et al. An interior proximal linearized method for DC programming based on Bregman distance or second order homogeneous kernels. Optimization. 2019;68(7):1305–1319. doi: https://doi.org/10.1080/02331934.2018.1476859
- Huang RP, Qu SJ, Yang XG, et al. Multi-stage distributionally robust optimization with risk aversion. J Ind Manag Optim. doi:https://doi.org/10.3934/jimo.2019109.
- Chen Z, Huang XX, Yang XQ. Generalized proximal point algorithms for multiobjective optimization problems. Appl Anal. 2011;90:935–949. doi: https://doi.org/10.1080/00036811.2010.483428
- Burachik RS, Scheimberg S. A proximal point method for the variational inequality problem in Banach spaces. SIAM J Control Optim. 2000;39(5):1633–1649. doi: https://doi.org/10.1137/S0363012998339745
- Iusem AN, Isnard CA, Butnariu D. A mixed holder and minkowski inequality. Proc Amer Math Soc. 1999;127(8):2405–2415. doi: https://doi.org/10.1090/S0002-9939-99-04800-5
- Hiriart-Urruty JB. Generalized differentiability, duality and optimization for problems dealing with differences of convex functions Ponstein. J Lecture Notes Econom Math Sys. 1984;256:37–70. doi: https://doi.org/10.1007/978-3-642-45610-7_3
- Huang XX, Yang XQ. Duality for multiobjective optimization via nonlinear Lagrangian functions. J Optim Theory Appl. 2004;120:11–127.
- Bolte J, Daniilidis A, Lewis A, et al. Clarke critical values of subanalytic Lipschitz continuous functions. Ann Polon Math. 2005;87:13–25. doi: https://doi.org/10.4064/ap87-0-2