Sparsity in convex quadratic programming with interior point methods
Mészáros, Csaba (2006) Sparsity in convex quadratic programming with interior point methods. Optimization Methods and Software, 21 (5). pp. 733-745.
Full text not available from this repository.Item Type: | ISI Article |
---|---|
Subjects: | Q Science > QA Mathematics and Computer Science > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány |
Depositing User: | Eszter Nagy |
Date Deposited: | 11 Dec 2012 15:26 |
Last Modified: | 11 Dec 2012 15:26 |
URI: | https://eprints.sztaki.hu/id/eprint/4433 |
Update Item |