A Global Optimization Algorithm for Concave Quadratic Programming Problems
- 1 November 1993
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Optimization
- Vol. 3 (4) , 826-842
- https://doi.org/10.1137/0803042
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- Using copositivity for global optimality criteria in concave quadratic programming problemsMathematical Programming, 1993
- Role of copositivity in optimality criteria for nonconvex optimization problemsJournal of Optimization Theory and Applications, 1992
- Detecting all evolutionarily stable strategiesJournal of Optimization Theory and Applications, 1992
- Polynomial time algorithms for some classes of constrained nonconvex quadratic problemsOptimization, 1990
- From Convex Optimization to Nonconvex Optimization. Necessary and Sufficient Conditions for Global OptimalityPublished by Springer Nature ,1989
- Some NP-complete problems in quadratic and nonlinear programmingMathematical Programming, 1987
- The Simplex MethodPublished by Springer Nature ,1987
- On copositive matricesLinear Algebra and its Applications, 1983
- Finite criteria for conditional definiteness of quadratic formsLinear Algebra and its Applications, 1981
- On non-negative forms in real variables some or all of which are non-negativeMathematical Proceedings of the Cambridge Philosophical Society, 1962