Geometric conditions for Kuhn-Tucker sufficiency of global optimality in mathematical programming
From MaRDI portal
Publication:1002048
DOI10.1016/j.ejor.2007.12.021zbMath1154.90590OpenAlexW1990396112MaRDI QIDQ1002048
S. Srisatkunarajah, Vaithilingam Jeyakumar
Publication date: 23 February 2009
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2007.12.021
generalized convexitysufficient optimality conditionsunderestimatorsbounds on the variablesmathematical programming problemsmulti-extremal problems
Related Items (2)
Matrix completion under interval uncertainty ⋮ Global optimality conditions and duality theorems for robust optimal solutions of optimization problems with data uncertainty, using underestimators
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on the existence of Lagrange multipliers
- Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions
- On sufficiency of the Kuhn-Tucker conditions
- An optimality criterion for global quadratic optimization
- Regularity and stability for the mathematical programming problem in Banach spaces
- A generalization of the Kuhn-Tucker sufficiency conditions
- Handbook of global optimization
- From local to global optimization. Papers from the conference dedicated to Professor Hoang Tuy on the occasion of his 70th birthday, Rimforsa, Sweden, August 1997
- Handbook of global optimization. Vol. 2
- Computational experience with a new class of convex underestimators: Box-constrained NLP problems
- Deterministic global optimization. Theory, methods and applications
- Optimization in computational chemistry and molecular biology. Local and global approaches. Conference, Princeton Univ., Princeton, NJ, USA, May 7--9, 1999
- Sufficient global optimality conditions for non-convex quadratic minimization problems with box constraints
- Second-order sufficient optimality conditions for local and global nonlinear programming
- Kuhn-Tucker sufficiency for global minimum of multi-extremal mathematical programming problems
- Sufficient global optimality conditions for multi-extremal smooth minimisation problems with bounds and linear matrix inequality constraints
- When Is a Point x Satisfying ∇f(x) = 0 a Global Minimum of f?
- On generalised convex mathematical programming
- Nonlinear Programming
This page was built for publication: Geometric conditions for Kuhn-Tucker sufficiency of global optimality in mathematical programming
