Conference paper
Learning Reduced Order Dynamics via Geometric Representations
Imran Nasim, Melanie Weber
SCML 2024
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.
Imran Nasim, Melanie Weber
SCML 2024
Dorit S. Hochbaum, Nimrod Megiddo, et al.
Mathematical Programming
Shashanka Ubaru, Lior Horesh, et al.
Journal of Biomedical Informatics
Charles A Micchelli
Journal of Approximation Theory