Solving the general quadratic programming problem in a finite number of steps
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3972626 (Why is no real title available?)
- scientific article; zbMATH DE number 3545338 (Why is no real title available?)
- A Newton method for linear programming
- New numerical methods and some applied aspects of the p-regularity theory
- On the Accurate Identification of Active Constraints
- On the non-polynomiality of the relaxation method for systems of linear inequalities
Cited in
(13)- An effective generalization of the direct support method in quadratic convex programming
- scientific article; zbMATH DE number 3936940 (Why is no real title available?)
- A generalized problem of quadratic programming
- scientific article; zbMATH DE number 3908174 (Why is no real title available?)
- scientific article; zbMATH DE number 590053 (Why is no real title available?)
- scientific article; zbMATH DE number 3887443 (Why is no real title available?)
- Step-by-step quadratic penalty solution of a quadratic programming problem
- A splitting method for quadratic programming problem
- scientific article; zbMATH DE number 4123185 (Why is no real title available?)
- Boundedness of a type of iterative sequences in two-dimensional quadratic programming
- scientific article; zbMATH DE number 776091 (Why is no real title available?)
- scientific article; zbMATH DE number 3848975 (Why is no real title available?)
- An incremental approach for the solution of quadratic problems
This page was built for publication: Solving the general quadratic programming problem in a finite number of steps
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q382174)