Duality for non-smooth semidefinite multiobjective programming problems with equilibrium constraints using convexificators
Authors
B. B. Upadhyay
- Department of Mathematics, Indian Institute of Technology, Patna, India.
S. K. Singh
- Department of Mathematics, Indian Institute of Technology, Patna, India.
I. M. Stancu-Minasian
- Gheorghe Mihoc-Caius Iacob, Institute of Mathematical Statistics and Applied Mathematics of the Romanian Academy, 050711 Bucharest, Romania.
Abstract
In this article, we investigate the duality theorems for a class of non-smooth semidefinite multiobjective programming problems with equilibrium constraints (in short, NSMPEC) via convexificators. Utilizing the properties of convexificators, we present Wolfe-type (in short, WMPEC) and Mond-Weir-type (in short, MWMPEC) dual models for the problem NSMPEC. Furthermore, we establish various duality theorems, such as weak, strong, and strict converse duality theorems relating to the primal problem NSMPEC and the corresponding dual models, in terms of convexificators. Numerous illustrative examples are furnished to demonstrate the importance of the established results. Furthermore, we discuss an application of semidefinite multiobjective programming problems in approximating K-means-type clustering problems. To the best of our knowledge, duality results presented in this paper for NSMPEC using convexificators have not been explored before.
Share and Cite
ISRP Style
B. B. Upadhyay, S. K. Singh, I. M. Stancu-Minasian, Duality for non-smooth semidefinite multiobjective programming problems with equilibrium constraints using convexificators, Journal of Nonlinear Sciences and Applications, 17 (2024), no. 3, 128--149
AMA Style
Upadhyay B. B., Singh S. K., Stancu-Minasian I. M. , Duality for non-smooth semidefinite multiobjective programming problems with equilibrium constraints using convexificators. J. Nonlinear Sci. Appl. (2024); 17(3):128--149
Chicago/Turabian Style
Upadhyay, B. B., Singh, S. K., Stancu-Minasian, I. M. . "Duality for non-smooth semidefinite multiobjective programming problems with equilibrium constraints using convexificators." Journal of Nonlinear Sciences and Applications, 17, no. 3 (2024): 128--149
Keywords
- Semidefinite programming
- multiobjective optimization
- duality
- equilibrium constraints
- convexificators
MSC
References
-
[1]
K. O. Alawode, A. M. Jubril, L. O. Kehinde, P. O. Ogunbona, Semidefinite programming solution of economic dispatch problem with non-smooth, non-convex cost functions, Electric Power Syst. Res., 164 (2018), 178–187
-
[2]
T. Antczak, S. K. Mishra, B. B. Upadhyay, First order duality for a new class of nonconvex semi-infinite minimax fractional programming problems, J. Adv. Math. Stud., 9 (2016), 132–162
-
[3]
A. Ansari Ardali, N. Movahedian, S. Nobakhtian, Optimality conditions for non-smooth mathematical programs with equilibrium constraints, using convexificators, Optimization, 65 (2016), 67–85
-
[4]
A. Ansari Ardali, M. Zeinali, G. H. Shirdel, Some Pareto optimality results for non-smooth multiobjective optimization problems with equilibrium constraints, Int. J. Nonlinear Anal. Appl., 13 (2022), 2185–2196
-
[5]
S. Boyd, L. El Ghaoui, E. Feron, V. Balakrishnan, Linear Matrix Inequalities in System and Control Theory, Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA (1994)
-
[6]
J. Branke, K. Deb, K. Miettinen, R. Slowi´ nski, Multiobjective Optimization: Interactive and Evolutionary Approaches, Springer, Berlin (2008)
-
[7]
W. Britz, M. Ferris, A. Kuhn, Modeling water allocating institutions based on multiple optimization problems with equilibrium constraints, Environ. Model. Softw., 46 (2013), 196–207
-
[8]
S. Burer, D. Vandenbussche, A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations, Math. Program., 113 (2008), 259–282
-
[9]
F. H. Clarke, Optimization and non-smooth analysis, Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA (1990)
-
[10]
V. F. Demyanov, Convexification and concavification of positively homogeneous functions by the same family of linear functions, Technical Report, University of Pisa, Italy, (1994), 1–11
-
[11]
V. F. Demyanov, V. Jeyakumar, Hunting for a smaller convex subdifferential, J. Global Optim., 10 (1997), 305–326
-
[12]
J. Dutta, S. Chandra, Convexifactors, generalized convexity, and optimality conditions, J. Optim. Theory Appl., 113 (2002), 41–64
-
[13]
J. Dutta, S. Chandra, Convexifactors, generalized convexity and vector optimization, Optimization, 53 (2004), 77–94
-
[14]
M. L. Flegel, C. Kanzow, Abadie-type constraint qualification for mathematical programs with equilibrium constraints, J. Optim. Theory Appl., 124 (2005), 595–614
-
[15]
M. L. Flegel, C. Kanzow, On the Guignard constraint qualification for mathematical programs with equilibrium constraints, Optimization, 54 (2005), 517–534
-
[16]
A. Forsgren, Optimality conditions for nonconvex semidefinite programming, Math. Program., 88 (2000), 105–128
-
[17]
M. Fukushima, J.-S. Pang, Some feasibility issues in mathematical programs with equilibrium constraints, SIAM J. Optim.,, 18 (1998), 673–681
-
[18]
A. Ghosh, B. B. Upadhyay, I. M. Stancu-Minasian, Pareto efficiency criteria and duality for multiobjective fractional programming problems with equilibrium constraints on Hadamard manifolds, Mathematics, 11 (2023), 1–28
-
[19]
A. Ghosh, B. B. Upadhyay, I. M. Stancu-Minasian, Constraint qualifications for multiobjective programming problems on Hadamard manifolds, Aust. J. Math. Anal. Appl., 20 (2023), 17 pages
-
[20]
W. Gil-Gonz´alez, O. D. Montoya, E. Holgu´ın, A. Garces, L. F. Grisales-Nore ˜ na, Economic dispatch of energy storage systems in DC microgrids employing a semidefinite programming model, J. Energy Storage, 21 (2019), 1–8
-
[21]
M. X. Goemans, Semidefinite programming in combinatorial optimization, Math. Program., 79 (1997), 143–161
-
[22]
M. Golestani, S. Nobakhtian, Optimality conditions for non-smooth semidefinite programming via convexificators, Positivity, 19 (2019), 221–236
-
[23]
L. Guo, G.-H. Lin, J. Zhao, Wolfe-type duality for mathematical programs with equilibrium constraints, Acta Math. Appl. Sin. Engl. Ser., 35 (2019), 532–540
-
[24]
P.T. Harker, J.-S. Pang, Existence of optimal solutions to mathematical programs with equilibrium constraints, Oper. Res. Lett., 7 (1988), 61–64
-
[25]
A. D. Ioffe, Approximate subdifferentials and applications. II, Mathematika, 33 (1986), 111–128
-
[26]
V. Jeyakumar, D. T. Luc, Non-smooth calculus, minimality, and monotonicity of convexificators, J. Optim. Theory Appl., 10 (1999), 599–621
-
[27]
B. C. Joshi, S. K. Mishra, Pankaj, On non-smooth mathematical programs with equilibrium constraints using generalized convexity, Yugosl. J. Oper. Res., 29 (2019), 449–463
-
[28]
L. Lafhim, E. M. Kalmoun, Optimality conditions for mathematical programs with equilibrium constraints using directional convexificators, Optimization, 72 (2023), 1363–1383
-
[29]
K. K. Lai, M. Hassan, S. K. Singh, J. K. Maurya, S. K. Mishra, Semidefinite multiobjective mathematical programming problems with vanishing constraints using convexificators, Fractal Fract., 6 (2022), 1–19
-
[30]
A. S. Lewis, M. L. Overton, Eigenvalue optimization, Cambridge Univ. Press, Cambridge, 5 (1996), 149–190
-
[31]
Z.-Q. Luo, J.-S. Pang, D. Ralph, Mathematical Programs With Equilibrium Constraints, Cambridge University Press, Cambridge (1996)
-
[32]
D. V. Luu, Convexificators and necessary conditions for efficiency, Optimization, 63 (2014), 321–335
-
[33]
D. V. Luu, Necessary and sufficient conditions for efficiency via convexificators, J. Optim. Theory Appl., 160 (2014), 510–526
-
[34]
O. L. Mangasarian, Nonlinear Programming, McGraw-Hill, New York (1969)
-
[35]
P. Michel, J.-P. Penot, A generalized derivative for calm and stable functions, Differ. Integral Equ., 5 (1992), 433–454
-
[36]
K. Miettinen, , Kluwer Academic Publishers, Boston, MA (1999)
-
[37]
S. K. Mishra, R. Kumar, V. Laha, J. K. Maurya, Optimality and duality for semidefinite multiobjective programming problems using convexificators, J. Appl. Numer. Optim., 4 (2022), 103–118
-
[38]
S. K. Mishra, B. B. Upadhyay, Efficiency and duality in non-smooth multiobjective fractional programming involving -pseudolinear functions, Yugosl. J. Oper. Res., 22 (2012), 3–18
-
[39]
M. Mond, T. Weir, Generallized Concavity and Duality, in Generalized concavity in optimization and economics, Academic Press, New York (1981)
-
[40]
B. S. Mordukhovich, Y. H. Shao, On nonconvex subdifferential calculus in Banach spaces, J. Convex Anal., 2 (1995), 211–227
-
[41]
J. V. Outrata, Optimality conditions for a class of mathematical programs with equilibrium constraints, Math. Oper. Res., 24 (1999), 627–644
-
[42]
Y. Pandey, S. K. Mishra, Duality for non-smooth optimization problems with equilibrium constraints, using convexificators, J. Optim. Theory Appl., 171 (2016), 694–707
-
[43]
J. Peng, Y. Wei, Approximating K-means-type clustering via semidefinite programming, SIAM J. Optim., 18 (2007), 186–205
-
[44]
A. U. Raghunathan, L. T. Biegler, Mathematical programs with equilibrium constraints (mpecs) in process engineering, Comput. Chem. Eng., 27 (2003), 1381–1392
-
[45]
D. Ralph, Mathematical programs with complementarity constraints in traffic and telecommunications networks, Philos. Trans. R. Soc. Lond. Ser. A Math. Phys. Eng. Sci., 336 (2008), 1973–1987
-
[46]
Rimpi, C. S. Lalitha, Constraint qualifications in terms of convexificators for non-smooth programming problems with mixed constraints, Optimization, 72 (2023), 2019–2038
-
[47]
P. Roux, Y.-L. Voronin, S. Sankaranarayanan, Validating numerical semidefinite programming solvers for polynomial invariants, Form. Methods Syst. Des., 53 (2018), 286–312
-
[48]
S. Saini, N. Kailey, Duality results in terms of convexifactors for a bilevel multiobjective problem, Filomat, 38 (2024), 2015–2022
-
[49]
H. Scheel, S. Scholtes, Mathematical programs with complementarity constraints: Stationarity, optimality, and sensitivity, Math. Oper. Res., 25 (2000), 1–22
-
[50]
A. Shapiro, First and second order analysis of nonlinear semidefinite programs, Math. Program., 77 (1997), 301–320
-
[51]
K. V. K. Singh, J. K. Maurya, S. K. Mishra, Duality in multiobjective mathematical programs with equilibrium constraints, Int. J. Appl. Comput. Math., 7 (2021), 15 pages
-
[52]
J. Sun, On methods for solving nonlinear semidefinite optimization problems, Numer. Algebra Control Optim., 1 (2011), 1–14
-
[53]
D. Sun, J. Sun, L. Zhang, The rate of convergence of the augmented Lagrangian method for nonlinear semidefinite programming, Math. Program., 114 (2008), 349–391
-
[54]
S. Treant¸˘a, B. B. Upadhyay, A. Ghosh, K. Nonlaopon, Optimality conditions for multiobjective mathematical programming problems with equilibrium constraints on Hadamard manifolds, Mathematics, 10 (2022), 1–20
-
[55]
J. S. Treiman, The linear nonconvex generalized gradient and Lagrange multipliers, SIAM J. Optim., 5 (1995), 670–680
-
[56]
B. B. Upadhyay, A. Ghosh, I. M. Stancu-Minasian, Duality for multiobjective programming problems with equilibrium constraints on Hadamard manifolds under generalized geodesic convexity, WSEAS Trans. Math., 22 (2023), 259–270
-
[57]
B. B. Upadhyay, S. K. Mishra, Non-smooth semi-infinite minmax programming involving generalized (, )-invexity, J. Syst. Sci. Complex., 28 (2015), 857–875
-
[58]
B. B. Upadhyay, P. Mishra, On interval-valued multiobjective programming problems and vector variational-like inequalities using limiting subdifferential, In: S. Patnaik, K. Tajeddini and V. Jain, (eds), Computational Management. Modeling and Optimization in Science and Technologies, Springer, Cham, (2021), 325–343
-
[59]
B. B. Upadhyay, P. Mishra, R. N. Mohapatra, S. K. Mishra, On the applications of non-smooth vector optimization problems to solve generalized vector variational inequalities using convexificators, In: Adv. Intell. Syst. Comput., Springer, Cham, Switzerland (2019)
-
[60]
B. B. Upadhyay, R. N. Mohapatra, Sufficient optimality conditions and duality for mathematical programming problems with equilibrium constraints, Comm. Appl. Nonlinear Anal., 25 (2018), 68–84
-
[61]
B. B. Upadhyay, S. K. Singh, Optimality and duality for non-smooth semidefinite multiobjective fractional programming problems using convexificators, Politehn. Univ. Bucharest Sci. Bull. Ser. A Appl. Math. Phys., 85 (2023), 79–90
-
[62]
B. B. Upadhyay, S. K. Singh, I. M. Stancu-Minasian, Constraint qualifications and optimality conditions for nonsmooth semidefinite multiobjective programming problems with equilibrium constraints using convexificators, submitted in RAIRO Oper. Res., (2023),
-
[63]
B. B. Upadhyay, I. M. Stancu-Minasian, P. Mishra, On relations between non-smooth interval-valued multiobjective programming problems and generalized Stampacchia vector variational inequalities, Optimization, 72 (2023), 2635–2659
-
[64]
B. B. Upadhyay, S. Treant¸˘a, P. Mishra, On Minty variational principle for non-smooth multiobjective optimization problems on Hadamard manifolds, Optimization, 72 (2023), 3081–3100
-
[65]
L. Vandenberghe, S. Boyd, Applications of semidefinite programming, Appl. Numer. Math., 29 (1999), 283–299
-
[66]
B. P. G. Van Parys, P. J. Goulart, D. Kuhn, Generalized Gauss inequalities via semidefinite programming, Math. Program., 156 (2016), 271–302
-
[67]
P. Wolfe, A duality theorem for nonlinear programming, Q. Appl. Math., 19 (1961), 239–244
-
[68]
H. Yamashita, H. Yabe, A survey of numerical methods for nonlinear semidefinite programming, J. Oper. Res. Soc. Japan, 58 (2015), 24–60
-
[69]
J. J. Ye, Necessary and sufficient optimality conditions for mathematical programs with equilibrium constraints, J. Math. Anal. Appl., 37 (2005), 350–369
-
[70]
G. Yu, S. Li, X. Pan, W. Han, Optimality of approximate quasi-weakly efficient solutions for vector equilibrium problems via convexificators, Asia-Pac. J. Oper. Res., 39 (2022), 16 pages