Charles Micchelli
Journal of Approximation Theory
A large class of separable quadratic programming problems is presented. The problems in the class can be solved in linear time. The class includes the separable convex quadratic transportation problem with a fixed number of sources and separable convex quadratic programming with nonnegativity constraints and a fixed number of linear equality constraints. © 1993.
Charles Micchelli
Journal of Approximation Theory
J.P. Locquet, J. Perret, et al.
SPIE Optical Science, Engineering, and Instrumentation 1998
John A. Hoffnagle, William D. Hinsberg, et al.
Microlithography 2003
Chai Wah Wu
Linear Algebra and Its Applications