v2009.01.01 - Convex Optimization
v2009.01.01 - Convex Optimization v2009.01.01 - Convex Optimization
732 BIBLIOGRAPHY [147] Peter Gritzmann and Victor Klee. On the complexity of some basic problems in computational convexity: II. volume and mixed volumes. Technical Report TR:94-31, DIMACS, Rutgers University, 1994. ftp://dimacs.rutgers.edu/pub/dimacs/TechnicalReports/TechReports/1994/94-31.ps [148] Peter Gritzmann and Victor Klee. On the complexity of some basic problems in computational convexity: II. volume and mixed volumes. In T. Bisztriczky, P. McMullen, R. Schneider, and A. Ivić Weiss, editors, Polytopes: Abstract, Convex and Computational, pages 373–466. Kluwer Academic Publishers, 1994. [149] L. G. Gubin, B. T. Polyak, and E. V. Raik. The method of projections for finding the common point of convex sets. U.S.S.R. Computational Mathematics and Mathematical Physics, 7(6):1–24, 1967. [150] Osman Güler and Yinyu Ye. Convergence behavior of interior-point algorithms. Mathematical Programming, 60(2):215–228, 1993. [151] P. R. Halmos. Positive approximants of operators. Indiana University Mathematics Journal, 21:951–960, 1972. [152] Shih-Ping Han. A successive projection method. Mathematical Programming, 40:1–14, 1988. [153] Godfrey H. Hardy, John E. Littlewood, and George Pólya. Inequalities. Cambridge University Press, second edition, 1952. [154] Arash Hassibi and Mar Hershenson. Automated optimal design of switched-capacitor filters. Design Automation and Test in Europe Conference, 2001. [155] Johan Håstad. Some optimal inapproximability results. In Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing (STOC), pages 1–10, El Paso Texas USA, 1997. Association for Computing Machinery (ACM). http://citeseer.ist.psu.edu/280448.html , 1999. [156] Johan Håstad. Some optimal inapproximability results. Journal of the Association for Computing Machinery, 48(4):798–859, July 2001. [157] Timothy F. Havel and Kurt Wüthrich. An evaluation of the combined use of nuclear magnetic resonance and distance geometry for the determination of protein conformations in solution. Journal of Molecular Biology, 182:281–294, 1985. [158] Tom L. Hayden and Jim Wells. Approximation by matrices positive semidefinite on a subspace. Linear Algebra and its Applications, 109:115–130, 1988. [159] Tom L. Hayden, Jim Wells, Wei-Min Liu, and Pablo Tarazaga. The cone of distance matrices. Linear Algebra and its Applications, 144:153–169, 1991. [160] Uwe Helmke and John B. Moore. Optimization and Dynamical Systems. Springer-Verlag, 1994. [161] Bruce Hendrickson. Conditions for unique graph realizations. SIAM Journal on Computing, 21(1):65–84, February 1992.
BIBLIOGRAPHY 733 [162] T. Herrmann, Peter Güntert, and Kurt Wüthrich. Protein NMR structure determination with automated NOE assignment using the new software CANDID and the torsion angle dynamics algorithm DYANA. Journal of Molecular Biology, 319(1):209–227, May 2002. [163] Mar Hershenson. Design of pipeline analog-to-digital converters via geometric programming. International Conference on Computer Aided Design - ICCAD, 2002. [164] Mar Hershenson. Efficient description of the design space of analog circuits. 40 th Design Automation Conference, 2003. [165] Mar Hershenson, Stephen Boyd, and Thomas Lee. Optimal design of a CMOS OpAmp via geometric programming. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2001. [166] Mar Hershenson, Dave Colleran, Arash Hassibi, and Navraj Nandra. Synthesizable full custom mixed-signal IP. Electronics Design Automation Consortium - EDA, 2002. [167] Mar Hershenson, Sunderarajan S. Mohan, Stephen Boyd, and Thomas Lee. Optimization of inductor circuits via geometric programming, 1999. [168] Mar Hershenson and Xiling Shen. A new analog design flow. Cadence, 2002. [169] Nick Higham. Matrix Procrustes problems, 1995. http://www.ma.man.ac.uk/∼higham/talks Lecture notes. [170] Richard D. Hill and Steven R. Waters. On the cone of positive semidefinite matrices. Linear Algebra and its Applications, 90:81–88, 1987. [171] Jean-Baptiste Hiriart-Urruty. Ensembles de Tchebychev vs. ensembles convexes: l’état de la situation vu via l’analyse convexe non lisse. Annales des Sciences Mathématiques du Québec, 22(1):47–62, 1998. [172] Jean-Baptiste Hiriart-Urruty and Claude Lemaréchal. Convex Analysis and Minimization Algorithms II: Advanced Theory and Bundle Methods. Springer-Verlag, second edition, 1996. [173] Jean-Baptiste Hiriart-Urruty and Claude Lemaréchal. Fundamentals of Convex Analysis. Springer-Verlag, 2001. [174] Alan J. Hoffman and Helmut W. Wielandt. The variation of the spectrum of a normal matrix. Duke Mathematical Journal, 20:37–40, 1953. [175] Alfred Horn. Doubly stochastic matrices and the diagonal of a rotation matrix. American Journal of Mathematics, 76(3):620–630, July 1954. http://www.convexoptimization.com/TOOLS/AHorn.pdf [176] Roger A. Horn and Charles R. Johnson. Matrix Analysis. Cambridge University Press, 1987. [177] Roger A. Horn and Charles R. Johnson. Topics in Matrix Analysis. Cambridge University Press, 1994.
- Page 681 and 682: E.9. PROJECTION ON CONVEX SET 681 E
- Page 683 and 684: E.9. PROJECTION ON CONVEX SET 683 T
- Page 685 and 686: E.9. PROJECTION ON CONVEX SET 685
- Page 687 and 688: E.10. ALTERNATING PROJECTION 687 E.
- Page 689 and 690: E.10. ALTERNATING PROJECTION 689 b
- Page 691 and 692: E.10. ALTERNATING PROJECTION 691 a
- Page 693 and 694: E.10. ALTERNATING PROJECTION 693 (a
- Page 695 and 696: E.10. ALTERNATING PROJECTION 695 wh
- Page 697 and 698: E.10. ALTERNATING PROJECTION 697 E.
- Page 699 and 700: E.10. ALTERNATING PROJECTION 699 10
- Page 701 and 702: E.10. ALTERNATING PROJECTION 701 E.
- Page 703 and 704: E.10. ALTERNATING PROJECTION 703 E
- Page 705 and 706: Appendix F Notation and a few defin
- Page 707 and 708: 707 a.i. c.i. l.i. w.r.t affinely i
- Page 709 and 710: 709 is or ← → t → 0 + as in
- Page 711 and 712: 711 ∑ π(γ) Ξ Π ∏ ψ(Z) D D
- Page 713 and 714: 713 R m×n Euclidean vector space o
- Page 715 and 716: 715 H − H + ∂H ∂H ∂H −
- Page 717 and 718: 717 O O sort-index matrix order of
- Page 719 and 720: (x,y) angle between vectors x and y
- Page 721 and 722: Bibliography [1] Suliman Al-Homidan
- Page 723 and 724: BIBLIOGRAPHY 723 [24] Alexander I.
- Page 725 and 726: BIBLIOGRAPHY 725 [52] Stephen Boyd,
- Page 727 and 728: BIBLIOGRAPHY 727 [78] Frank Critchl
- Page 729 and 730: BIBLIOGRAPHY 729 [105] Richard L. D
- Page 731: BIBLIOGRAPHY 731 [132] Michel X. Go
- Page 735 and 736: BIBLIOGRAPHY 735 [191] Mark Kahrs a
- Page 737 and 738: BIBLIOGRAPHY 737 [220] K. V. Mardia
- Page 739 and 740: BIBLIOGRAPHY 739 [250] Pythagoras P
- Page 741 and 742: BIBLIOGRAPHY 741 [277] Anthony Man-
- Page 743 and 744: BIBLIOGRAPHY 743 [306] Michael W. T
- Page 745 and 746: [333] Margaret H. Wright. The inter
- Page 747 and 748: Index 0-norm, 203, 261, 294, 296, 2
- Page 749 and 750: INDEX 749 product, 43, 92, 147, 254
- Page 751 and 752: INDEX 751 coordinates, 140, 170, 17
- Page 753 and 754: INDEX 753 affine dimension, 485 fea
- Page 755 and 756: INDEX 755 affine, 209 nonlinear, 19
- Page 757 and 758: INDEX 757 of point, 37 ray, 90 rela
- Page 759 and 760: INDEX 759 normal, 47, 548, 563 norm
- Page 761 and 762: INDEX 761 strictly, 515, 520 functi
- Page 763 and 764: INDEX 763 vector, 45, 241, 248, 325
- Page 765 and 766: INDEX 765 convex envelope, see conv
- Page 767 and 768: INDEX 767 cone, 418, 420, 507 dual,
- Page 769 and 770: INDEX 769 trilateration, 21, 42, 36
- Page 772: Convex Optimization & Euclidean Dis
BIBLIOGRAPHY 733<br />
[162] T. Herrmann, Peter Güntert, and Kurt Wüthrich. Protein NMR structure<br />
determination with automated NOE assignment using the new software CANDID<br />
and the torsion angle dynamics algorithm DYANA. Journal of Molecular Biology,<br />
319(1):209–227, May 2002.<br />
[163] Mar Hershenson. Design of pipeline analog-to-digital converters via geometric<br />
programming. International Conference on Computer Aided Design - ICCAD, 2002.<br />
[164] Mar Hershenson. Efficient description of the design space of analog circuits. 40 th<br />
Design Automation Conference, 2003.<br />
[165] Mar Hershenson, Stephen Boyd, and Thomas Lee. Optimal design of a CMOS<br />
OpAmp via geometric programming. IEEE Transactions on Computer-Aided Design<br />
of Integrated Circuits and Systems, 2001.<br />
[166] Mar Hershenson, Dave Colleran, Arash Hassibi, and Navraj Nandra. Synthesizable<br />
full custom mixed-signal IP. Electronics Design Automation Consortium - EDA,<br />
2002.<br />
[167] Mar Hershenson, Sunderarajan S. Mohan, Stephen Boyd, and Thomas Lee.<br />
<strong>Optimization</strong> of inductor circuits via geometric programming, 1999.<br />
[168] Mar Hershenson and Xiling Shen. A new analog design flow. Cadence, 2002.<br />
[169] Nick Higham. Matrix Procrustes problems, 1995.<br />
http://www.ma.man.ac.uk/∼higham/talks<br />
Lecture notes.<br />
[170] Richard D. Hill and Steven R. Waters. On the cone of positive semidefinite matrices.<br />
Linear Algebra and its Applications, 90:81–88, 1987.<br />
[171] Jean-Baptiste Hiriart-Urruty. Ensembles de Tchebychev vs. ensembles convexes:<br />
l’état de la situation vu via l’analyse convexe non lisse. Annales des Sciences<br />
Mathématiques du Québec, 22(1):47–62, 1998.<br />
[172] Jean-Baptiste Hiriart-Urruty and Claude Lemaréchal. <strong>Convex</strong> Analysis<br />
and Minimization Algorithms II: Advanced Theory and Bundle Methods.<br />
Springer-Verlag, second edition, 1996.<br />
[173] Jean-Baptiste Hiriart-Urruty and Claude Lemaréchal. Fundamentals of <strong>Convex</strong><br />
Analysis. Springer-Verlag, 2001.<br />
[174] Alan J. Hoffman and Helmut W. Wielandt. The variation of the spectrum of a<br />
normal matrix. Duke Mathematical Journal, 20:37–40, 1953.<br />
[175] Alfred Horn. Doubly stochastic matrices and the diagonal of a rotation matrix.<br />
American Journal of Mathematics, 76(3):620–630, July 1954.<br />
http://www.convexoptimization.com/TOOLS/AHorn.pdf<br />
[176] Roger A. Horn and Charles R. Johnson. Matrix Analysis. Cambridge University<br />
Press, 1987.<br />
[177] Roger A. Horn and Charles R. Johnson. Topics in Matrix Analysis. Cambridge<br />
University Press, 1994.
Change language