New Kuhn-Tucker sufficiency for global optimality via convexification
From MaRDI portal
Publication:1021733
DOI10.1016/j.na.2008.10.083zbMath1192.90201MaRDI 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
quadratic programs; multi-extremal problems; bivalent programs; convexifiable functions; convexifiable programs
Related Items
A note on nonconvex minimax theorem with separable homogeneous polynomials, A novel convex dual approach to three-dimensional assignment problem: theoretical analysis, A neurodynamic optimization technique based on overestimator and underestimator functions for solving a class of non-convex optimization problems
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
