Sequentially necessary and sufficient conditions for solutions of optimization problems with inclusion constraints
Main Article Content
Abstract
In this paper, we provide sequentially necessary and sufficient conditions for optimal solutions of optimization problems with inclusion constraints. The sequentially optimal conditions obtained are without any constraints.
Article Details
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
Keywords
Sequence, solutions of optimization problem, inclusion constraint
References
[1]. J. M. Borwein and H. Wolkowicz (1982), “Characterizations of optimality without constraint qualification for the abstract convex program”, Math. Programming Stud., (19), p. 77-100.
[2]. A. Brondsted and R. T. Rockafellar (1965), “On the subdifferentiability of convex functions”, Proc. Amer. Math. Soc., (16), p. 605-611.
[3]. S. Dempe and A. B. Zemkoho (2012), “On the Karush-Kuhn-Tucker reformulation of the bilevel optimization problem”, Nonlinear Anal., (75), p. 1202-1218.
[4]. S. Dempe, N. Dinh, and J. Dutta (2010), “Optimality Conditions for a Simple Convex Bilevel Programming Problem”, Variational Analysis and Generalized Differentiation in Optimization and Control Springer Optimization and Its Applications, (47), p. 149-161.
[5]. A. Dhara and J. Dutta (2012), Optimality Conditions in Convex Optimization, A Finite-Dimension View, Taylor and Francis Group.
[6]. W. Heins and S. K. Mitter (1970), “Conjugate convex function, Duality and Optimal control, Problem I: Systems Governed Ordinary Differential equations”, Inform. Sciences, (2), p. 211-243.
[7]. V. Jeyakumar, G. M. Lee, and N. Dinh (2003), “New sequential Lagrange multiplier conditions charactering optimality without constraint qualification for convex programs”, Siam J. Optim., (14), p. 534-547.
[8]. V. Jeyakumar, A. M. Rubinov, B. M. Glover, and Y. Ishizuka (1996), “Inequality systems and Global optimization”, J. Math. Anal. App., (202), p. 900-919.
[9]. P. Kanniappan (1983), “ Necessary condition for optimality of nondifferentiable convex multiobjective programming”, J. Optim. Theory and App., (40), p. 167-174.
[10]. L. Thibault (1997), “Sequential convex subdifferential calculus and Lagrange multipliers”, Siam J. Control Optim., (7), p. 641-662.
[2]. A. Brondsted and R. T. Rockafellar (1965), “On the subdifferentiability of convex functions”, Proc. Amer. Math. Soc., (16), p. 605-611.
[3]. S. Dempe and A. B. Zemkoho (2012), “On the Karush-Kuhn-Tucker reformulation of the bilevel optimization problem”, Nonlinear Anal., (75), p. 1202-1218.
[4]. S. Dempe, N. Dinh, and J. Dutta (2010), “Optimality Conditions for a Simple Convex Bilevel Programming Problem”, Variational Analysis and Generalized Differentiation in Optimization and Control Springer Optimization and Its Applications, (47), p. 149-161.
[5]. A. Dhara and J. Dutta (2012), Optimality Conditions in Convex Optimization, A Finite-Dimension View, Taylor and Francis Group.
[6]. W. Heins and S. K. Mitter (1970), “Conjugate convex function, Duality and Optimal control, Problem I: Systems Governed Ordinary Differential equations”, Inform. Sciences, (2), p. 211-243.
[7]. V. Jeyakumar, G. M. Lee, and N. Dinh (2003), “New sequential Lagrange multiplier conditions charactering optimality without constraint qualification for convex programs”, Siam J. Optim., (14), p. 534-547.
[8]. V. Jeyakumar, A. M. Rubinov, B. M. Glover, and Y. Ishizuka (1996), “Inequality systems and Global optimization”, J. Math. Anal. App., (202), p. 900-919.
[9]. P. Kanniappan (1983), “ Necessary condition for optimality of nondifferentiable convex multiobjective programming”, J. Optim. Theory and App., (40), p. 167-174.
[10]. L. Thibault (1997), “Sequential convex subdifferential calculus and Lagrange multipliers”, Siam J. Control Optim., (7), p. 641-662.
Most read articles by the same author(s)
- Chi Dung Nguyen, Bao Thy Vuong, Thi Tuyet Sang Nguyen, Kim Ngan Nguyen, A study on the manufacturing process of flavored honey turmeric juice , Dong Thap University Journal of Science: No. 36 (2019): Part B - Natural Sciences
- Thi Tran Chau Pham, Duc Thinh Vo, Thi Kim Yen Ngo, Thuy Hoang Yen Tran, The level-set method combined with Desmos software to orient the solution of inequality problems , Dong Thap University Journal of Science: Vol. 11 No. 1 (2022): Social Sciences and Humanities Issue (Vietnamese)
- Ngoc Cam Huynh, Duc Thinh Vo, K-coincidence point without commutative condition in partially ordered metric , Dong Thap University Journal of Science: Vol. 12 No. 2 (2023): Natural Sciences Issue (Vietnamese)
- Ngoc Anh Tho Pham, Kim Yen Ngo Thi, Duc Thinh Vo, Thi Tran Chau Pham, Parabolic subdifferential and its applications to optimality conditions , Dong Thap University Journal of Science: Vol. 12 No. 2 (2023): Natural Sciences Issue (Vietnamese)
- Thi Tran Chau Pham, Duc Thinh Vo, Thi Kim Yen Ngo, Thuy Hoang Yen Tran, Procedures to build some inequality problems from basic convex functions , Dong Thap University Journal of Science: Vol. 11 No. 4 (2022): Social Sciences and Humanities Issue (Vietnamese)
- Dr. Duc Thinh Vo, Ngoc Cam Huynh, Derivatives with degree of freedom of multifunctions and application , Dong Thap University Journal of Science: Vol. 13 No. 2 (2024): Natural Sciences Issue (Vietnamese)
- Van Dung Nguyen, Trung Hieu Nguyen, Duc Thinh Vo, Công bố khoa học của Trường Đại học Đồng Tháp giai đoạn 2003-2013 và đề xuất một số định hướng , Dong Thap University Journal of Science: No. 9 (2014): Part A - Social Sciences and Humanities
- Duc Thinh Vo, The directionally normal cone and optimal condition , Dong Thap University Journal of Science: No. 13 (2015): Part B - Natural Sciences
- Thi Thanh Thao Nguyen, Duc Thinh Vo, Directional (convex) subdifferential and applications , Dong Thap University Journal of Science: No. 21 (2016): Part B - Natural Sciences
- Thi Bich Van Dang, Duc Thinh Vo, Generalized Studniarski derivatives and its applications , Dong Thap University Journal of Science: No. 31 (2018): Part B - Natural Sciences