Abstract
First-order sufficient optimality conditions in terms of Lagrangian functions and Lagrange multipliers for nondifferentiable minimax programs and vector optimization problems in an Asplund space setting are obtained in this paper. Two illustrative examples are given. Our results implement the first-order necessary optimality conditions of Chuong and Kim (Ann Oper Res 251:73–87, 2017).
Similar content being viewed by others
References
Bao, T.Q., Gupta, P., Khanh, P.Q.: Necessary optimality conditions for minimax programming problems with mathematical constraints. Optimization 66, 1755–1776 (2017)
Chuong, T.D., Kim, D.S.: Nondifferentiable minimax programming problems with applications. Ann. Oper. Res. 251, 73–87 (2017)
Demyanov, V.F., Malozemov, V.N.: Introduction to Minimax [Translated from the original Russian publication (Nauka, 1972) by D. Louvish], Dover Publications, Inc., New York (1990); republication of the English translation published by Keter Publishing House Jerusalem Ltd. (1974)
Du, D.-Z.: Minimax and its applications. In: (Horst, R., Pardalos, P.M. (eds.): Handbook of Global Optimization", 339–367. Kluwer Academic Publishers, Dordrecht (1995)
Hang, N.T.V.: The penalty functions method and multiplier rules based on the Mordukhovich subdifferential. Set-Valued Var. Anal. 22, 299–312 (2014)
Hang, N.T.V., Yen, N.D.: Optimality conditions and stability analysis via the Mordukhovich subdifferential. Numer. Funct. Anal. Optim. 36, 364–386 (2015)
Hong, Z., Bae, K.D., Kim, D.S.: Minimax programming as a tool for studying robust multi-objective optimization problems. Ann. Oper. Res. 319, 1589–1606 (2022)
Jeyakumar, V., Li, G.: Exact second-order cone programming relaxations for some nonconvex minimax quadratic optimization problems. SIAM J. Optim. 28, 760–787 (2018)
Jiao, Y.-C., Leung, Y., Xu, Z., Zhang, J.-S.: Variable programming: a generalized minimax problem. Part I: Models and theory. Comput. Optim. Appl. 30, 229–261 (2005)
Jiao, Y.-C., Leung, Y., Xu, Z., Zhang, J.-S.: Variable programming: a generalized minimax problem. Part II: Algorithms. Comput. Optim. Appl. 30, 263–295 (2005)
Lai, H.-C., Lee, J.-C., Ho, S.-C.: Parametric duality on minimax programming involving generalized convexity in complex space. J. Math. Anal. Appl. 323, 1104–1115 (2006)
Lai, H.C., Liu, J.C., Tanaka, K.: Necessary and sufficient conditions for minimax fractional programming. J. Math. Anal. Appl. 230, 311–328 (1999)
Mishra, S.K.: Generalized pseudo-convex minmax programming. Opsearch 35, 32–44 (1998)
Mishra, S.K.: Pseudoconvex complex minimax programming. Indian J. Pure Appl. Math. 32, 205–213 (2001)
Mishra, S.K., Rautela, J.S.: On nondifferentiable minimax fractional programming under generalized \(\alpha \)-type I invexity. J. Appl. Math. Comput. 31, 317–334 (2009)
Mordukhovich, B.S.: Variational Analysis and Generalized Differentiation, vol. I: Basic Theory, vol. II: Applications, Springer, Berlin (2006)
Mordukhovich, B.S., Outrata, J.V.: On second-order subdifferentials and their applications. SIAM J. Optim. 12, 139–169 (2001)
Nocedal, J., Wright, S.J.: Numerical Optimization, 2nd edn. Springer, New York (2006)
Polyak, B.T.: Introduction to Optimization, Optimization Software, Inc., Publications Division, New York (1987); Revised version (2010)
Rockafellar, R.T., Wets, R.J.-B.: Variational Analysis. Springer, Berlin (1998)
Upadhyay, B.B., Mishra, S.K.: Nonsmooth semi-infinite minmax programming involving generalized \((\Phi ,\rho )\)-invexity. J. Syst. Sci. Complex. 28, 857–875 (2015)
Yu, G., Kouvelis, P.: On min-max optimization of a collection of classical discrete optimization problems. In: Du, D.-Z., Pardalos, P.M. (eds.) Minimax and Applications, 157–171. Kluwer Acad. Publ, Dordrecht (1995)
Acknowledgements
This research was supported by PHENIKAA University, the National Research Foundation of Korea (NRF) Grant funded by the Korean Government (NRF-2019R1A2C1008672), and Vietnam Academy of Science and Technology. D.T.K. Huyen is grateful to Hanoi Pedagogical University 2 for creating favorable working conditions for her. The authors would like to thank the Area Editor and the anonymous referee for their useful suggestions, which have helped to improve the presentation of the paper.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by René Henrion.
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Huyen, D.T.K., Kim, D.S. & Yen, N.D. Optimality Conditions for Nondifferentiable Minimax Programs and Vector Optimization Problems. J Optim Theory Appl 200, 703–723 (2024). https://doi.org/10.1007/s10957-023-02366-2
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10957-023-02366-2
Keywords
- Nondifferentiable minimax program in an Asplund space
- Optimality condition
- Limiting subdifferential
- Sum rule
- Lower regular function
- Monotonicity
- Vector optimization