Kuhn-Tucker sufficiency for global minimum of multi-extremal mathematical programming problems
DOI10.1016/J.JMAA.2007.02.013zbMATH Open1135.90429OpenAlexW2035009277MaRDI QIDQ2642150FDOQ2642150
Authors: S. Srisatkunrajah, Nguyen Quang Huy, V. Jeyakumar 
Publication date: 20 August 2007
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jmaa.2007.02.013
Recommendations
- New Kuhn-Tucker sufficiency for global optimality via convexification
- Geometric conditions for Kuhn-Tucker sufficiency of global optimality in mathematical programming
- scientific article; zbMATH DE number 169218
- scientific article; zbMATH DE number 3945889
- scientific article; zbMATH DE number 1135672
global optimizationbox constraintssufficient optimality conditionsKuhn-Tucker conditionssmooth nonlinear programming problems
Quadratic programming (90C20) Optimality conditions and duality in mathematical programming (90C46) Nonlinear programming (90C30)
Cites Work
- On sufficiency of the Kuhn-Tucker conditions
- Handbook of global optimization
- Handbook of global optimization. Vol. 2
- Sufficient global optimality conditions for non-convex quadratic minimization problems with box constraints
- Global optimality conditions for quadratic optimization problems with binary constraints
- On generalised convex mathematical programming
- Title not available (Why is that?)
- Nonlinear Programming
- Title not available (Why is that?)
- Sufficient global optimality conditions for bivalent quadratic optimization
- Global minimization of difference of quadratic and convex functions over box or binary constraints
- Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions
- Deterministic global optimization. Theory, methods and applications
- Title not available (Why is that?)
- Second-order sufficient optimality conditions for local and global nonlinear programming
- Optimization in computational chemistry and molecular biology. Local and global approaches. Conference, Princeton Univ., Princeton, NJ, USA, May 7--9, 1999
- Title not available (Why is that?)
- Sufficient global optimality conditions for multi-extremal smooth minimisation problems with bounds and linear matrix inequality constraints
- An optimality criterion for global quadratic optimization
- A generalization of the Kuhn-Tucker sufficiency conditions
- 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
Cited In (13)
- New sufficiency for global optimality and duality of nonlinear multi-objective programming problems via underestimators
- Application of preservation technology for lifetime dependent products in an integrated production system
- A note on sufficient global optimality conditions for fixed charge quadratic programs
- Regularized Lagrangian duality for linearly constrained quadratic optimization and trust-region problems
- Title not available (Why is that?)
- Geometric conditions for Kuhn-Tucker sufficiency of global optimality in mathematical programming
- Global optimality principles for polynomial optimization over box or bivalent constraints by separable polynomial approximations
- New sufficiency for global optimality and duality of mathematical programming problems via underestimators
- Title not available (Why is that?)
- New Kuhn-Tucker sufficiency for global optimality via convexification
- Global optimality conditions and duality theorems for robust optimal solutions of optimization problems with data uncertainty, using underestimators
- Uniqueness conditions for Kuhn-Tucker points on a disk
- Global quadratic minimization over bivalent constraints: necessary and sufficient global optimality condition
This page was built for publication: Kuhn-Tucker sufficiency for global minimum of multi-extremal mathematical programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2642150)
