Invexity and the Kuhn-Tucker theorem
From MaRDI portal
Publication:1304703
DOI10.1006/jmaa.1999.6484zbMath1115.90363OpenAlexW1983534832WikidataQ57253928 ScholiaQ57253928MaRDI QIDQ1304703
Publication date: 22 September 1999
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jmaa.1999.6484
Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46)
Related Items (12)
Generalized cross entropy method for estimating joint distribution from incomplete information ⋮ On sufficient optimality conditions for multiobjective control problems ⋮ Polymorphic uncertainty quantification for engineering structures via a hyperplane modelling technique ⋮ Efficiency and generalised convexity in vector optimisation problems ⋮ Buyer-backed purchase-order financing for SME supplier with uncertain yield ⋮ A virtual model architecture for engineering structures with twin extended support vector regression (T-X-SVR) method ⋮ Infine functions and nonsmooth multiobjective optimization problems ⋮ Preinvex functions and weak efficient solutions for some vectorial optimization problem in Banach spaces ⋮ Necessary and sufficient conditions for weak efficiency in non-smooth vectorial optimization problems ⋮ Optimality and duality in nonsmooth semi-infinite optimization, using a weak constraint qualification ⋮ Hidden invariant convexity for global and conic-intersection optimality guarantees in discrete-time optimal control ⋮ Generalized convexity and nonsmooth problems of vector optimization
Cites Work
This page was built for publication: Invexity and the Kuhn-Tucker theorem
