High Performance Optimization

Front Cover
Hans Frenk
Springer Science & Business Media, 2000 - Language Arts & Disciplines - 473 pages
0 Reviews
For a long time the techniques of solving linear optimization (LP) problems improved only marginally. Fifteen years ago, however, a revolutionary discovery changed everything. A new `golden age' for optimization started, which is continuing up to the current time. What is the cause of the excitement? Techniques of linear programming formed previously an isolated body of knowledge. Then suddenly a tunnel was built linking it with a rich and promising land, part of which was already cultivated, part of which was completely unexplored. These revolutionary new techniques are now applied to solve conic linear problems. This makes it possible to model and solve large classes of essentially nonlinear optimization problems as efficiently as LP problems. This volume gives an overview of the latest developments of such `High Performance Optimization Techniques'. The first part is a thorough treatment of interior point methods for semidefinite programming problems. The second part reviews today's most exciting research topics and results in the area of convex optimization.
Audience: This volume is for graduate students and researchers who are interested in modern optimization techniques.
 

What people are saying - Write a review

We haven't found any reviews in the usual places.

Contents

VI
3
VII
4
VIII
7
XI
10
XII
11
XIII
12
XV
13
XVI
14
XCIV
248
XCV
249
XCVI
250
XCVII
252
XCVIII
254
XCIX
256
C
261
CI
267

XVII
17
XIX
18
XXI
19
XXII
21
XXIII
22
XXIV
26
XXV
29
XXVI
33
XXVII
36
XXVIII
43
XXIX
50
XXX
56
XXXI
60
XXXII
61
XXXIII
66
XXXIV
70
XXXV
71
XXXVI
76
XXXVII
77
XXXVIII
78
XXXIX
79
XL
81
XLI
82
XLII
83
XLIII
87
XLIV
91
XLV
93
XLVI
96
XLVIII
98
XLIX
101
L
106
LI
113
LII
122
LIII
127
LIV
129
LV
132
LVI
140
LVII
143
LVIII
146
LIX
154
LX
157
LXI
158
LXII
163
LXIII
166
LXIV
171
LXV
173
LXVI
174
LXVII
175
LXVIII
178
LXIX
181
LXX
195
LXXI
197
LXXII
199
LXXIII
200
LXXIV
204
LXXV
205
LXXVI
206
LXXVII
208
LXXVIII
209
LXXX
211
LXXXI
212
LXXXII
214
LXXXIII
218
LXXXIV
219
LXXXVI
220
LXXXVIII
228
LXXXIX
233
XC
234
XCI
237
XCII
240
XCIII
245
CII
269
CIII
271
CIV
274
CV
275
CVI
279
CIX
280
CXI
281
CXII
282
CXIV
283
CXV
286
CXVI
288
CXVII
289
CXVIII
291
CXIX
292
CXX
294
CXXII
303
CXXIII
305
CXXIV
306
CXXV
307
CXXVI
311
CXXVII
314
CXXVIII
317
CXXIX
318
CXXX
322
CXXXI
329
CXXXII
330
CXXXIII
331
CXXXIV
332
CXXXV
334
CXXXVI
337
CXXXVII
339
CXXXVIII
343
CXXXIX
349
CXL
350
CXLI
351
CXLII
352
CXLIII
353
CXLIV
355
CXLV
356
CXLVI
357
CXLVII
367
CXLVIII
369
CXLIX
371
CL
372
CLI
375
CLII
383
CLIII
385
CLIV
390
CLV
400
CLVI
405
CLVII
408
CLVIII
422
CLIX
424
CLX
425
CLXI
428
CLXII
429
CLXIII
431
CLXVI
432
CLXVII
433
CLXVIII
435
CLXIX
436
CLXX
441
CLXXI
449
CLXXII
451
CLXXIII
452
CLXXIV
454
CLXXV
458
CLXXVI
461
CLXXVII
462
CLXXVIII
467
Copyright

Other editions - View all

Common terms and phrases

Popular passages

Page 464 - F. Alizadeh. Interior point methods in semidefinite programming with applications to combinatorial optimization.