On strong pseudoconvexity in nonlinear programming duality
Let S be an open convex set in \(R^ n\) and let f: \(S\to R\) be differentiable. If there exists an arbitrary positive functional p: \(S\times S\to R\) satisfying f(y)-f(x)\(\geq p(x,y)(y-x)^ T\nabla f(x,y)\) for all x,y\(\in S\), then f is said to be strongly pseudoconvex with respect to p(x,y) over s. Clearly, strong pseudoconvexity is a weaker condition than convexity but stronger than pseudoconvexity. The author proves duality theorems for a pair of dual programs first introduced by \textit{B. Mond} and himself [in: Generalized concavity in optimization and economics, Proc. NATO Adv. Study Inst., Vancouver/Can. 1980, 263-279 (1981; Zbl 0538.90081)] under the strong pseudoconvexity assumption on the constraint function.
- Pseudo-invexity and duality in nonlinear programming
- Pseudo-invexity and symmetric duality in nonlinear fractional programming
- Primal or dual strong-duality in nonconvex optimization and a class of quasiconvex problems having zero duality gap
- On harmonic convexity (concavity) and application to non-linear programming problems.
- A non-differentiable programming problem under strong pseudoinvexity.
- On duality with strong pseudoinvexity over cone domain
- scientific article; zbMATH DE number 4149024 (Why is no real title available?)
- Strong pseudo-convexity and symmetric duality in nonlinear programming
- Strong Core Theorems with Nonconvex Preferences
- scientific article; zbMATH DE number 29898 (Why is no real title available?)
- On strong pseudomonotonicity and (semi)strict quasimonotonicity
- Higher order strict global minimizers in non-differentiable multiobjective optimization involving higher order invexity and variational inequality
- A note on strong pseudoconvexity
This page was built for publication: On strong pseudoconvexity in nonlinear programming duality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q750300)
