Quadratic minimization and least distance programming
Quadratic minimization problems constitute a significant and important subset of optimization problems. Research has shown that a convex quadratic programming problem can be reduced to a least distance programming problem using a unique and non-singular "linear least distance transformation.&qu...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en |
| Published: |
Virginia Polytechnic Institute and State University
2017
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10919/76210 |