| dc.contributor.author | Dostál, Zdeněk | |
| dc.date.accessioned | 2009-10-12T11:39:51Z | |
| dc.date.available | 2009-10-12T11:39:51Z | |
| dc.date.issued | 2009 | |
| dc.identifier.citation | Journal of Optimization Theory and Applications. 2009, vol. 143, no. 2, p. 413-416. | en |
| dc.identifier.issn | 0022-3239 | |
| dc.identifier.issn | 1573-2878 | |
| dc.identifier.uri | http://hdl.handle.net/10084/76147 | |
| dc.description.abstract | Using a known result on minimization of convex functionals on polyhedral cones, the Frank–Wolfe theorem, and basic linear algebra, we give a simple proof that the general convex quadratic programming problem which satisfies a natural necessary condition has a solution. | en |
| dc.language.iso | en | en |
| dc.publisher | Springer | en |
| dc.relation.ispartofseries | Journal of Optimization Theory and Applications | en |
| dc.relation.uri | https://doi.org/10.1007/s10957-009-9563-y | en |
| dc.subject | convex quadratic programming | en |
| dc.subject | existence of solution | en |
| dc.title | On solvability of convex noncoercive quadratic programming problems | en |
| dc.type | article | en |
| dc.identifier.location | Není ve fondu ÚK | en |
| dc.identifier.doi | 10.1007/s10957-009-9563-y | |
| dc.identifier.wos | 000270201200012 | |