Using copositivity for global optimality criteria in concave quadratic programming problems (Q1319026)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Using copositivity for global optimality criteria in concave quadratic programming problems |
scientific article; zbMATH DE number 549160
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Using copositivity for global optimality criteria in concave quadratic programming problems |
scientific article; zbMATH DE number 549160 |
Statements
Using copositivity for global optimality criteria in concave quadratic programming problems (English)
0 references
12 April 1994
0 references
For the general linearly constrained concave quadratic minimization problem, the authors give necessary and sufficient optimality conditions which are expressed in terms of the copositivity, with respect to a certain cone, of an associated matrix. The proof is based on results of \textit{J.-B. Hiriart-Urruty} [in: `Nonsmooth optimization and related topics', Proc. 4th Course Int. Sch. Math., Erice/Italy 1988, Ettore Majorana Int. Sci. Ser., Phys. Sci. 43, 219-239 (1989; Zbl 0735.90056)] characterizing global minima of differences of convex functions.
0 references
global optimization
0 references
dc-functions
0 references
linearly constrained concave quadratic minimization
0 references
necessary and sufficient optimality conditions
0 references
0 references
