Steplengths in infeasible primal-dual interior point algorithms of convex quadratic programming.(Technical report of Imperial College of Science, Technology and Medicine. Department of Computing, DOC 97/7.)

Mészáros, Csaba (1997) Steplengths in infeasible primal-dual interior point algorithms of convex quadratic programming.(Technical report of Imperial College of Science, Technology and Medicine. Department of Computing, DOC 97/7.). Imperial College, London, p. 17.

Full text not available from this repository.
Item Type: Book
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 14:53
Last Modified: 11 Dec 2012 14:53
URI: http://eprints.sztaki.hu/id/eprint/1363

Update Item Update Item