First Page | Document Content | |
---|---|---|
Date: 2012-01-11 10:10:21Linear algebra Linear programming Interior point method Quadratic programming Lagrange multiplier Matrix Vector space Karush–Kuhn–Tucker conditions Algebra Mathematics Mathematical optimization | ADAPTIVE CONSTRAINT REDUCTION FOR CONVEX QUADRATIC PROGRAMMING∗ ´ L. TITS§ JIN HYUK JUNG† , DIANNE P. O’LEARY‡ , AND ANDRE Abstract. We propose an adaptive, constraint-reduced, primal-dual interior-point algoriAdd to Reading ListSource URL: www.ece.umd.eduDownload Document from Source WebsiteFile Size: 1,14 MBShare Document on Facebook |
Polynomial Time Interactive Proofs for Linear Algebra with Exponential Matrix Dimensions and Scalars Given by Polynomial Time Circuits In memory of Wen-tsun Wu–Jean-Guillaume DumasDocID: 1xUE0 - View Document | |
1 Roadmap for the Development of a Linear Algebra Library for Exascale Computing SLATE: Software for Linear Algebra Targeting ExascaleDocID: 1xUyc - View Document | |
Recent Progress in Linear Algebra and Lattice Basis Reduction Gilles Villard CNRS, ENS de Lyon, INRIA, UCBL, Université de Lyon Laboratoire LIPDocID: 1xUmT - View Document | |
3 Designing SLATE SLATE: Software for Linear Algebra Targeting Exascale Jakub Kurzak Panruo WuDocID: 1xT5s - View Document | |
9. Linear Algebra Po-Shen Loh CMU Putnam Seminar, FallDocID: 1vrLR - View Document |