scientific article; zbMATH DE number 17945

MaRDI QIDQ3975299zbMATH OpenFDO

Authors S. K. Bhatt, C. R. Bector

Publication date 26 June 1992

zbMATH Keywords

\(\rho\)-quasiconvexityFritz-John type constraint qualificationgeneralized subgradient

Mathematics Subject Classification ID

Convexity of real functions of several variables, generalizations (26B25) Nonsmooth analysis (49J52) Nonconvex programming, global optimization (90C26)

Review text

[For the entire collection see Zbl 0727.00014.] The concept of \( \rho\)-quasiconvexity is introduced in a way similar to that in which \textit{J.-P. Vial} [Math. Oper. Res. 8, 231-259 (1983; Zbl 0526.90077)] introduced \(\rho\)-convexity. The problem of minimizing a continuous \(\rho\)-convex functional under continuous \(\rho\)-quasiconvex constraints (inequalities as well as equalities) is considered. It is shown that under quite mild conditions a Fritz-John type constraint qualification works and some sort of duality is still in place.

Recommendations

• Sufficient optimality conditions and duality for a quasiconvex programming problem
• On sufficiency and duality for generalized quasiconvex programs
• Nondifferentiable minimax fractional programming problems with \((C, \alpha, \rho, d)\)-convexity
• scientific article; zbMATH DE number 1234744
• Subgradient Duality Using jFritz John Conditions

Cited in

(5)

• Sufficient Fritz John optimality conditions and duality for nonlinear programming problems
• Sufficient Fritz John optimality criteria and duality for continuous programming problems
• scientific article; zbMATH DE number 4176855 (Why is no real title available?)
• Discussing for the weak stability property of the optimization problem whose objective function is \(\rho\)-convex function (\(\rho<0\))
• Subgradient Duality Using jFritz John Conditions

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3975299)