New sufficiency for global optimality and duality of mathematical programming problems via underestimators
type: Item
instance of: scholarly article
title: New sufficiency for global optimality and duality of mathematical programming problems via underestimators
zbMATH Open document ID: 1191.90067
author: S. Srisatkunarajah
author: V. Jeyakumar
published in: Journal of Optimization Theory and Applications
publication date: 2009-05-05T00:00:00Z
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 5550731
zbMATH Keywords: Karush-Kuhn-Tucker conditions
zbMATH Keywords: sufficient optimality conditions
zbMATH Keywords: strong duality
zbMATH Keywords: underestimators
zbMATH Keywords: biconjugate functions
MaRDI profile type: Publication
full work available at URL: s10957-008-9438-7
OpenAlex ID: W2149033109
cites work: Handbook of global optimization
cites work: Handbook of global optimization. Vol. 2
cites work: Sufficient global optimality conditions for multi-extremal smooth minimisation problems with bounds and linear matrix inequality constraints
cites work: Approximating data in \({\mathbb R}^{n}\) by a quadratic underestimator with specified Hessian minimum and maximum eigenvalues
cites work: Kuhn-Tucker sufficiency for global minimum of multi-extremal mathematical programming problems
cites work: Nonlinear Programming
cites work: Q4866631
cites work: Optimization with generalized invexity
cites work: On sufficiency of the Kuhn-Tucker conditions
cites work: A generalization of the Kuhn-Tucker sufficiency conditions
cites work: On generalised convex mathematical programming
cites work: Q2753173
cites work: When Is a Point x Satisfying ∇f(x) = 0 a Global Minimum of f?
DOI: 10.1007/S10957-008-9438-7
description: scientific article; zbMATH DE number 5550731