|
REVIEWS AND DESCRIPTIONS OF TABLES AND BOOKS
Book reviews do not contain an abstract.
You may download the entire set of reviews from this issue
using the links below.
Journal:
Math. Comp.
73,
515-516
DOI:
10.1090/S0025-5718-03-01659-4
PII:
S 0025-5718(03)01659-4
Posted:
September 12, 2003
Copyright of article:
Copyright
2003,
American Mathematical Society
Retrieve reviews in:
PDF DVI PostScript
A mathematical view of interior-point methods in convex optimization,
by James Renegar
SIAM,
Philadelphia, PA,
2001,
viii+177,
softcover, $39.50, SIAM member price $27.65
2000
Mathematics Subject Classification.
Primary 90C25,, 90C51
Reviewed by:
Robert
M.
Freund
E-mail address:
rfreund@mit.edu
References:
-
- 1.
- Y. NESTEROV AND A. NEMIROVSKII, Interior Point Polynomial Algorithms in Convex Programming, SIAM, Philadelphia, 1994.MR 94m:90005
- 2.
- Y. NESTEROV AND M. TODD, ``Self-scaled barriers and interior-point methods for convex programming'', Mathematics of Operations Research 22 (1997), pp. 1-42. MR 98c:90093
- 3.
- Y. NESTEROV AND M. TODD, ``Primal-dual interior-point methods for self-scaled cones'', SIAM Journal on Optimization 8 (1998), pp. 324-364. MR 99f:90056
|
Comments: webmaster@ams.org