New Kuhn-Tucker sufficiency for global optimality via convexification
type: Item
instance of: scholarly article
title: New Kuhn-Tucker sufficiency for global optimality via convexification
zbMATH Open document ID: 1192.90201
author: Gue Myung Lee
author: S. Srisatkunarajah
author: V. Jeyakumar
published in: Nonlinear Analysis. Theory, Methods \& Applications. Series A: Theory and Methods
publication date: 2009-06-09T00:00:00Z
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C46
zbMATH DE Number: 5563041
zbMATH Keywords: convexifiable functions
zbMATH Keywords: convexifiable programs
zbMATH Keywords: multi-extremal problems
zbMATH Keywords: bivalent programs
zbMATH Keywords: quadratic programs
MaRDI profile type: Publication
full work available at URL: j.na.2008.10.083
OpenAlex ID: W1971468525
cites work: Global optimality conditions for quadratic optimization problems with binary constraints
cites work: A note on the existence of Lagrange multipliers
cites work: A generalization of the Kuhn-Tucker sufficiency conditions
cites work: On the convexification of nonlinear programming problems: An applications-oriented survey
cites work: On generalised convex mathematical programming
cites work: Sufficient global optimality conditions for non-convex quadratic minimization problems with box constraints
cites work: Kuhn-Tucker sufficiency for global minimum of multi-extremal mathematical programming problems
cites work: Q4326385
cites work: Second-order sufficient optimality conditions for local and global nonlinear programming
cites work: Handbook of global optimization. Vol. 2
cites work: Second-order characterizations of pseudo-convex quadratic functions
cites work: On the convexifiability of pseudoconvex C2-functions
cites work: A convexification method for a class of global optimization problems with applications to reliability optimization
cites work: Sufficient conditions for global optimality of bivalent nonconvex quadratic programs with inequality constraints
cites work: Peeling Off a Nonconvex Cover of an Actual Convex Problem: Hidden Convexity
cites work: Characterization of convexifiable functions
cites work: Regularity and stability for the mathematical programming problem in Banach spaces
DOI: 10.1016/J.NA.2008.10.083
description: scientific article; zbMATH DE number 5563041