机读格式显示(MARC)

• 000 00971nam a2200313 a 4500

• 001 0000700929

• 003 CAL

• 005 20111017095800.0

• 008 110105r20112009cc a b 000 0 eng d

• 020 __ |a 9787302237600 (pbk.)

• 040 __ |a RUC |c RUC

• 090 __ |a O174.13/B551C

• 093 __ |a O174.13 |2 4

• 099 __ |a CAL 022011003789

• 100 1_ |a Bertsekas, Dimitri P.

• 245 10 |a Convex optimization theory = |b 凸优化理论 / |c Dimitri P. Bertsekas著.

• 246 31 |a 凸优化理论

• 260 __ |a 北京 : |b 清华大学出版社, |c 2011.

• 300 __ |a x, 403 p. : |b ill. ; |c 24 cm.

• 490 1_ |a 清华版双语教学用书

• 504 __ |a Includes bibliographical references (p. 395-403)

• 534 __ |p Reprint. Originally published: |c Belmont, Mass. : Athena Scientific, c2009.

• 650 _0 |a Convex programming.

• 650 _0 |a Mathematical optimization.

• 650 _0 |a Convex functions.

• 650 _0 |a Duality theory (Mathematics)

• 920 __ |a 242450 |z 2

• 950 __ |a JHUD |b O174.13 |c B551C

• 998 __ |a RUC