New sufficiency for global optimality and duality of mathematical programming problems via underestimators
From MaRDI portal
Publication:1016384
DOI10.1007/s10957-008-9438-7zbMath1191.90067OpenAlexW2149033109MaRDI QIDQ1016384
S. Srisatkunarajah, Vaithilingam Jeyakumar
Publication date: 5 May 2009
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-008-9438-7
Karush-Kuhn-Tucker conditionssufficient optimality conditionsstrong dualityunderestimatorsbiconjugate functions
Related Items (2)
Global optimality conditions for cubic minimization problems with cubic constraints ⋮ Global optimality conditions and duality theorems for robust optimal solutions of optimization problems with data uncertainty, using underestimators
Cites Work
- Unnamed Item
- Unnamed Item
- On sufficiency of the Kuhn-Tucker conditions
- A generalization of the Kuhn-Tucker sufficiency conditions
- Handbook of global optimization
- Handbook of global optimization. Vol. 2
- Approximating data in \({\mathbb R}^{n}\) by a quadratic underestimator with specified Hessian minimum and maximum eigenvalues
- 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
- Optimization with generalized invexity
- 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: New sufficiency for global optimality and duality of mathematical programming problems via underestimators
