Quadratic programming with one quadratic constraint in Hilbert spaces
From MaRDI portal
Publication:6428952
Abstract: A quadratically constrained quadratic programming problem is considered in a Hilbert space setting, where neither the objective nor the constraint are convex functions. Necessary and sufficient conditions are provided to guarantee that the problem admits solutions for every initial data (in an adequate set).
This page was built for publication: Quadratic programming with one quadratic constraint in Hilbert spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6428952)