New Kuhn-Tucker sufficiency for global optimality via convexification

DOI10.1016/j.na.2008.10.083zbMath1192.90201OpenAlexW1971468525MaRDI QIDQ1021733

Gue Myung Lee, S. Srisatkunarajah, Vaithilingam Jeyakumar

Publication date: 9 June 2009

Published in: Nonlinear Analysis. Theory, Methods \& Applications. Series A: Theory and Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.na.2008.10.083

zbMATH Keywords

quadratic programsmulti-extremal problemsbivalent programsconvexifiable functionsconvexifiable programs

Mathematics Subject Classification ID

Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46)

Related Items (3)

A note on nonconvex minimax theorem with separable homogeneous polynomials ⋮ A neurodynamic optimization technique based on overestimator and underestimator functions for solving a class of non-convex optimization problems ⋮ A novel convex dual approach to three-dimensional assignment problem: theoretical analysis

Cites Work

• Unnamed Item
• A note on the existence of Lagrange multipliers
• On the convexification of nonlinear programming problems: An applications-oriented survey
• Second-order characterizations of pseudo-convex quadratic functions
• Regularity and stability for the mathematical programming problem in Banach spaces
• A generalization of the Kuhn-Tucker sufficiency conditions
• Handbook of global optimization. Vol. 2
• Sufficient global optimality conditions for non-convex quadratic minimization problems with box constraints
• Sufficient conditions for global optimality of bivalent nonconvex quadratic programs with inequality constraints
• Second-order sufficient optimality conditions for local and global nonlinear programming
• Kuhn-Tucker sufficiency for global minimum of multi-extremal mathematical programming problems
• Global Optimality Conditions for Quadratic Optimization Problems with Binary Constraints
• Characterization of convexifiable functions
• Peeling Off a Nonconvex Cover of an Actual Convex Problem: Hidden Convexity
• On the convexifiability of pseudoconvex C2-functions
• On generalised convex mathematical programming
• A convexification method for a class of global optimization problems with applications to reliability optimization

This page was built for publication: New Kuhn-Tucker sufficiency for global optimality via convexification