Constraint Qualifications and Optimality Conditions for Nonsmooth Semidefinite Multiobjective Programming Problems with Mixed Constraints Using Convexificators

Balendu Bhooshan Upadhyay, Shubham Kumar Singh and Ioan Stancu-Minasian ()
Additional contact information
Balendu Bhooshan Upadhyay: Department of Mathematics, Indian Institute of Technology Patna, Patna 801106, India
Shubham Kumar Singh: Department of Mathematics, Indian Institute of Technology Patna, Patna 801106, India
Ioan Stancu-Minasian: “Gheorghe Mihoc-Caius Iacob” Institute of Mathematical Statistics and Applied Mathematics of the Romanian Academy, 050711 Bucharest, Romania

Mathematics, 2024, vol. 12, issue 20, 1-21

Abstract: In this article, we investigate a class of non-smooth semidefinite multiobjective programming problems with inequality and equality constraints (in short, NSMPP). We establish the convex separation theorem for the space of symmetric matrices. Employing the properties of the convexificators, we establish Fritz John (in short, FJ)-type necessary optimality conditions for NSMPP. Subsequently, we introduce a generalized version of Abadie constraint qualification (in short, NSMPP-ACQ) for the considered problem, NSMPP. Employing NSMPP-ACQ, we establish strong Karush-Kuhn-Tucker (in short, KKT)-type necessary optimality conditions for NSMPP. Moreover, we establish sufficient optimality conditions for NSMPP under generalized convexity assumptions. In addition to this, we introduce the generalized versions of various other constraint qualifications, namely Kuhn-Tucker constraint qualification (in short, NSMPP-KTCQ), Zangwill constraint qualification (in short, NSMPP-ZCQ), basic constraint qualification (in short, NSMPP-BCQ), and Mangasarian-Fromovitz constraint qualification (in short, NSMPP-MFCQ), for the considered problem NSMPP and derive the interrelationships among them. Several illustrative examples are furnished to demonstrate the significance of the established results.

Keywords: semidefinite programming; multiobjective optimization; mixed constraints; constraint qualifications; optimality conditions; convexificators (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/12/20/3202/pdf (application/pdf)
https://www.mdpi.com/2227-7390/12/20/3202/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:12:y:2024:i:20:p:3202-:d:1497411

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().