On strong pseudoconvexity in nonlinear programming duality
From MaRDI portal
Recommendations
Cited in
(13)- 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)