A self-adapt projection contraction method solving large-scale quadratic programming with simple quadratic constraint
From MaRDI portal
The author proposes a self-adapt projection contraction method for solving quadratic programming problems subject to a spherical region. The Kuhn-Tucker conditions for the problem are transformed to an equivalent linear projection system of equations, and a procedure is described for approaching the zero point of its residual function, into which a parameter is introduced, accompanied by a rule given for modifying the parameter.
Recommendations
- A projection and contraction method for convex quadratic programming
- scientific article; zbMATH DE number 4204121
- An overview on projection-type methods for convex large-scale quadratic programs
- scientific article; zbMATH DE number 4033492
- A modified projection algorithm for large strictly-convex quadratic programs
Cited in
(5)- An efficient PGM-based algorithm with backtracking strategy for solving quadratic optimization problems with spherical constraint
- A projection and contraction method for convex quadratic programming
- An overview on projection-type methods for convex large-scale quadratic programs
- scientific article; zbMATH DE number 1839735 (Why is no real title available?)
- A self-adaptive projection and contraction method for optimizing the sum of a convex and a quadratic function
This page was built for publication: A self-adapt projection contraction method solving large-scale quadratic programming with simple quadratic constraint
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2780890)
