ISBN-13: 9789810214159 / Angielski / Twarda / 1993 / 528 str.
A collection of articles on recent complexity developments in numerical optimization. The topics covered include complexity of approximation algorithms, new polynomial time algorithms for convex quadratic minimization and interior point algorithms.