Technical Note—Direct Proof of the Existence Theorem for Quadratic Programming
From MaRDI portal
Cited in
(13)- On solvability of convex noncoercive quadratic programming problems
- On the solution existence of nonconvex quadratic programming problems in Hilbert spaces
- A geometric characterization of strong duality in nonconvex quadratic programming with linear and nonconvex quadratic constraints
- On the optimal value function of a linearly perturbed quadratic program
- The fundamental theorem of linear programming: extensions and applications
- A generalization of the Frank—Wolfe theorem
- On a Frank-Wolfe type theorem in cubic optimization
- scientific article; zbMATH DE number 6872015 (Why is no real title available?)
- A non-polyhedral extension of the Frank-Wolfe theorem to cubic optimization
- Local convergence of the Gauss-Newton methods for constrained nonlinear equations
- Continuity of the solution map in quadratic programs under linear perturbations
- Set intersection theorems and existence of optimal solutions
- Global optimization of truss topology with discrete bar areas. I: Theory of relaxed problems
This page was built for publication: Technical Note—Direct Proof of the Existence Theorem for Quadratic Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5650522)