Quasi Strongly $E$-preinvexity and its Relationships with Nonlinear Programming
Akhlad Iqbal, Askar Hussain

TL;DR
This paper introduces new classes of strongly E-preinvex and E-invex functions, explores their properties and relationships, and applies these concepts to nonlinear programming to establish conditions for global optimality.
Contribution
It extends existing function classes to quasi and pseudo variants, providing new theoretical insights and demonstrating their application in nonlinear optimization.
Findings
Defined quasi strongly E-preinvex and related functions with examples
Established properties and relationships among these functions
Applied results to nonlinear programming to identify global minima
Abstract
In this paper, we extend the class of strongly -preinvex and strongly -invex functions to quasi strongly -preinvex, quasi strongly -invex and pseudo strongly -invex functions. Some nontrivial suitable examples have been constructed in support of our definitions. Several interesting properties and relationships of these functions are discussed. Furthermore, to show the application of our results, we consider a nonlinear programming problem and show that the local minimum point is also a strictly global minimum.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsOptimization and Variational Analysis · Nuclear Receptors and Signaling · Advanced Optimization Algorithms Research
