An efficient implementation of the primal-dual interior-point method for linear and convex quadratic programming. (Working paper of the Laboratory of Operations Research and Decision Systems, (LORDS) WP 98-12.)

Mészáros, Csaba (1998) An efficient implementation of the primal-dual interior-point method for linear and convex quadratic programming. (Working paper of the Laboratory of Operations Research and Decision Systems, (LORDS) WP 98-12.). MTA SZTAKI, Budapest, p. 31.

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:54
Last Modified: 11 Dec 2012 14:54
URI: https://eprints.sztaki.hu/id/eprint/1694

Update Item Update Item