\def\cprime{$'$} \def\cprime{$'$} \def\cprime{$'$}
  \def\udot#1{\ifmmode\oalign{$#1$\crcr\hidewidth.\hidewidth
  }\else\oalign{#1\crcr\hidewidth.\hidewidth}\fi} \def\cprime{$'$}
\begin{thebibliography}{100}

\bibitem{Aarts:99}
L.~AARTS.
\newblock Primal-dual search directions in semidefinite optimization.
\newblock Master's thesis, 1999.

\bibitem{AMR:88}
R.~ABRAHAM, J.E. MARSDEN, and T.~RATIU.
\newblock {\em Manifolds, Tensor Analysis, and Applications}, volume~75 of {\em
  Applied Mathematical Sciences}.
\newblock Springer-Verlag, 1988.
\newblock Second edition.

\bibitem{ABBZ}
A.~ACHTZIGER, A.~Ben-Tal, M.~BENDS\OE, and J.~ZOWE.
\newblock Equivalent displacement-based formulations for maximum strength truss
  topology design.
\newblock {\em IMPACT of Computing in Science and Engineering}, 4:315--345,
  1992.

\bibitem{AdDe:94}
W.P. ADAMS and P.M. DEARING.
\newblock On the equivalence between roof duality and {L}agrangian duality for
  unconstrained $0-1$ quadratic programming problems.
\newblock {\em Discrete Appl. Math.}, 48:1--20, 1994.

\bibitem{MR87m:90084}
W.P. Adams and H.D. Sherali.
\newblock A tight linearization and an algorithm for zero-one quadratic
  programming problems.
\newblock {\em Management Sci.}, 32(10):1274--1290, 1986.

\bibitem{MR94e:90062}
W.P. Adams and H.D. Sherali.
\newblock Mixed-integer bilinear programming problems.
\newblock {\em Math. Programming}, 59(3, Ser. A):279--305, 1993.

\bibitem{AdlerAliz:95}
I.~ADLER and F.~Alizadeh.
\newblock Primal-dual interior point algorithms for convex quadratically
  constrained and semidefinite optimization problems.
\newblock Technical report, Rutcor, Rutgers University, New Brunswick, NJ,
  1995.

\bibitem{AdlerMonteiro}
I.~ADLER and R.D.C. Monteiro.
\newblock A geometric view of parametric linear programming.
\newblock {\em Algorithmica}, 8:161--176, 1992.

\bibitem{AgHeMc:88}
J.~AGLER, J.W. HELTON, and S.~McCULLOUGH.
\newblock Positive semidefinite matrices with a given sparsity pattern.
\newblock {\em Linear Algebra Appl.}, 107(3):101--149, 1988.

\bibitem{Akh65}
N.I. AKHIEZER.
\newblock {\em The Classical Moment Problem}.
\newblock Hafner, New York, NY, 1965.

\bibitem{Alhom:93}
S.~Al-Homidan.
\newblock {\em Hybrid methods for optimization problems with positive
  semidefinite matrix constraints}.
\newblock PhD thesis, 1993.

\bibitem{MR93c:90072}
F.A. AL-KHAYYAL, R.~HORST, and P.M. PARDALOS.
\newblock Global optimization of concave functions subject to quadratic
  constraints: an application in nonlinear bilevel programming.
\newblock {\em Ann. Oper. Res.}, 34(1-4):125--147, 1992.

\bibitem{AlKaWo:97}
A.~Alfakih, A.~Khandani, and H.~Wolkowicz.
\newblock Solving {E}uclidean distance matrix completion problems via
  semidefinite programming.
\newblock {\em Comput. Optim. Appl.}, 12(1-3):13--30, 1999.
\newblock A tribute to Olvi Mangasarian.

\bibitem{AlWo:98}
A.~Alfakih and H.~Wolkowicz.
\newblock On the embeddability of weighted graphs in {E}uclidean spaces.
\newblock Technical Report CORR 98-12, University of Waterloo, 1998.

\bibitem{Al:91}
F.~Alizadeh.
\newblock {\em Combinatorial optimization with interior point methods and
  semidefinite matrices}.
\newblock PhD thesis, 1991.

\bibitem{Aliz:92}
F.~Alizadeh.
\newblock Combinatorial optimization with semidefinite matrices.
\newblock In {\em Proceedings of the Second Annual Integer Programming and
  Combinatorial Optimization Conference}, Carnegie-Mellon University, 1992.

\bibitem{Al:92}
F.~Alizadeh.
\newblock Optimization over positive semi-definite cone; interior-point methods
  and combinatorial applications.
\newblock In P.M. Pardalos, editor, {\em Advances in Optimization and Parallel
  Computing}, pages 1--25. North--Holland, 1992.

\bibitem{Alizadeh:92}
F.~Alizadeh.
\newblock Semidefinite programming: duality theory, eigenvalue optimization and
  combinatorial applications.
\newblock Technical report, Stanford University, 1992.
\newblock Presented at the Fourth SIAM Conference on Optimization, 1992.

\bibitem{Al:94}
F.~Alizadeh.
\newblock Interior point methods in semidefinite programming with applications
  to combinatorial optimization.
\newblock {\em SIAM J. Optim.}, 5:13--51, 1995.

\bibitem{AHNOS97}
F.~Alizadeh, J.-P. Haeberly, M.V. NAYAKKANKUPPAM, M.L. Overton, and S.H.
  SCHMIETA.
\newblock {SDP}pack user's guide -- version 0.9 {B}eta.
\newblock Technical Report TR1997--737, Courant Institute of Mathematical
  Sciences, NYU, New York, NY, June 1997.

\bibitem{AlHaOv:94}
F.~Alizadeh, J-P.A. Haeberly, and M.L. Overton.
\newblock A new primal-dual interior-point method for semidefinite programming.
\newblock In J.G. Lewis, editor, {\em Proceedings of the Fifth SIAM Conference
  on Applied Linear Algebra}, pages 113--117. SIAM, 1994.

\bibitem{AlHaOv:95}
F.~Alizadeh, J-P.A. Haeberly, and M.L. Overton.
\newblock Complementarity and nondegeneracy in semidefinite programming.
\newblock {\em Math. Programming}, 77:111--128, 1997.

\bibitem{AlHaOv:98}
F.~Alizadeh, J-P.A. Haeberly, and M.L. Overton.
\newblock Primal-dual interior-point methods for semidefinite programming:
  Convergence rates, stability and numerical results.
\newblock {\em SIAM J. Optim.}, 8:746--768, 1998.

\bibitem{ASch:98}
F.~Alizadeh and S.H. SCHMIETA.
\newblock Optimization with semidefinite, quadratic and linear constraints.
\newblock Technical Report RRR23--97, RUTCOR, Rutgers University, New
  Brunswick, NJ, November 1997.

\bibitem{all}
J.C.\ ALLWright.
\newblock On maximizing the minimum eigenvalue of a linear combination of
  symmetric matrices.
\newblock {\em SIAM J. Matrix Anal. Appl.}, 10(3):347--382, 1989.

\bibitem{AlonS98}
N.~ALON and B.~SUDAKOV.
\newblock Bipartite subgraphs and the smallest eigenvalue.
\newblock Technical report, 1998.

\bibitem{int:Andersen26}
E.D. Andersen, J.~Gondzio, C.~M{\'esz\'aros}, and X.~XU.
\newblock Implementation of interior-point methods for large scale linear
  programs.
\newblock In T.~Terlaky, editor, {\em Interior point methods of mathematical
  programming}, pages 189--252. Kluwer, Dordrecht, The Netherlands, 1996.

\bibitem{AnV:73}
B.~ANDERSON and S.~VONGPANITLERD.
\newblock {\em Network analysis and synthesis: a modern systems theory
  approach}.
\newblock Prentice-Hall, 1973.

\bibitem{AnOl:78}
T.W. ANDERSON and I.~OLKIN.
\newblock An extremal problem for positive definite matrices.
\newblock {\em Linear and Multilinear Algebra}, 6:257--262, 1978.

\bibitem{An}
T.~ANDO.
\newblock Concavity of certain maps and positive definite matrices and
  applications to {H}adamard products.
\newblock {\em Linear Algebra Appl.}, 26:203--241, 1979.

\bibitem{MR95k:15023}
T.~ANDO and F.~HIAI.
\newblock Inequality between powers of positive semidefinite matrices.
\newblock {\em Linear Algebra Appl.}, 208/209:65--71, 1994.

\bibitem{AnWo:99}
M.F. Anjos and H.~Wolkowicz.
\newblock A strengthened {SDP} relaxation via a second lifting for the
  {M}ax-{C}ut problem.
\newblock Technical Report CORR 99-55, University of Waterloo, Waterloo,
  Ontario, 1999.
\newblock 28 pages.

\bibitem{Ans:98}
K.M. Anstreicher.
\newblock On the equivalence of convex programming bounds for {B}oolean
  quadratic programming.
\newblock Technical report, University of Iowa, Iowa City, IA, 1998.

\bibitem{Ans:99}
K.M. Anstreicher.
\newblock Eigenvalue bounds versus semidefinite relaxations for the quadratic
  assignment problem.
\newblock {\em SIAM J. Optim.}, 11(1):254--265 (electronic), 2000.

\bibitem{AnChWoYu:98}
K.M. Anstreicher, X.~Chen, H.~Wolkowicz, and Y.~Yuan.
\newblock Strong duality for a trust-region type relaxation of the quadratic
  assignment problem.
\newblock {\em Linear Algebra Appl.}, 301(1-3):121--136, 1999.

\bibitem{AFLW:96}
K.M. ANSTREICHER, M.~FAMPA, J.~LEE, and J.~WILLIAMS.
\newblock Continuous relaxations for constrained maximum-entropy sampling.
\newblock In W.H. Cunningham, T.~McCormick, and M.~Queyranne, editors, {\em
  Integer Programming and Combinatorial Optimization (Vancouver, BC, 1996)},
  volume 1084 of {\em Lecture Notes in Comput. Sci.}, pages 234--248. Springer,
  Berlin, 1996.

\bibitem{AFLW:97}
K.M. ANSTREICHER, M.~FAMPA, J.~LEE, and J.~WILLIAMS.
\newblock Using continuous nonlinear relaxations to solve constrained
  maximum-entropy sampling problems.
\newblock {\em Math. Programming}, Ser. A, 85(2):221--240, 1999.

\bibitem{AnstVial:94}
K.M. Anstreicher and J.-P. VIAL.
\newblock On the convergence of an infeasible primal-dual interior-point method
  for convex programming.
\newblock {\em Optim. Methods Softw.}, 3:273--283, 1994.

\bibitem{AnWo:98}
K.M. Anstreicher and H.~Wolkowicz.
\newblock On {L}agrangian relaxation of quadratic matrix constraints.
\newblock {\em SIAM J. Matrix Anal. Appl.}, 22(1):41--55, 2000.

\bibitem{ApA:98}
P.~APKARIAN and R.J. ADAMS.
\newblock Advanced gain-scheduled techniques for uncertain systems.
\newblock {\em IEEE Trans.\ Control Sys.\ Tech.}, 6(1):21--32, January 1998.

\bibitem{AG:95}
P.~APKARIAN and P.~GAHINET.
\newblock A convex characterization of gain-scheduled {${\cal H}_{\infty}$}
  controllers.
\newblock {\em IEEE Trans.\ Aut.\ Control}, AC-40(5):853--864, 1995.

\bibitem{AGB:95}
P.~APKARIAN, P.~GAHINET, and G.~BECKER.
\newblock Self-scheduled {${\cal H}_{\infty}$} control of linear
  parameter-varying systems: A design example.
\newblock {\em Automatica}, 31(9):1251--1261, 1995.

\bibitem{at}
M.\ ARGAEZ and R.A.\ Tapia.
\newblock On the global convergence of a modified augmented {L}agrangian
  linesearch interior-point {N}ewton method for nonlinear programming.
\newblock Technical Report 95-38, Dept.\ of Comp.\ and Appl.\ Math., Rice
  University, 1997.

\bibitem{AsanoW00}
T.~ASANO and D.P. Williamson.
\newblock Improved approximation algorithms for {MAX SAT}.
\newblock In {\em Proc.11th {ACM-SIAM} Symp. on Disc. Algs.}, 2000.

\bibitem{abr}
F.~AVRAM, D.~Bertsimas, and M.~RICARD.
\newblock Optimization of multiclass queueing networks: a linear control
  approach.
\newblock In {\em Stochastic Networks, Proceedings of the IMA}, pages 199--234.
  F. Kelly and R. Williams eds., 1995.

\bibitem{babre}
F.~BACCELLI and P.~BR\'EMAUD.
\newblock {\em Elements of Queueing Theory: Palm-Martingale Calculus and
  Stochastic Recurrences}.
\newblock Springer-Verlag, Berlin, 1994.

\bibitem{MR1450160}
R.~BA{\v{C}}{\'I}K and S.~MAHAJAN.
\newblock Semidefinite programming and its applications to {N}{P} problems.
\newblock In {\em Computing and combinatorics (Xi'an, 1995)}, volume 959 of
  {\em Lecture Notes in Comput. Sci.}, pages 566--575. Springer, Berlin, 1995.

\bibitem{Bal:95}
V.~Balakrishnan.
\newblock Linear matrix inequalities in robustness analysis with multipliers.
\newblock {\em Syst.\ Control Letters}, 25(4):265--272, 1995.

\bibitem{BaF:96}
V.~Balakrishnan and E.~FERON, editors.
\newblock {\em Linear matrix inequalities in control theory and applications}.
\newblock John Wiley \& Sons Ltd., Chichester, 1996.
\newblock Internat. J. Robust Nonlinear Control {\bf 6} (1996), no. 9-10.

\bibitem{MR558566}
E.~Balas.
\newblock Disjunctive programming.
\newblock {\em Ann. Discrete Math.}, 5:3--51, 1979.
\newblock Discrete optimization (Proc. Adv. Res. Inst. Discrete Optimization
  and Systems Appl., Banff, Alta., 1977), II.

\bibitem{MR98f:90038}
E.~Balas.
\newblock A modified lift-and-project procedure.
\newblock {\em Math. Programming}, 79(1-3, Ser. B):19--31, 1997.
\newblock Lectures on Mathematical Programming (ismp97) (Lausanne, 1997).

\bibitem{MR99k:90101}
E.~Balas.
\newblock Disjunctive programming: properties of the convex hull of feasible
  points.
\newblock {\em Discrete Appl. Math.}, 89(1-3):3--44, 1998.

\bibitem{BaCeCo:93}
E.~Balas, S.~Ceria, and G.~Cornuejols.
\newblock A lift-and-project cutting plane algorithm for mixed 0-1 programs.
\newblock {\em Math. Programming}, 58:295--324, 1993.

\bibitem{MR1213236}
E.~Balas, S.~Ceria, and G.~Cornu{\'e}jols.
\newblock Solving mixed $0$-$1$ programs by a lift-and-project method.
\newblock In {\em Proceedings of the Fourth Annual ACM-SIAM Symposium on
  Discrete Algorithms (Austin, TX, 1993)}, pages 232--242, New York, 1993. ACM.

\bibitem{MR94c:90070}
E.~Balas and M.~FISCHETTI.
\newblock A lifting procedure for the asymmetric traveling salesman polytope
  and a large new class of facets.
\newblock {\em Math. Programming}, 58(3, Ser. A):325--352, 1993.

\bibitem{MR90k:90106}
E.~Balas and S.~M. NG.
\newblock On the set covering polytope. {I}{I}. {L}ifting the facets with
  coefficients in $\{0,1,2\}$.
\newblock {\em Math. Programming}, 45(1 (Ser. B)):1--20, 1989.

\bibitem{MR85f:90075}
E.~Balas and E.~ZEMEL.
\newblock Lifting and complementing yields all the facets of positive zero-one
  programming polytopes.
\newblock In {\em Mathematical programming (Rio de Janeiro, 1981)}, pages
  13--24. North-Holland, Amsterdam, 1984.

\bibitem{mutools}
G.~BALAS, J.~C. DOYLE, K.~GLOVER, A.~PACKARD, and R.~SMITH.
\newblock {\em $\mu$-analysis and synthesis}.
\newblock MUSYN, inc., and The Mathworks, Inc., 1991.

\bibitem{MR96c:90056}
R.~BALDICK.
\newblock A unified approach to polynomially solvable cases of integer
  ``non-separable'' quadratic optimization.
\newblock {\em Discrete Appl. Math.}, 61(3):195--212, 1995.

\bibitem{MR1286693}
J.R. BAR-ON and K.A. GRASSE.
\newblock Global optimization of a quadratic functional with quadratic equality
  constaints.
\newblock {\em J. Optim. Theory Appl.}, 82(2):379--386, 1994.

\bibitem{MR98c:90084}
J.R. BAR-ON and K.A. GRASSE.
\newblock Global optimization of a quadratic functional with quadratic equality
  constraints. {I}{I}.
\newblock {\em J. Optim. Theory Appl.}, 93(3):547--556, 1997.

\bibitem{MR84k:90048}
F.~BARAHONA.
\newblock The max-cut problem on graphs not contractible to ${K}\sb{5}$.
\newblock {\em Oper. Res. Lett.}, 2(3):107--111, 1983.

\bibitem{BGJR:88}
F.~BARAHONA, M.~GR{\"{O}}TSCHEL, M.~J{\"{U}}NGER, and G.~REINELT.
\newblock An application of combinatorial optimization to statistical physics
  and circuit layout design.
\newblock {\em Oper. Res.}, 36:493--513, 1988.

\bibitem{MR87m:15045}
G.~P. Barker, M.~LAIDACKER, and G.~POOLE.
\newblock Projectionally exposed cones.
\newblock {\em SIAM J. Algebraic Discrete Methods}, 8(1):100--105, 1987.

\bibitem{Bark:73}
G.P. Barker.
\newblock The lattice of faces of a finite dimensional cone.
\newblock {\em Linear Algebra Appl.}, 7:71--82, 1973.

\bibitem{Bark:77}
G.P. Barker.
\newblock Faces and duality in convex cones.
\newblock {\em Linear and Multilinear Algebra}, 6:161--169, 1977.

\bibitem{Bark:81}
G.P. Barker.
\newblock Theory of cones.
\newblock {\em Linear Algebra Appl.}, 39:263--291, 1981.

\bibitem{Bark:89}
G.P. Barker.
\newblock Automorphism groups of algebras of triangular matrices.
\newblock {\em Linear Algebra Appl.}, 121:207--215, 1989.

\bibitem{Bark:92}
G.P. Barker.
\newblock Automorphism of triangular matrices over graphs.
\newblock {\em Linear Algebra Appl.}, 160:63--74, 1992.

\bibitem{BaCa:75}
G.P. Barker and D.~Carlson.
\newblock Cones of diagonally dominant matrices.
\newblock {\em Pacific J. of Math.}, 57:15--32, 1975.

\bibitem{BarTam:97}
G.P. Barker and B.-S. TAM.
\newblock Baer semirings and {B}aer $\sp *$-semirings of cone-preserving maps.
\newblock {\em Linear Algebra Appl.}, 256:165--183, 1997.

\bibitem{Bar:97}
E.R. BARNES.
\newblock Bounds for the largest clique in a graph.
\newblock Technical report, Georgia Tech., 1997.

\bibitem{Barv:95}
A.~Barvinok.
\newblock Problems of distance geometry and convex properties of quadratic
  maps.
\newblock {\em Discrete Comput. Geom.}, 13(2):189--202, 1995.

\bibitem{Barv:99}
A.~Barvinok.
\newblock On convex properties of the quadratic image of the sphere.
\newblock Technical report, University of Michigan, 1999.

\bibitem{Bec:93}
G.~BECKER.
\newblock {\em Quadratic Stability and Performance of Linear Parameter
  Dependent Systems}.
\newblock PhD thesis, University of California, Berkeley, 1993.

\bibitem{Bellare}
M.~BELLARE and P.~ROGAWAY.
\newblock The complexity of approximating a nonlinear program.
\newblock {\em Math. Programming}, 69:429--442, 1995.

\bibitem{FanBell:63}
Richard Bellman and Ky~Fan.
\newblock On systems of linear inequalities in {H}ermitian matrix variables.
\newblock In V.L. Klee, editor, {\em Convexity, Proc. Sympos. Pure Math., Vol.
  VII}, pages 1--11. Amer. Math. Soc., Providence, R.I., 1963.

\bibitem{biChKo:69}
A.~Ben-Israel, A.~Charnes, and K.~Kortanek.
\newblock Duality and asymptotic solvability over cones.
\newblock {\em Bulletin of American Mathematical Society}, 75(2):318--324,
  1969.

\bibitem{BTBN}
A.~Ben-Tal and M.~P. BENDS\OE.
\newblock A new method for optimal truss topology design.
\newblock {\em SIAM Journal of Optimization}, 3:322--358, 1993.

\bibitem{BenKocNemZow:99}
A.~Ben-Tal, M.~KOCVARA, A.S. Nemirovski, and J.~ZOWE.
\newblock Free material design via semidefinite programming: The multiload case
  with contact conditions.
\newblock {\em SIAM J. Optim.}, 9(4):813 -- 832, 1999.

\bibitem{BTNM2}
A.~Ben-Tal and A.S. Nemirovski.
\newblock Potential reduction polynomial time method for truss topology design.
\newblock {\em SIAM J. Optim.}, 4:596--612, 1994.

\bibitem{BNRT}
A.~Ben-Tal and A.S. Nemirovski.
\newblock Robust truss topology design via semidefinite programming.
\newblock {\em SIAM J. Optim.}, 7(4):991--1016, 1997.

\bibitem{BNWP}
A.~Ben-Tal and A.S. Nemirovski.
\newblock Robust convex optimization.
\newblock {\em Math. Oper. Res.}, 23(4):769--805, 1998.

\bibitem{RLP}
A.~Ben-Tal and A.S. Nemirovski.
\newblock Robust solutions of uncertain linear programs.
\newblock {\em Oper. Res. Lett.}, 25(1):1--13, 1999.

\bibitem{MR84d:90090}
A.~BEN-TAL and J.~ZOWE.
\newblock A unified theory of first and second order conditions for extremum
  problems in topological vector spaces.
\newblock {\em Math. Programming Stud.}, 19:39--76, 1982.

\bibitem{bbook}
M.~P. BENDS\OE.
\newblock {\em Optimization of Structural Topology, Shape and Material}.
\newblock Springer, Heidelberg, 1995.

\bibitem{BNBTZ}
M.~P. BENDS\OE, A.~Ben-Tal, and J.~ZOWE.
\newblock Optimization methods for truss geometry and topology design.
\newblock {\em Structural Optimization}, To appear.

\bibitem{BNGHRT}
M.P. BENDS\OE, J.M. GUEDES, R.B. HABER, P.~REDERSEN, and J.E. TAYLOR.
\newblock An analytical model to predict optimal material properties in the
  context of optimal structural design.
\newblock Technical Report \# 453, Technical University of Denmark, Lyngby,
  1992.

\bibitem{Bengts:99}
M.~BENGTSSON and B.~OTTERSTEN.
\newblock Optimal transmit beam forming using convex optimization.
\newblock Technical report, Royal Institute of Technology, Stockholm, Sweden,
  1999.

\bibitem{BensYeZhang:97}
S.~J. Benson, Y.~Ye, and X.~Zhang.
\newblock Solving large-scale sparse semidefinite programs for combinatorial
  optimization.
\newblock {\em SIAM J. Optim.}, 10(2):443--461 (electronic), 2000.

\bibitem{BGW96}
Y.~BERGMAN, B.~GRUNDY, and Z.~WIENER.
\newblock General properties of option prices.
\newblock {\em J. Finance}, 51(5):1573--1610, December 1996.

\bibitem{BerkJansRoosTerlaky2}
A.B. BERKELAAR, B.~JANSEN, K.~Roos, and T.~Terlaky.
\newblock Basis- and tripartition identification for quadratic programming and
  linear complementarity problems. from an interior point solution to an
  optimal basis and vice versa.
\newblock Technical report, Delft University of Technology, Delft University,
  Delft, The Netherlands, 1996.

\bibitem{BerkJansRoosTerlaky1}
A.B. BERKELAAR, B.~JANSEN, K.~Roos, and T.~Terlaky.
\newblock Sensitivity analysis in (degenerate) quadratic programming.
\newblock Technical report, Delft University of Technology, Delft, The
  Netherlands, 1996.

\bibitem{Ber:73}
A.~Berman.
\newblock {\em Cones, Matrices and Mathematical Programming}.
\newblock Springer-Verlag, Berlin, New York, 1973.

\bibitem{ber95}
D.~Bertsimas.
\newblock The achievable region method in the optimal control of queueing
  systems; formulations, bounds and policies.
\newblock {\em Queueing Systems}, 21:337--389, 1995.

\bibitem{bega}
D.~Bertsimas and D.~GAMARNIK.
\newblock Asymptotically optimal algorithms for job shop scheduling and packet
  routing.
\newblock Submitted for publication, 1998.

\bibitem{beni93a}
D.~Bertsimas and J.~NI{N}O-MORA.
\newblock Conservation laws, extended polymatroids and multi-armed bandit
  problems; a polyhedral approach to indexable systems.
\newblock {\em Math. Oper. Res.}, 21:257--306, 1996.

\bibitem{beni96a}
D.~Bertsimas and J.~NI{N}O-MORA.
\newblock Optimization of multiclass queueing networks with changeover times
  via the achievable region approach: Part i, the single-station case.
\newblock {\em Math. Oper. Res.}, To appear.

\bibitem{beni96b}
D.~Bertsimas and J.~NI{N}O-MORA.
\newblock Optimization of multiclass queueing networks with changeover times
  via the achievable region approach: Part ii, the multi-station case.
\newblock {\em Math. Oper. Res.}, To appear.

\bibitem{beni93b}
D.~Bertsimas and J.~NI{N}O-MORA.
\newblock Restless bandits, linear programming relaxations and a primal-dual
  heuristic.
\newblock {\em Oper. Res.}, To appear.

\bibitem{bptbb}
D.~Bertsimas, I.~PASCHALIDIS, and J.~TSITSIKLIS.
\newblock Branching bandits and {K}limov's problem: achievable region and side
  constraints.
\newblock {\em IEEE Trans. Automat. Control}, 40:2063--2075, 1995.

\bibitem{bpt}
D.~Bertsimas, I.~Ch. PASCHALIDIS, and J.~N. TSITSIKLIS.
\newblock Optimization of multiclass queueing networks: polyhedral and
  nonlinear characterizations of achievable performance.
\newblock {\em Ann. Appl. Probab.}, 4(1):43--75, 1994.

\bibitem{BP98b}
D.~Bertsimas and I.~POPESCU.
\newblock On the relation between option and stock prices: an optimization
  approach.
\newblock Submitted for publication, 1998.

\bibitem{BP98}
D.~Bertsimas and I.~POPESCU.
\newblock Optimal inequalities in probability: a convex programming approach.
\newblock Submitted for publication, 1998.

\bibitem{BT97}
D.~Bertsimas and J.~TSITSIKLIS.
\newblock {\em Introduction to Linear Optimization}.
\newblock Athena Scientific, Belmont, MA, 1997.

\bibitem{BV94}
D.~Bertsimas and R.~VOHRA.
\newblock Rounding algorithms for covering problems.
\newblock {\em Math. Progr.}, 80:63--89, 1998.

\bibitem{berxu}
D.~Bertsimas and H.~XU.
\newblock Optimization of polling systems and dynamic vehicle routing problems
  on networks.
\newblock Working paper, Operations Research Center, MIT, 1993.

\bibitem{beye}
D.~Bertsimas and Y.~Ye.
\newblock Semidefinite relaxations, multivariate normal distributions, and
  order statistics.
\newblock In D.-Z. Du and P.M. Pardalos, editors, {\em Handbook of
  Combinatorial Optimization}, volume~3, pages 1--19. Kluwer Academic
  Publishers, 1998.

\bibitem{bha87}
R.~Bhatia.
\newblock {\em Perturbation Bounds for Matrix Eigenvalues : Pitman Research
  Notes in Mathematics Series 162}.
\newblock Longman, New York, 1987.

\bibitem{MR98i:15003}
R.~Bhatia.
\newblock {\em Matrix analysis}.
\newblock Springer-Verlag, New York, 1997.

\bibitem{BirWet84}
J.R. BIRGE and R.J.-B. WETS.
\newblock Approximations and error bounds in stochastic programming.
\newblock In {\em Inequalities in statistics and probability (Lincoln, Neb.,
  1982)}, pages 178--186. Inst. Math. Statist., Hayward, Calif., 1984.

\bibitem{BoTo:95}
P.T. BOGGS and J.W. TOLLE.
\newblock Sequential quadratic programming.
\newblock {\em Acta Numerica}, 4:1--50, 1995.

\bibitem{Bohnen:48}
F.~BOHNENBLUST.
\newblock Joint positiveness of matrices.
\newblock Technical report, UCLA, 1948.
\newblock Manuscript.

\bibitem{MR1673454}
I.~M. BOMZE.
\newblock On standard quadratic optimization problems.
\newblock {\em J. Global Optim.}, 13(4):369--387, 1998.
\newblock Workshop on Global Optimization (Trier, 1997).

\bibitem{MR95a:90054}
I.~M. BOMZE and G.~DANNINGER.
\newblock A global optimization algorithm for concave quadratic programming
  problems.
\newblock {\em SIAM J. Optim.}, 3(4):826--842, 1993.

\bibitem{BonComShap:96b}
J.F. Bonnans, R.~Cominetti, and A.~Shapiro.
\newblock Sensitivity analysis of optimization problems under second order
  regular constraints.
\newblock {\em Math. Oper. Res.}, 23:806--831, 1998.

\bibitem{BonComShap:96a}
J.F. Bonnans, R.~Cominetti, and A.~Shapiro.
\newblock Second order optimality conditions based on parabolic second order
  tangent sets.
\newblock {\em SIAM J. Optim.}, 9:466--492, 1999.

\bibitem{BonShap:97}
J.F. Bonnans and A.~Shapiro.
\newblock Nondegeneracy and quantitative stability of parameterized
  optimization problems with multiple solutions.
\newblock {\em SIAM J. Optim.}, 8(4):940--946 (electronic), 1998.

\bibitem{BonShap:96}
J.F. Bonnans and A.~Shapiro.
\newblock Optimization problems with perturbations, a guided tour.
\newblock {\em SIAM Review}, 40(2):228--264 (electronic), 1998.

\bibitem{Bo:87}
R.B. BOPPANA.
\newblock Eigenvalues and graph bisection: An average case analysis.
\newblock In {\em Proceedings of the 28th Annual Symposium on Foundations of
  Computer Science}, pages 280--285, Los Angeles, California, 1987. IEEE.

\bibitem{Borchers:99}
B.~Borchers.
\newblock C{S}{D}{P}, a {C} library for semidefinite programming.
\newblock {\em Optim. Methods Softw.}, 11/12(1-4):613--623, 1999.
\newblock projects.coin-or.org/Csdp.

\bibitem{Borchers:99b}
B.~Borchers.
\newblock {SDPLIB} 1.2, a library of semidefinite programming test problems.
\newblock {\em Optim. Methods Softw.}, 11(1):683--690, 1999.
\newblock Interior point methods.

\bibitem{MR92j:90049}
E.~BOROS and P.~L. HAMMER.
\newblock The max-cut problem and quadratic $0$-$1$ optimization; polyhedral
  aspects, relaxations and bounds.
\newblock {\em Ann. Oper. Res.}, 33(1-4):151--180, 1991.
\newblock Topological network design (Copenhagen, 1989).

\bibitem{bw2}
J.M. Borwein and H.~Wolkowicz.
\newblock Characterization of optimality for the abstract convex program with
  finite-dimensional range.
\newblock {\em J. Austral. Math. Soc. Ser. A}, 30(4):390--411, 1980/81.

\bibitem{bw1}
J.M. Borwein and H.~Wolkowicz.
\newblock Facial reduction for a cone-convex programming problem.
\newblock {\em J. Austral. Math. Soc. Ser. A}, 30(3):369--380, 1980/81.

\bibitem{bw6}
J.M. Borwein and H.~Wolkowicz.
\newblock Cone-convex programming stability and affine constraint functions.
\newblock In {\em Generalized Concavity in Optimization and Economics}, pages
  379--397. NATO conference, Academic Press, 1981.
\newblock invited paper.

\bibitem{bw3}
J.M. Borwein and H.~Wolkowicz.
\newblock Regularizing the abstract convex program.
\newblock {\em J. Math. Anal. Appl.}, 83(2):495--530, 1981.

\bibitem{bw4}
J.M. Borwein and H.~Wolkowicz.
\newblock Characterizations of optimality without constraint qualification for
  the abstract convex program.
\newblock {\em Math. Programming Stud.}, 19:77--100, 1982.
\newblock Optimality and stability in mathematical programming.

\bibitem{BoWo:86}
J.M. Borwein and H.~Wolkowicz.
\newblock A simple constraint qualification in infinite-dimensional
  programming.
\newblock {\em Math. Programming}, 35(1):83--96, 1986.

\bibitem{box}
O.J. BOXMA.
\newblock Workloads and waiting times in single-server systems with multiple
  customer classes.
\newblock {\em Queueing Systems}, 5:185--214, 1989.

\bibitem{BoGhFeBa:93}
S.~Boyd, V.~Balakrishnan, E.~Feron, and L.~{El~{G}haoui}.
\newblock Control system analysis and synthesis via linear matrix inequalities.
\newblock {\em {Proc. ACC}}, pages 2147--2154, 1993.

\bibitem{BoB:91}
S.~Boyd and C.~H. BARRATT.
\newblock {\em Linear Controller Design. Limits of Performance}.
\newblock Prentice-Hall, 1991.

\bibitem{Boyd:92}
S.~Boyd and L.\ {EL GHAOUI}.
\newblock Method of centers for minimizing generalized eigenvalues.
\newblock {\em Linear Algebra Appl.}, 188:63--111, 1993.

\bibitem{BoGhFeBa:94}
S.~Boyd, L.~{El~{G}haoui}, E.~Feron, and V.~Balakrishnan.
\newblock {\em Linear matrix inequalities in system and control theory},
  volume~15 of {\em SIAM Studies in Applied Mathematics}.
\newblock Society for Industrial and Applied Mathematics (SIAM), Philadelphia,
  PA, 1994.

\bibitem{BoW:95}
S.~Boyd and S.~WU.
\newblock {\em {SDPSOL:} A Parser/Solver for Semidefinite Programs with Matrix
  Structure. User's Guide, Version Alpha.}
\newblock Stanford University, March 1995.

\bibitem{boya}
S.~Boyd and Q.~YANG.
\newblock Structured and simultaneous {L}yapunov functions for system stability
  problems.
\newblock {\em Int. J. Control}, 49(6):2215--2240, 1989.

\bibitem{BriPotShe:98}
N.~Brixius, F.A. Potra, and R.~Sheng.
\newblock {SDPHA}: a matlab implementation of homogeneous interior-point
  algorithms for semidefinite programming.
\newblock Technical report, University of Iowa, Iowa City, IA, 1998.

\bibitem{BriPotShe:99}
N.~Brixius, F.A. Potra, and R.~Sheng.
\newblock Nonsymmetric search directions for semidefinite programming.
\newblock {\em SIAM J. Optim.}, 9(4):863 -- 876, 1999.

\bibitem{Bron:83}
A.~BRONDSTED.
\newblock {\em An Introduction to Convex Polytopes}.
\newblock Springer Verlag, Berlin, 1983.

\bibitem{BrualRys:91}
R.~A. BRUALDI and H.~J. RYSER.
\newblock {\em Combinatorial Matrix Theory}.
\newblock Cambridge University Press, New York, 1991.

\bibitem{BCR:94}
L.~BRUNETTA, M.~CONFORTI, and G.~RINALDI.
\newblock A branch-and-cut algorithm for the equicut problem.
\newblock {\em Math. Programming}, 78:243--263, 1997.

\bibitem{MontBurer:99}
S.~Burer and R.D.C. Monteiro.
\newblock An efficient algorithm for solving the {MAXCUT SDP} relaxation.
\newblock Technical report, Georgia Tech, Atlanta, GA, 1999.

\bibitem{MontBurer:99b}
S.~Burer and R.D.C. Monteiro.
\newblock A general framework for establishing polynomial convergence of
  long-step methods for semidefinite programming.
\newblock Technical report, Georgia Tech, Atlanta, GA, 1999.
\newblock accepted Optimization Methods and Software.

\bibitem{BurMontZhang:99}
S.~Burer, R.D.C. Monteiro, and Y.~Zhang.
\newblock Solving semidefinite programs via nonlinear programming part i:
  Transformations and derivatives.
\newblock Technical report, Department of Computational and Applied
  Mathematics, Rice University, Houston, Texas, 1999.

\bibitem{burke}
P.J. BURKE.
\newblock The output of a queueing system.
\newblock {\em Oper. Res.}, 4:699--704, 1956.

\bibitem{bushan}
J.A. BUZACOTT and J.G. SHANTHIKUMAR.
\newblock {\em Stochastic Models of Manufacturing Systems}.
\newblock Prentice Hall, Englewood Cliffs, NJ, 1993.

\bibitem{ByrGilNoc:96}
R.H. BYRD, J.C. GILBERT, and R.H. NOCEDAL.
\newblock A trust region method based on interior point techniques for
  nonlinear programming.
\newblock Technical Report Report OTC 96/02, Optimization Technology Center,
  Northwestern University, Evanston Il 60208, 1996.

\bibitem{ByrLiuNoc:92}
R.H. BYRD, D.C. Liu, and R.H. NOCEDAL.
\newblock On the behaviour of {B}royden's class of quasi-{N}ewton methods.
\newblock {\em SIAM J. Optim.}, 2, 1992.

\bibitem{CalDyk:92}
J.A. CALVIN and DYKSTRA.
\newblock A note on maximizing a special concave function subject to
  simultaneous {L}{\"{o}}wner order constraints.
\newblock {\em Linear Algebra Appl.}, 176:37--44, 1992.

\bibitem{Cela:98}
F.~CELA.
\newblock {\em The Quadratic Assignment Problem: Theory and Algorithms}.
\newblock Kluwer, Massachessets, USA, 1998.

\bibitem{CeDeTa:84}
M.R. CELIS, J.E. {Dennis Jr.}, and R.A. Tapia.
\newblock A trust region strategy for nonlinear equality constrained
  optimization.
\newblock In {\em Proceedings of the SIAM Conference on Numerical Optimization,
  Boulder, CO}, 1984.
\newblock Also available as Technical Report TR84-1, Department of Mathematical
  Sciences, Rice University, Houston, TX.

\bibitem{ChGuSa:99}
S.~CHANDRASEKARAN, M.~GU, and A.~H. SAYED.
\newblock The sparse basis problem and multilinear algebra.
\newblock {\em SIAM J. Matrix Anal. Appl.}, 20(2):354--362, 1999.

\bibitem{Chebychev874}
P.~CHEBYCHEV.
\newblock Sur les valeurs limites des int{\'e}grales.
\newblock {\em Jour. Math. Pur. Appl.}, 19(2):157--160, 1874.

\bibitem{Kmtools}
R.~CHIANG and M.G. SAFONOV.
\newblock {\em Robust Control Toolbox}.
\newblock The Mathworks, Inc., 1992.

\bibitem{ChG:95}
M.~CHILALI and P.~GAHINET.
\newblock ${H}_\infty$ design with pole placement constraints: An lmi approach.
\newblock {\em IEEE Trans.\ Aut.\ Control}, 40(3):358--367, March 1995.

\bibitem{ChoiYe:99}
C.C. CHOI and Y.~Ye.
\newblock Application of semidefinite programming to circuit partitioning.
\newblock Technical report, The University of Iowa, Iowa City, Iowa, 1999.

\bibitem{ChRao:93}
S.~CHOPRA and M.R. RAO.
\newblock The partition problem.
\newblock {\em Math. Programming}, 49:87--115, 1993.

\bibitem{ChorS95}
B.~CHOR and M.~SUDAN.
\newblock A geometric approach to betweenness.
\newblock In {\em Proc. of 3rd Europ. Symp. on Algs.}, volume LNCS 979 of {\em
  Lecture Notes in Computer Science}, pages 227--237, 1995.

\bibitem{CTB1:97}
Y.S. CHOU, A.L. TITS, and V.~Balakrishnan.
\newblock Absolute stability theory, theory, and state-space verification of
  frequency-domain conditions: Connections and implications for computation.
\newblock Technical Report TR 97-23, Institute for Systems Research, University
  of Maryland, 1997.
\newblock Accepted for publication in {\it IEEE Trans.\ Aut.\ Control}, 1998.

\bibitem{ChVe:79}
J.P.R. CHRISTENSEN and F.~VESTERSTROM.
\newblock A note on extreme positive definite matrices.
\newblock {\em Math. Ann.}, 244:65--68, 1979.

\bibitem{comi}
E.G. COFFMAN~Jr and I~MITRANI.
\newblock A characterization of waiting time performance realizable by single
  server queues.
\newblock {\em Oper. Res.}, 28:810--821, 1980.

\bibitem{cl}
T.F.\ COLEMAN and Y.Y.\ LI.
\newblock A primal dual trust region algorithm for nonconvex programming using
  a $l_1$ penalty function.
\newblock Report, Dept.\ of Computer Science, Cornell University, 1998.

\bibitem{Com:90}
R.~COMINETTI.
\newblock Metric regularity, tangent sets and second order optimality
  conditions.
\newblock {\em Appl. Math. Optim.}, 21:265--287, 1990.

\bibitem{cgt}
A.R. Conn, N.I.M. Gould, and Ph.L. Toint.
\newblock A primal-dual algorithm for minimizing a nonconvex function subject
  to bounds and nonlinear constraints.
\newblock Report RC 20639, IBM T.J.\ Watson Center, Yorktown Heights, NY, 1996.

\bibitem{CourHilb:53}
R.~COURANT and D.~HILBERT.
\newblock {\em Methods of Mathematical Physics, I}.
\newblock Interscience, New York, NY, 1953.

\bibitem{CR}
J.~COX and S.~ROSS.
\newblock The valuation of options for alternative stochastic processes.
\newblock {\em Journal of Financial Economics}, 3:145--166, 1976.

\bibitem{Cr:84}
B.~CRAVEN.
\newblock Modified {K}uhn-{T}ucker conditions when a minimum is not attained.
\newblock {\em Operations Research Letters}, 3:47--52, 1984.

\bibitem{CrKo:77}
B.~CRAVEN and J.J. KOLIHA.
\newblock Generalizations of {F}arkas' thoerem.
\newblock {\em SIAM J. Matrix Anal. Appl.}, 8:983--997, 1977.

\bibitem{CrMo:73}
B.~CRAVEN and B.~MOND.
\newblock Real and complex {F}ritz {J}ohn theorems.
\newblock {\em J. Math. Anal. Appl.}, 44:773--779, 1973.

\bibitem{CrMo:77}
B.~CRAVEN and B.~MOND.
\newblock Complementarity for arbitrary cones.
\newblock {\em Z. fur Oper. Res.}, 21:143--150, 1977.

\bibitem{CrMo:81}
B.~CRAVEN and B.~MOND.
\newblock Linear programming with matrix variables.
\newblock {\em Linear Algebra Appl.}, 38:73--80, 1981.

\bibitem{cri88}
F.~Critchley.
\newblock On certain linear mappings between inner-product and squared distance
  matrices.
\newblock {\em Linear Algebra Appl.}, 105:91--107, 1988.

\bibitem{CrMaLeSee:95}
J.-P. CROUZEIX, J.-E. MARTINEZ-LEGAZ, and A.~Seeger.
\newblock An alternative theorem for quadratic forms and extensions.
\newblock {\em Linear Algebra Appl.}, 215:121--134, 1995.

\bibitem{CuDoWo:75}
J.~Cullum, W.E. Donath, and P.~Wolfe.
\newblock The minimization of certain nondifferentiable sums of eigenvalues of
  symmetric matrices.
\newblock {\em Mathematical Programming Study}, 3:35--55, 1975.

\bibitem{CCK:99}
D.~CVETKOVI\'{C}, M.~CANGALOVI\'{C}, and V.~KOVA\v{C}EVI\v{C}-VUJ\v{C}I\'{C}.
\newblock Semidefinite programming methods for the symmetric traveling salesman
  problem.
\newblock In {\em Proceedings of the 7th {I}nternational {IPCO} {C}onference,
  Graz, Austria}, pages 126--136, 1999.

\bibitem{Davis:57}
C.~DAVIS.
\newblock All convex invariant functions of {H}ermitian matrices.
\newblock {\em Archiv der Mathematik}, 8:276--278, 1957.

\bibitem{Davis:71}
C.~DAVIS.
\newblock The {T}oeplitz-{H}ausdorff theorem explained.
\newblock {\em Canad. Math. Bull.}, 14:245--246, 1971.

\bibitem{KLERK:97}
E.~de~Klerk.
\newblock {\em Interior point methods for semidefinite programming}.
\newblock PhD thesis, Delft University, 1997.

\bibitem{KlerkPengTerlaky:99}
E.~de~Klerk, J.~Peng, C.~Roos, and T.~Terlaky.
\newblock A scaled {G}auss-{N}ewton primal-dual search direction for
  semidefinite optimization.
\newblock {\em SIAM J. Optim.}, 11(4):870--888 (electronic), 2001.

\bibitem{KlerkRoosTerlakyinit:97}
E.~de~Klerk, C.~Roos, and T.~Terlaky.
\newblock Initialization in semidefinite programming via a self-dual
  skew-symmetric embedding.
\newblock {\em Oper. Res. Lett.}, 20(5):213--221, 1997.

\bibitem{int:deklerk7}
E.~de~Klerk, C.~Roos, and T.~Terlaky.
\newblock Infeasible--start semidefinite programming algorithms via self--dual
  embeddings.
\newblock In {\em Topics in Semidefinite and Interior-Point Methods}, volume~18
  of {\em The Fields Institute for Research in Mathematical Sciences,
  Communications Series}, pages 215--236. American Mathematical Society, 1998.

\bibitem{int:Deklerk5}
E.~de~Klerk, C.~Roos, and T.~Terlaky.
\newblock On primal--dual path--following algorithms in semidefinite
  programming.
\newblock In {\em New trends in Mathematical Programming}, pages 137--157,
  Dordrecht, The Netherlands, 1998. Kluwer Academic Publishers.

\bibitem{KlerkRoosTerlaky:96}
E.~de~Klerk, C.~Roos, and T.~Terlaky.
\newblock Polynomial primal-dual affine scaling algorithms in semidefinite
  programming.
\newblock {\em J. Comb. Optim.}, 2(1):51--70, 1998.

\bibitem{KlerkRoosTerlaky:97}
E.~de~Klerk, C.~Roos, and T.~Terlaky.
\newblock Primal--dual potential reduction methods for semidefinite programming
  using affine--scaling directions.
\newblock {\em Appl. Numer. Math.}, 29:335--360, 1999.

\bibitem{Pill:67}
J.~de~PILLIS.
\newblock Linear transformations which preserve {H}ermitian and positive
  semidefinite operators.
\newblock {\em Pacific J. of Math.}, 23:129--137, 1967.

\bibitem{delCorso97}
G.~M. {del CORSO}.
\newblock Estimating an eigenvector by the power method with a random star t.
\newblock {\em SIAM J. Matrix Anal. Appl.}, 18(4):913--937, October 1997.

\bibitem{dp1:90}
C.~DELORME and S.~POLJAK.
\newblock Laplacian eigenvalues and the maximum cut problem.
\newblock {\em Math. Programming}, 62(3):557--574, 1993.

\bibitem{dembo83}
R.S. DEMBO and T.~STEIHAUG.
\newblock Truncated {Newton} algorithms for large scale unconstrained
  optimization.
\newblock {\em Math. Programming}, 26(72):190--212, 1983.

\bibitem{MR95d:90001}
D.~den HERTOG.
\newblock {\em Interior point approach to linear, quadratic and convex
  programming}, volume 277 of {\em Mathematics and its Applications}.
\newblock Kluwer Academic Publishers Group, Dordrecht, 1994.
\newblock Algorithms and complexity.

\bibitem{DH96}
S.~Deng and H.~Hu.
\newblock Computable error bounds for semidefinite programming.
\newblock Technical report, Department of Mathematical Sciences, Northern
  Illinois University, DeKalb, Illinois, USA, 1996.

\bibitem{DeWo:90}
J.E. {Dennis Jr.} and H.~Wolkowicz.
\newblock Sizing and least-change secant methods.
\newblock {\em SIAM J. Numer. Anal.}, 30(5):1291--1314, 1993.

\bibitem{derman}
E.~DERMAN and I.~KANI.
\newblock Riding on the smile.
\newblock {\em RISK}, 7:32--39, 1994.

\bibitem{DeV:75}
C.A. DESOER and M.~VIDYASAGAR.
\newblock {\em Feedback Systems: {I}nput-Output Properties}.
\newblock Academic Press, New York, 1975.

\bibitem{MR98g:52001}
M.M. Deza and M.~Laurent.
\newblock {\em Geometry of cuts and metrics}.
\newblock Springer-Verlag, Berlin, 1997.

\bibitem{Dia87}
P.~DIACONIS.
\newblock Application of the method of moments in probability and statistics.
\newblock In {\em Proc. Sympos. Appl. Math.}, volume~37, pages 125--139. Amer.
  Math. Soc., 1987.

\bibitem{Dines:41}
L.L. DINES.
\newblock On the mapping of quadratic forms.
\newblock {\em Bull. of AMS}, 47:494--498, 1941.

\bibitem{DHM:84}
L.C.W. DIXON, S.E. HERSOM, and Z.A. MAANY.
\newblock Initial experience obtained solving the low thrust satellite
  trajectory optimisation problem.
\newblock Technical Report T.R. 152, The Hatfield Polytechnic Numerical
  Optimization Centre, 1984.

\bibitem{DoTe:98}
M.~DOLJANSKY and M.~TEBOULLE.
\newblock An interior proximal algorithm and the exponential multiplier method
  for semidefinite programming.
\newblock {\em SIAM J. Optim.}, 9(1):1--13, 1998.

\bibitem{dh72}
W.E.\ Donath and A.J.\ Hoffman.
\newblock Algorithms for partitioning graphs and computer logic based on
  eigenvectors of connection matrices.
\newblock {\em IBM Technical Disclosure Bulletin}, 15(3):938--944, 1972.

\bibitem{DoHo:73}
W.E. Donath and A.J. Hoffman.
\newblock Lower bounds for the partitioning of graphs.
\newblock {\em IBM J. Res. Develop.}, 17:420--425, 1973.

\bibitem{Doy:82}
J.~DOYLE.
\newblock Analysis of feedback systems with structured uncertainties.
\newblock {\em IEE Proc.}, 129-D(6):242--250, November 1982.

\bibitem{DuP:97}
D.-Z. DU and P.M. PARDALOS.
\newblock Global minimax approaches for solving discrete problems.
\newblock In P.~Gritzmann, R.~Horst, E.~Sachs, and R.~Tichatschke, editors,
  {\em Recent Advances in Optimization}, pages 34--48. Springer-Verlag, 1997.

\bibitem{Dub:62}
L.E. DUBINS.
\newblock On extreme points of convex sets.
\newblock {\em J. Math. Anal. Appl.}, 5:237--244, 1962.

\bibitem{dupire}
B.~DUPIRE.
\newblock Pricing with a smile.
\newblock {\em RISK}, 7:18--20, 1994.

\bibitem{DymGoh:81}
H.~DYM and I.~Gohberg.
\newblock Extensions of band matrices with band inverses.
\newblock {\em Linear Algebra Appl.}, 36:1--24, 1981.

\bibitem{EdArSm:98}
A.~EDELMAN, T.~ARIAS, and S.T. SMITH.
\newblock The geometry of algorithms with orthogonality constraints.
\newblock {\em SIAM J. Matrix Anal. Appl.}, 20(2):303--353 (electronic), 1999.

\bibitem{MR97g:65077}
A.~EDELMAN and S.T. SMITH.
\newblock On conjugate gradient-like methods for eigen-like problems.
\newblock {\em BIT}, 36(3):494--508, 1996.
\newblock International Linear Algebra Year (Toulouse, 1995).

\bibitem{ElB:94}
L.~{EL~GHAOUI} and V.~BALAKRISHNAN.
\newblock {S}ynthesis of fixed-structure controllers via numerical
  optimization.
\newblock In {\em Proc.\ IEEE Conf.\ on Decision and Control}, pages
  2678--2683, December 1994.

\bibitem{EBFB:92}
L.~{El~Ghaoui}, V.~Balakrishnan, E.~Feron, and S.~Boyd.
\newblock On maximizing a robustness measure for structured nonlinear
  perturbations.
\newblock In {\em Proc.\ American Control Conf.}, volume~4, pages 2923--2924,
  Chicago, June 1992.

\bibitem{robust:ElC:99a}
L.~{EL GHAOUI} and G.~CALAFIORE.
\newblock Confidence ellipsoids for uncertain linear equations with structure.
\newblock In {\em Proc.\ IEEE Conf.\ on Decision and Control}, 1999.

\bibitem{robust:ElC:99}
L.~{EL GHAOUI} and G.~CALAFIORE.
\newblock Deterministic state prediction under structured uncertainty.
\newblock In {\em Proc.\ American Control Conf.}, 1999.

\bibitem{robust:ElC:99c}
L.~{EL GHAOUI} and G.~CALAFIORE.
\newblock Worst-case simulation of uncertain systems.
\newblock In A.~Tesi A.~Garulli and A.~Vicino, editors, {\em Robustness in
  Identification and Control}, Lecture Notes in Control and Information
  Sciences. Springer, 1999.
\newblock To appear.

\bibitem{ElL:97}
L.~EL~GHAOUI and H.~LEBRET.
\newblock Robust solutions to least-squares problems with uncertain data.
\newblock {\em SIAM J. Matrix Anal. Appl.}, 18(4):1035--1064, 1997.

\bibitem{MR1447473}
L.~EL~GHAOUI and H.~LEBRET.
\newblock Robust solutions to least squares problems with uncertain data.
\newblock In {\em Recent advances in total least squares techniques and
  errors-in-variables modeling (Leuven, 1996)}, pages 161--170. SIAM,
  Philadelphia, PA, 1997.

\bibitem{OGL}
L.~{EL GHAOUI}, F.~OUSTRY, and H.~Lebret.
\newblock Robust solutions to uncertain semidefinite programs.
\newblock {\em SIAM J. of Optim.}, 9(1):33--52, 1999.

\bibitem{FaReWo:92}
J.~Falkner, F.~Rendl, and H.~Wolkowicz.
\newblock A computational study of graph partitioning.
\newblock {\em Math. Programming}, 66(2, Ser. A):211--239, 1994.

\bibitem{FTD:91}
M.K.~H. FAN, A.L. TITS, and J.C. DOYLE.
\newblock Robustness in the presence of mixed parametric uncertainty and
  unmodeled dynamics.
\newblock {\em IEEE Trans.\ Aut.\ Control}, AC-36(1):25--38, January 1991.

\bibitem{FanGong:97}
M.K.H. FAN and Y.~GONG.
\newblock Eigenvalue multiplicity estimate in semidefinite programming.
\newblock {\em J. Optim. Theory Appl.}, 94(1):55--72, 1997.

\bibitem{FarautKoranyi:94}
J.~FARAUT and A.~KORANYI.
\newblock {\em Analysis on Symmetric Cones}.
\newblock Oxford University Press, NY, USA, 1994.

\bibitem{Fayb:95a}
L.~Faybusovich.
\newblock {J}ordan algebras, symmetric cones and interior-point methods.
\newblock Technical report, Dept. of Mathematics, University of Notre Dame,
  Notre Dame, IN 46556-5683, 1995.

\bibitem{MR96b:90059}
L.~Faybusovich.
\newblock On a matrix generalization of affine-scaling vector fields.
\newblock {\em SIAM J. Matrix Anal. Appl.}, 16(3):886--897, 1995.

\bibitem{Fayb:96}
L.~Faybusovich.
\newblock Infinite-dimensional semidefinite programming: regularized
  determinants and self-concordant barriers.
\newblock Technical report, Dept. of Mathematics, University of Notre Dame,
  Notre Dame, IN 46556-5683, 1996.

\bibitem{Fayb:95}
L.~Faybusovich.
\newblock Semi-definite programming: a path-following algorithm for a
  linear-quadratic functional.
\newblock {\em SIAM J. Optim.}, 6(4):1007--1024, 1996.

\bibitem{fay-97b}
L.~Faybusovich.
\newblock Euclidean {J}ordan algebras and interior-point algorithms.
\newblock {\em Positivity}, 1(4):331--357, 1997.

\bibitem{fay-97a}
L.~Faybusovich.
\newblock Linear systems in {J}ordan algebras and primal-dual interior-point
  algorithms.
\newblock {\em J. Comput. Appl. Math.}, 86(1):149--175, 1997.
\newblock Special issue dedicated to William B. Gragg (Monterey, CA, 1996).

\bibitem{fay-98}
L.~Faybusovich.
\newblock A {J}ordan-algebraic approach to potential-reduction algorithms.
\newblock Technical report, Dept. of Mathematics, University of Notre Dame,
  Notre Dame, IN 46556-5683, April 1998.

\bibitem{MR97m:90095}
L.~Faybusovich and J.B. MOORE.
\newblock Infinite-dimensional quadratic optimization: interior-point methods
  and control applications.
\newblock {\em Appl. Math. Optim.}, 36(1):43--66, 1997.

\bibitem{Fei:95}
U.~FEIGE.
\newblock Randomized graph products, chromatic numbers, and the {L}ov\'asz
  $\vartheta$-function.
\newblock {\em Combinatorica}, 17(1):79--90, 1997.

\bibitem{FieGoe95}
U.~FEIGE and M.X. Goemans.
\newblock Approximating the value of two proper proof systems, with
  applications to {MAX-2SAT} and {MAX-DICUT}.
\newblock In {\em Proceeding of the Third Israel Symposium on Theory of
  Computing and Systems}, pages 182--189, 1995.

\bibitem{Feron:99}
E.~FERON.
\newblock Nonconvex quadratic programming, semidefinite relaxations and
  randomization algorithms in information and decision systems.
\newblock Technical report, Dept. of Aeronautics and Astronautics, MIT,
  Cambridge, MA 02139, 1999.

\bibitem{FiaMc:68}
A.V. Fiacco and G.P. McCORMICK.
\newblock {\em Nonlinear Programming: Sequential Unconstrained Minimization
  Techniques}.
\newblock John Wiley \& Sons, New York, NY, 1968.

\bibitem{FiaccoMcCormick:90}
A.V. FIACCO and G.P. McCORMICK.
\newblock {\em Nonlinear programming sequential unconstrained minimization
  techniques}.
\newblock Classics in Applied Mathematics. SIAM, Philadelphia, PA, USA, 1990.

\bibitem{Fie:72}
M.~Fiedler.
\newblock Bounds for eigenvalues of doubly stochastic matrices.
\newblock {\em Linear Algebra Appl.}, 5:299--310, 1972.

\bibitem{Fie:73}
M.~Fiedler.
\newblock Algebraic connectivity of graphs.
\newblock {\em Czechoslovak Math. J.}, 23:298--305, 1973.

\bibitem{FillWill:71}
P.A. FILLMORE and J.P. WILLIAMS.
\newblock Some convexity theorems for matrices.
\newblock {\em Glasgow Math. J.}, 10:110--117, 1971.

\bibitem{finch}
P.D. FINCH.
\newblock On the distribution of queue size in queueing problems.
\newblock {\em Acta Math. Hungar.}, 10:327--336, 1959.

\bibitem{FinBurRen87}
G.~FINKE, R.E. BURKARD, and F.~RENDL.
\newblock Quadratic assignment problems.
\newblock {\em Ann. Discrete Math.}, 31:61--82, 1987.

\bibitem{MR96h:90117}
A.~FISCHER.
\newblock A {N}ewton-type method for positive-semidefinite linear
  complementarity problems.
\newblock {\em J. Optim. Theory Appl.}, 86(3):585--608, 1995.

\bibitem{MR96c:15032}
C.H. FITZGERALD, C.A. MICCHELLI, and A.~PINKUS.
\newblock Functions that preserve families of positive semidefinite matrices.
\newblock {\em Linear Algebra Appl.}, 221:83--102, 1995.

\bibitem{FlSe}
S.D. FLAM and A.~Seeger.
\newblock Solving cone-constrained convex programs by differential inclusions.
\newblock {\em Math. Programming}, 64(1):107--121, 1994.

\bibitem{Fl:75}
H.~FLANDERS.
\newblock An extremal problem in the space of positive definite matrices.
\newblock {\em Linear and Multilinear Algebra}, 3:33--39, 1975.

\bibitem{Flet:81c}
R.~Fletcher.
\newblock A nonlinear programming problem in statistics (educational testing).
\newblock {\em SIAM J. Sci. Stat. Comput.}, 2:257--267, 1981.

\bibitem{Flet:85}
R.~Fletcher.
\newblock Semi-definite matrix constraints in optimization.
\newblock {\em SIAM J. Control Optim.}, 23:493--513, 1985.

\bibitem{Flet:91}
R.~Fletcher.
\newblock A new variational result for quasi-{N}ewton formulae.
\newblock {\em SIAM J. Optim.}, 1:18--21, 1991.

\bibitem{Flet:93}
R.~FLETCHER.
\newblock An optimal positive definite update for sparse {H}essian matrices.
\newblock {\em SIAM J. Optim.}, 5:192--218, 1995.

\bibitem{MR97e:90052}
C.A. FLOUDAS and V.~VISWESWARAN.
\newblock Quadratic optimization.
\newblock In {\em Handbook of global optimization}, pages 217--269. Kluwer
  Acad. Publ., Dordrecht, 1995.

\bibitem{for:88}
F.~FORG{\'{O}}.
\newblock {\em Nonconvex Programming}.
\newblock Akad{\'{e}}miai Kiad{\'{o}}, Budapest, 1988.

\bibitem{Fors:95}
A.~FORSGREN.
\newblock On linear least-squares problems with diagonally dominant weight
  matrices.
\newblock {\em SIAM J. Matrix Anal. Appl.}, 17:763--788, 1995.

\bibitem{Fors:98}
A.~FORSGREN.
\newblock Optimality conditions for nonconvex semidefinite programming.
\newblock {\em Math. Program.}, 88(1, Ser. A):105--128, 2000.

\bibitem{freund87}
R.M. Freund.
\newblock Dual gauge programs, with applications to quadratic programming and
  the minimum-norm problem.
\newblock {\em Math. Programming}, 38:47--67, 1987.

\bibitem{Fr:94}
R.M. Freund.
\newblock Complexity of an algorithm for finding an approximate solution of a
  semi-definite program with no regularity assumption.
\newblock Technical Report OR 302-94, MIT, Cambridge, MA, 1994.

\bibitem{int:Freund100}
R.M. FREUND and S.~MIZUNO.
\newblock Interior point methods: current status and future directions.
\newblock {\em OPTIMA}, 51, 1996.

\bibitem{FrVe:97}
R.M. Freund and J.R. Vera.
\newblock Some characterizations and properties of the ``distance to
  ill-posedness'' and the condition measure of a conic linear system.
\newblock Technical report, MIT, Cambridge, MA, 1997.

\bibitem{Fr:81}
S.~FRIEDLAND.
\newblock Convex spectral functions.
\newblock {\em Linear and Multilinear Algebra}, 9:293--316, 1981.

\bibitem{FNO:87}
S.~FRIEDLAND, J.~NOCEDAL, and M.L. Overton.
\newblock The formulation and analysis of numerical methods for inverse
  eigenvalue problems.
\newblock {\em SIAM J. Numer. Anal.}, 24(3):634--667, 1987.

\bibitem{Frieze}
A.~FRIEZE and M.~JERRUM.
\newblock Improved approximation algorithms for {M}{A}{X} $k$-{C}{U}{T} and
  {M}{A}{X} {B}{I}{S}{E}{C}{T}{I}{O}{N}.
\newblock In {\em Integer programming and combinatorial optimization
  (Copenhagen, 1995)}, volume 920 of {\em Lecture Notes in Comput. Sci.}, pages
  1--13. Springer, Berlin, 1995.

\bibitem{FriJer:94}
A.~FRIEZE and M.~JERRUM.
\newblock Improved approximation algorithms for {MAX} k-{CUT} and {MAX}
  {BISECTION}.
\newblock {\em Algorithmica}, 18:67--81, 1997.

\bibitem{Frisch:55}
K.R. FRISCH.
\newblock The logarithmic potential method of convex programming.
\newblock Technical report, Institute of Economics, Oslo University, Oslo,
  Norway, 1955.

\bibitem{FuLuoYe:98}
M.~FU, Z.~Luo, and Y.~Ye.
\newblock Approximation algorithms for quadratic programming.
\newblock {\em J. Comb. Optim.}, 2(1):29--50, 1998.

\bibitem{fuco}
S.W. FUHRMANN and R.B. COOPER.
\newblock Stochastic decompositions in the $m/g/1$ queue with generalized
  vacations.
\newblock {\em Oper. Res.}, 33:1117--1129, 1985.

\bibitem{FuKo:95}
T.~FUJIE and M.~Kojima.
\newblock Semidefinite programming relaxation for nonconvex quadratic programs.
\newblock {\em J. Global Optim.}, 10(4):367--380, 1997.

\bibitem{FuKoNa:95}
K.~Fujisawa, M.~Kojima, and K.~Nakata.
\newblock {SDPA} semidefinite programming algorithm.
\newblock Technical report, Dept. of Information Sciences, Tokyo Institute of
  Technology, Tokyo, Japan, 1995.

\bibitem{FuFuKoNa:97a}
K.~Fujisawa, M.~Kojima, and K.~Nakata.
\newblock Exploiting sparsity in primal-dual interior-point methods for
  semidefinite programming.
\newblock {\em Math. Programming}, 79:235--253, 1997.

\bibitem{sdpa}
K.~Fujisawa, M.~Kojima, and K.~Nakata.
\newblock {SDPA} (semidefinite programming algorithm user's manual, version
  4.10.
\newblock Research Report on Mathematical and Computing Sciences, Tokyo
  Institute of Technology, Tokyo, Japan, 1998.

\bibitem{FuFuKoNa:97}
K.~Fujisawa, M.~Kojima, and K.~Nakata.
\newblock Numerical evaluation of {SDPA} (semidefinite programming algorithm).
\newblock In {\em Proceedings of the Second Workshop on High Performance
  Optimization Techniques, Rotterdam}, To appear.

\bibitem{GaA:94}
P.~GAHINET and P.~APKARIAN.
\newblock A linear matrix inequality approach to ${H}^\infty$ control.
\newblock {\em Int.\ J.\ Robust and Nonlinear Control}, 4:421--448, 1994.

\bibitem{GAC:96}
P.~GAHINET, P.~APKARIAN, and M.~CHILALI.
\newblock Affine parameter-dependent {L}yapunov functions for real parameter
  uncertainty.
\newblock {\em IEEE Trans.\ Aut.\ Control}, 41(3):436--442, March 1996.

\bibitem{MR1461380}
P.~GAHINET and A.S. Nemirovski.
\newblock The projective method for solving linear matrix inequalities.
\newblock {\em Math. Programming}, 77(2, Ser. B):163--190, 1997.

\bibitem{Gal92}
G.~GALLEGO.
\newblock A minmax distribution free procedure for the (q,r) inventory model.
\newblock {\em Oper. Res. Letters}, 11:55--60, 1992.

\bibitem{gow}
D.M. Gay, M.L. Overton, and M.H. Wright.
\newblock A primal-dual interior method for nonconvex nonlinear programming.
\newblock Technical Report 97-4-08, Bell Laboratories, Murray Hill, NJ, 1997.

\bibitem{MR1670543}
J.~F. GEELEN.
\newblock Maximum rank matrix completion.
\newblock {\em Linear Algebra Appl.}, 288(1-3):211--217, 1999.

\bibitem{gemi}
E.~GELENBE and I.~MITRANI.
\newblock {\em Analysis and Synthesis of Computer Systems}.
\newblock Academic Press, London, 1980.

\bibitem{ElS:96}
L.~EL GHAOUI and G.~SCORLETTI.
\newblock Control of rational systems using {L}inear-{F}ractional
  {R}epresentations and {L}inear {M}atrix {I}nequalities.
\newblock {\em Automatica}, 32(9), September 1996.

\bibitem{Gibbons}
L.E. GIBBONS, D.W. HEARN, and P.M. Pardalos.
\newblock A continuous based heuristic for the maximum clique problem.
\newblock Technical report, DIMACS Series in Discrete Mathematics and
  Theoretical Computer Science, 1996.

\bibitem{GiMuWr:81}
P.E. GILL, W.~MURRAY, and M.H. Wright.
\newblock {\em Practical Optimization}.
\newblock Academic Press, New York, London, Toronto, Sydney and San Francisco,
  1981.

\bibitem{MR1670594}
W.~Glunt, T.L. Hayden, C.R. Johnson, and P.~Tarazaga.
\newblock Positive definite completions and determinant maximization.
\newblock {\em Linear Algebra Appl.}, 288(1-3):1--10, 1999.

\bibitem{MR95g:05048b}
C.~GODSIL.
\newblock Comment on {D}. {E}. {K}nuth: ``{T}he sandwich theorem''
  [{E}lectron.\ {J}.\ {C}ombin.\ {\bf 1} (1994), {A}rticle 1, approx.\ 48 pp.\
  (electronic); {M}{R} 95g:05048a].
\newblock {\em Electron. J. Combin.}, 1:Article 1, Comment 1, approx.\ 1 p.
  (electronic), 1994.

\bibitem{God55}
H.J. GODWIN.
\newblock On generalizations of {T}chebycheff's inequality.
\newblock {\em Am. Stat. Assoc. J.}, 50:923--945, 1955.

\bibitem{God64}
H.J. GODWIN.
\newblock -.
\newblock In ed. M.G.~Kendall, editor, {\em Inequalities on Distribution
  Functions}, number~16 in Griffin's Statistical Monographs \& Courses. Charles
  Griffin and Co., London, 1964.

\bibitem{Goem:97}
M.X. Goemans.
\newblock Semidefinite programming in combinatorial optimization.
\newblock {\em Math. Programming}, 79:143--162, 1997.

\bibitem{Goemans98}
M.X. Goemans.
\newblock Semidefinite programming and combinatorial optimization.
\newblock {\em Documenta Mathematica}, Extra Volume ICM 1998:657--666, 1998.
\newblock Invited talk at the International Congress of Mathematicians, Berlin,
  1998.

\bibitem{GoRe:99}
M.X. Goemans and F.~Rendl.
\newblock Semidefinite programs and association schemes.
\newblock {\em Computing}, 1999.
\newblock To appear.

\bibitem{GoWi:93}
M.X. Goemans and D.P. Williamson.
\newblock .878-approximation algorithms for {MAX} {CUT} and {MAX} 2{SAT}.
\newblock In {\em ACM Symposium on Theory of Computing (STOC)}, 1994.

\bibitem{Goemans}
M.X. Goemans and D.P. Williamson.
\newblock Improved approximation algorithms for maximum cut and satisfiability
  problems using semidefinite programming.
\newblock {\em J. Assoc. Comput. Mach.}, 42(6):1115--1145, 1995.

\bibitem{GL-91}
D.~Goldfarb and S.~Liu.
\newblock An {O}$(n^{3}{L})$ primal interior point algorithm for convex
  quadratic programming.
\newblock {\em Math. Programming}, 53, 1991.

\bibitem{int:Goldfarb15}
D.~Goldfarb and K.~Scheinberg.
\newblock Interior point trajectories in semidefinite programming.
\newblock {\em SIAM J. Optim.}, 8(4):871--886, 1998.

\bibitem{GoSch:96}
D.~Goldfarb and K.~Scheinberg.
\newblock On parametric semidefinite programming.
\newblock volume~29, pages 361--377, 1999.
\newblock Proceedings of the {S}tieltjes {W}orkshop on {H}igh {P}erformance
  {O}ptimization {T}echniques ({HPOPT} '96) ({D}elft).

\bibitem{MR19:446g}
A.J. Goldman and A.W. Tucker.
\newblock Polyhedral convex cones.
\newblock In {\em Linear equalities and related systems}, pages 19--40.
  Princeton University Press, Princeton, N. J., 1956.
\newblock Annals of Mathematics Studies, no. 38.

\bibitem{MR21:633}
A.J. Goldman and A.W. Tucker.
\newblock Theory of linear programming.
\newblock In {\em Linear inequalities and related systems}, pages 53--97.
  Princeton University Press, Princeton, N.J., 1956.
\newblock Annals of Mathematics Studies, no. 38.

\bibitem{Gol:72}
E.G. GOL'SHTEIN.
\newblock {\em Theory of Convex Programming}, volume~36 of {\em Translations of
  Mathematical Monographs}.
\newblock American Mathematical Society, Providence, RI, 1972.

\bibitem{GoVan:79}
G.H. Golub and C.F. {Van Loan}.
\newblock {\em Matrix Computations}.
\newblock Johns Hopkins University Press, Baltimore, Maryland, $3^{nd}$
  edition, 1996.

\bibitem{GonzagaTodd:92}
C.C. GONZAGA and M.J. Todd.
\newblock An {O}$(\sqrt{n}{L})$-iteration large-step primal-dual affine
  algorithm for linear programming.
\newblock {\em SIAM J. Optim.}, 2:349--359, 1992.

\bibitem{GoLuRoTo}
N.I.M. Gould, S.~Lucidi, M.~Roma, and Ph.L. Toint.
\newblock Solving the trust-region subproblem using the {L}anczos method.
\newblock {\em SIAM J. Optim.}, 9(2):504--525, 1999.

\bibitem{gow85}
J.~C. Gower.
\newblock Properties of {E}uclidean and non-{E}uclidean distance matrices.
\newblock {\em Linear Algebra Appl.}, 67:81--97, 1985.

\bibitem{GrL:95}
M.~GREEN and D.~J.~N. LIMEBEER.
\newblock {\em Linear Robust Control}.
\newblock Information and System sciences. Prentice Hall, Englewood Cliffs, NJ,
  1995.

\bibitem{MR97k:15048}
P.~GRITZMANN, V.~KLEE, and B.-S. TAM.
\newblock Cross-positive matrices revisited.
\newblock {\em Linear Algebra Appl.}, 223/224:285--305, 1995.
\newblock Special issue honoring Miroslav Fiedler and Vlastimil Pt\'ak.

\bibitem{GLS81}
M.~Groetschel, L.~Lov\'{a}sz, and A.~Schrijver.
\newblock The ellipsoid method and its consequences in combinatorial
  optimization.
\newblock {\em Combinatorica}, 1:169--197, 1981.

\bibitem{gjmw2}
B.~Grone, C.R. Johnson, E.~Marques~de Sa, and H.~Wolkowicz.
\newblock Improving {H}adamard's inequality.
\newblock {\em Linear and Multilinear Algebra}, 16(1-4):305--322, 1984.

\bibitem{GrJoSaWo:84}
B.~Grone, C.R. Johnson, E.~Marques~de Sa, and H.~Wolkowicz.
\newblock Positive definite completions of partial {H}ermitian matrices.
\newblock {\em Linear Algebra Appl.}, 58:109--124, 1984.

\bibitem{gjmw3}
B.~Grone, C.R. Johnson, E.~Marques~de Sa, and H.~Wolkowicz.
\newblock A note on maximizing the permanent of a positive definite {H}ermitian
  matrix, given the eigenvalues.
\newblock {\em Linear and Multilinear Algebra}, 19(4):389--393, 1986.

\bibitem{GrPiWa:90}
R.~GRONE, S.~PIERCE, and W.~WATKINS.
\newblock Extremal correlation matrices.
\newblock {\em Linear Algebra Appl.}, 134:63--70, 1990.

\bibitem{GrotschelLS86}
M.~GR\"{O}TSCHEL, L.~Lov\'asz, and A.~SCHRIJVER.
\newblock Relaxations of vertex packing.
\newblock {\em J. Comb. Optim.}, pages 330--343, 1986.

\bibitem{GLS88}
M.~Gr{\"{o}}tschel, L.~Lov\'{a}sz, and A.~Schrijver.
\newblock {\em Geometric Algorithms and Combinatorial Optimization}.
\newblock Springer Verlag, Berlin-Heidelberg, 1988.

\bibitem{GrPu:81}
M.~GR{\"{O}}TSCHEL and W.~R. PULLEYBLANK.
\newblock Weakly bipartite graphs and the max cut problem.
\newblock {\em Oper. Res. Lett.}, 1:23--27, 1981.

\bibitem{GrKrReWo:98}
G.~Gruber, S.~Kruk, F.~Rendl, and H.~Wolkowicz.
\newblock Presolving for semidefinite programs without constraint
  qualifications.
\newblock Technical Report CORR 98-32, University of Waterloo, Waterloo,
  Ontario, 1998.

\bibitem{Gru}
B.~GRUNDY.
\newblock Option prices and the underlying asset's return distribution.
\newblock {\em J. Finance}, 46(3):1045--1070, July 1991.

\bibitem{Gu:97}
M.~GU.
\newblock On primal-dual interior point methods for semidefinite programming.
\newblock Technical Report CAM 97-12, Department of Mathematics, University of
  California, Los Angeles, CA 90095-1555, 1997.

\bibitem{Guig:69}
M.~Guignard.
\newblock Generalized {K}uhn-{T}ucker conditions for mathematical programming
  problems in a {B}anach space.
\newblock {\em SIAM J. of Control}, 7(2):232--241, 1969.

\bibitem{Guler:96}
O.~G{\" U}LER.
\newblock Barrier functions in interior point methods.
\newblock {\em Math. Oper. Res.}, 21:860--885, 1996.

\bibitem{Guler:97}
O.~G{\" U}LER.
\newblock Hyperbolic polynomials and interior point methods for convex
  programming.
\newblock {\em Math. Oper. Res.}, 22:350--377, 1997.

\bibitem{Guler:98}
O.~G{\" U}LER.
\newblock Private communication.
\newblock Technical report, University of Maryland Baltimore County, Baltimore,
  MD, January 1998.
\newblock Unpublished.

\bibitem{GulerTuncel:97}
O.~G{\" U}LER and L.~TUN{\c{C}}EL.
\newblock Manuscript.
\newblock Technical report, University of Maryland Baltimore County, Baltimore,
  MD, 1997.
\newblock Unpublished.

\bibitem{GulerTuncel:98}
O.~G{\" U}LER and L.~TUN{\c{C}}EL.
\newblock Characterization of the barrier parameter of homogeneous convex
  cones.
\newblock {\em Math. Programming}, 81(1, Ser. A):55--76, 1998.

\bibitem{GulerYe}
O.~G{\" U}LER and Y.~Ye.
\newblock Convergence behavior of some interior point algorithms.
\newblock {\em Math. Programming}, 60:215--228, 1993.

\bibitem{MR99f:90073}
S.M. GUU and Y.C. LIOU.
\newblock On a quadratic optimization problem with equality constraints.
\newblock {\em J. Optim. Theory Appl.}, 98(3):733--741, 1998.

\bibitem{HaReWo:89}
S.W. Hadley, F.~Rendl, and H.~Wolkowicz.
\newblock A new lower bound via projection for the quadratic assignment
  problem.
\newblock {\em Math. Oper. Res.}, 17(3):727--739, 1992.

\bibitem{Ha:75}
F.~HADLOCK.
\newblock Finding a maximum cut of a planar graph in polynomial time.
\newblock {\em SIAM J. Comput.}, 4(3):221--225, 1975.

\bibitem{ho}
{J.-P.A.} Haeberly and M.L. Overton.
\newblock Optimizing eigenvalues of symmetric definite pencils.
\newblock In {\em Proceedings of American Control Conference}, Baltimore, July
  1994.

\bibitem{Hae:79}
W.~HAEMERS.
\newblock On some problems of {L}ov\'{a}sz concerning the {S}hannon capacity of
  graphs.
\newblock {\em IEEE Transactions on Information Theory}, 25:231--232, 1979.

\bibitem{MR83a:90129}
P.~L. HAMMER and P.~HANSEN.
\newblock Logical relations in quadratic $0-1$\ programming.
\newblock {\em Rev. Roumaine Math. Pures Appl.}, 26(3):421--429, 1981.

\bibitem{MR91b:90134}
P.~L. HAMMER and B.~SIMEONE.
\newblock Quadratic functions of binary variables.
\newblock In {\em Combinatorial Optimization (Como, 1986)}, pages 1--56.
  Springer, Berlin, 1989.

\bibitem{HaHaSi:84}
P.L. HAMMER, P.~HANSEN, and B.~SIMEONE.
\newblock Roof duality, complementation and persistency in quadratic 0-1
  optimization.
\newblock {\em Math. Programming}, 28:121--155, 1984.

\bibitem{HaRu:70}
P.L. HAMMER and A.A. RUBIN.
\newblock Some remarks on quadratic programming with 0-1 variables.
\newblock {\em R.I.R.O.}, 3:67--79, 1970.

\bibitem{MR85e:15023}
S.-P. HAN and O.~L. MANGASARIAN.
\newblock Conjugate cone characterization of positive definite and semidefinite
  matrices.
\newblock {\em Linear Algebra Appl.}, 56:89--103, 1984.

\bibitem{Han:92}
E.~R. HANSEN.
\newblock {\em Global optimization using interval analysis}.
\newblock Marcel Dekker, New-York, 1992.

\bibitem{HK}
M.~HARRISON and D.~KREPS.
\newblock Martingales and arbitrage in multiperiod securities markets.
\newblock {\em Journal of Economic Theory}, 20:381--408, 1979.

\bibitem{Hastad97}
J.~{HASTAD}.
\newblock Some optimal inapproximability results.
\newblock In {\em Proc. of the 29th {ACM} Symp. on Theory Comput.}, 1997.

\bibitem{Hauser:99}
R.~HAUSER.
\newblock Self-scaled barrier functions: Decomposition and classification.
\newblock Technical Report DAMTP 1999/NA13, Department of Applied Mathematics
  and Theoretical Physics, University of Cambridge, Cambridge, England, 1998.

\bibitem{hwlt91}
T.L. Hayden, J.~Wells, W-M. Liu, and P.~Tarazaga.
\newblock The cone of distance matrices.
\newblock {\em Linear Algebra Appl.}, 144:153--169, 1991.

\bibitem{Hei:94}
M.~HEINKENSCHLOSS.
\newblock On the solution of a two ball trust region subproblem.
\newblock {\em Math. Programming}, 64(3):249--276, 1994.

\bibitem{Helmberg:94}
C.~Helmberg.
\newblock {\em An interior-point method for semidefinite programming and
  max-cut bounds}.
\newblock PhD thesis, Austria, 1994.

\bibitem{Helmberg:97}
C.~Helmberg.
\newblock Fixing variables in semidefinite relaxations.
\newblock {\em Lecture Notes in Computer Science}, 1284:259--263, 1997.

\bibitem{HelmbergKiwiel99}
C.~Helmberg and K.C. KIWIEL.
\newblock A spectral bundle method with bounds.
\newblock {ZIB} preprint sc-99-37, Konrad-Zuse-Zentrum f\"ur
  Informationstechnik Berlin, Takustra{\ss}e 7, 14195 Berlin, Germany, November
  1999.

\bibitem{HelmbergKiwielRendl98}
C.~Helmberg, K.C. KIWIEL, and F.~Rendl.
\newblock Incorporating inequality constraints in the spectral bundle method.
\newblock In R.~E. Bixby, E.~A. Boyd, and R.~Z. R\'{\i}os-Mercado, editors,
  {\em Integer Programming and Combinatorial Optimization}, volume 1412 of {\em
  Lecture Notes in Computer Science}, pages 423--435. Springer, 1998.

\bibitem{HePoReWo:95}
C.~Helmberg, S.~Poljak, F.~Rendl, and H.~Wolkowicz.
\newblock Combining semidefinite and polyhedral relaxations for integer
  programs.
\newblock In {\em Integer {P}rogramming and {C}ombinatorial {O}ptimization
  (Copenhagen, 1995)}, pages 124--134. Springer, Berlin, 1995.

\bibitem{HelmbergRendl:97}
C.~Helmberg and F.~Rendl.
\newblock A spectral bundle method for semidefinite programming.
\newblock {\em SIAM J. Optim.}, 10(3):673 -- 696, 2000.

\bibitem{HeReVaWo:93}
C.~Helmberg, F.~Rendl, R.J. Vanderbei, and H.~Wolkowicz.
\newblock An interior-point method for semidefinite programming.
\newblock {\em SIAM J. Optim.}, 6(2):342--361, 1996.

\bibitem{HelRenWeis:96}
C.~Helmberg, F.~Rendl, and R.~WEISMANTEL.
\newblock Quadratic knapsack relaxations using cutting planes and semidefinite
  programming.
\newblock In {\em Integer {P}rogramming and {C}ombinatorial {O}ptimization
  (Vancouver, BC, 1996)}, volume 1084 of {\em Lecture Notes in Comput. Sci.},
  pages 190--203. Springer, Berlin, 1996.

\bibitem{HeNeSch:98}
D.~HERSHKOWITZ, M.~NEUMANN, and H.~SCHNEIDER.
\newblock Hermitian positive semidefinite matrices whose entries are 0 or 1 in
  modulus.
\newblock Technical report, Dept. of Mathematics, Technion, Israel, 1998.

\bibitem{HilWat:87}
R.D. HILL and S.R. WATERS.
\newblock On the cone of positive semidefinite matrices.
\newblock {\em Linear Algebra Appl.}, 90:81--88, 1987.

\bibitem{MR97d:90088}
J.-B. HIRIART-URRUTY.
\newblock Conditions for global optimality.
\newblock In {\em Handbook of {G}lobal {O}ptimization}, volume~2 of {\em
  Nonconvex Optim. Appl.}, pages 1--26. Kluwer Acad. Publ., Dordrecht, 1995.

\bibitem{MR96b:15024}
J.-B. HIRIART-URRUTY and D.~YE.
\newblock Sensitivity analysis of all eigenvalues of a symmetric matrix.
\newblock {\em Numer. Math.}, 70(1):45--72, 1995.

\bibitem{HL}
J.B. HIRIART-URRUTY and C.~LEMARECHAL.
\newblock {\em Convex Analysis and Minimization Algorithms}.
\newblock Springer-Verlag, 1993.

\bibitem{HiriartUrrutyLemarechal93b}
J.B. HIRIART-URRUTY and C.~LEMARECHAL.
\newblock {\em Convex Analysis and Minimization Algorithms II}, volume 306 of
  {\em Grundlehren der mathematischen Wissenschaften}.
\newblock Springer, Berlin, Heidelberg, 1993.

\bibitem{TaoAn:98}
L.T. Hoai, P.D. Tao, and L.D. Muu.
\newblock A combined {D}.{C}. optimization--ellipsoidal branch-and-bound
  algorithm for solving nonconvex quadratic programming problems.
\newblock {\em J. Comb. Optim.}, 2(1):9--28, 1998.

\bibitem{hodtenpoo96}
A.S. HODEL, R.B. TENISON, and K.~POOLLA.
\newblock Numerical solution of large {L}yapunov equations by {A}pproximate
  {P}ower {I}teration.
\newblock {\em Linear Algebra Appl.}, 236:205--230, 1996.

\bibitem{hoffman}
A.J. Hoffman.
\newblock On approximate solutions of systems of linear inequalities.
\newblock {\em J. of Research of the National Bureau of Standards},
  49:263--265, 1952.

\bibitem{Hol:75}
R.B. Holmes.
\newblock {\em Geometric Functional Analysis and its Applications}.
\newblock Springer-Verlag, Berlin, 1975.

\bibitem{HoB:76}
H.~P. HORISBERGER and P.~R. B\'ELANGER.
\newblock Regulators for linear, time invariant plants with uncertain
  parameters.
\newblock {\em IEEE Trans.\ Aut.\ Control}, AC-21:705--708, 1976.

\bibitem{HoJo:91}
R.A. Horn and C.R. Johnson.
\newblock {\em Topics in matrix analysis}.
\newblock Cambridge University Press, Cambridge, 1994.
\newblock Corrected reprint of the 1991 original.

\bibitem{Illes98}
T.~ILL{\'E}S, J.~Peng, C.~Roos, , and T.~Terlaky.
\newblock A strongly polynomial rounding procedure yielding a maximally
  complementary solution for {P}$^*(\kappa)$ linear complementarity problems.
\newblock Technical Report 98--15, Faculty of Technical Mathematics and
  Computer Science, Delft University of Technology, Delft, The Netherlands,
  1998.

\bibitem{Isi60}
K.~ISII.
\newblock The extrema of probability determined by generalized moments (i)
  bounded random variables.
\newblock {\em Ann. Inst. Stat. Math.}, 12:119--133, 1960.

\bibitem{Isi63}
K.~ISII.
\newblock On sharpness of {C}hebyshev-type inequalities.
\newblock {\em Ann. Inst. Stat. Math.}, 14:185--197, 1963.

\bibitem{jac-68}
N.~JACOBSON.
\newblock Structure and representation of {J}ordan algebras.
\newblock {\em Colloquium Publications}, XXXIX, 1968.

\bibitem{Ja:86}
J.~JAHN.
\newblock {\em Mathematical Vector Optimization in Partially Ordered Linear
  Spaces}.
\newblock Peter Lang, Frankfurt am Main, 1986.

\bibitem{Jame:70}
G.~JAMESON.
\newblock {\em Ordered linear spaces}.
\newblock Springer-Verlag, New York, 1970.

\bibitem{int:Jansen4}
B.~JANSEN, C.~ROOS, and T.~Terlaky.
\newblock The theory of linear programming: skew symmetric self-dual problems
  and the central path.
\newblock {\em Optimization}, 29(3):225--233, 1994.

\bibitem{MR96k:90002}
B.~JANSEN, C.~Roos, and T.~Terlaky.
\newblock Interior point methods, a decade after {K}armarkar---a survey, with
  application to the smallest eigenvalue problem.
\newblock {\em Statist. Neerlandica}, 50(1):146--170, 1996.

\bibitem{MR1430560}
B.~JANSEN, C.~Roos, and T.~Terlaky.
\newblock A family of polynomial affine scaling algorithms for positive
  semidefinite linear complementarity problems.
\newblock {\em SIAM J. Optim.}, 7(1):126--140, 1997.

\bibitem{JansenRoosTerlaky}
B.~JANSEN, K.~Roos, and T.~Terlaky.
\newblock An interior point method approach to postoptimal and parametric
  analysis in linear programming.
\newblock In {\em Proceeding of the Workshop on Interior Point Methods},
  Budapest, Hungary, 1993.

\bibitem{Jarr:90}
F.~Jarre.
\newblock On the convergence of the method of analytic centers when applied to
  convex quadratic programs.
\newblock {\em Math. Programming}, 49(3):341--358, 1990.

\bibitem{Jarr:93}
F.~Jarre.
\newblock An interior point method for minimizing the maximum eigenvalue of a
  linear combination of matrices.
\newblock {\em SIAM J. Control and Optimization}, 31:1360--1377, 1993.

\bibitem{jakozo}
F.~Jarre, M.~KOCVARA, and J.~ZOWE.
\newblock Optimal truss design by interior-point methods.
\newblock {\em SIAM J. Optim.}, 1999.
\newblock To appear.

\bibitem{jasost}
F.~Jarre, G.~SONNEVEND, and J.~STOER.
\newblock An implementation of the method of analytic centers.
\newblock In A.\ Benoussan and J.L.\ Lions, editors, {\em Analysis and
  Optimization of Systems}, volume 111 of {\em Lecture Notes in Control and
  Information Sciences}, pages 297--307. Springer, New York, 1988.

\bibitem{int:Jiang1}
J.~JIANG.
\newblock A long-step primal-dual path-following method for semidefinite
  programming.
\newblock {\em Oper. Res. Lett.}, 23(1-2):53--61, 1998.

\bibitem{Jiang:97}
J~JIANG and M.~SHI.
\newblock A logarithmic barrier {N}ewton method for semidefinite programming.
\newblock {\em Systems Sci. Math. Sci.}, 10(2):168--175, 1997.

\bibitem{Jibrinthesis:97}
S.~Jibrin.
\newblock {\em Redundancy in Semidefinite Programming}.
\newblock PhD thesis, Carleton University, Ottawa, Ontario, Canada, 1997.

\bibitem{JiPress:98}
S.~JIBRIN and I.~PRESSMAN.
\newblock Probabilistic algorithms for the detection of nonredundant linear
  matrix inequality constraints.
\newblock Technical report, Carleton University, Ottawa, Ontario, Canada, 1998.

\bibitem{Joh:48}
F.~JOHN.
\newblock Extremum problems with inequalities as subsidiary conditions.
\newblock In {\em Studies and Essays, Courant Anniversary Volume}, pages
  187--204. Interscience, New York, 1948.

\bibitem{joh:90}
C.R. Johnson.
\newblock Matrix completion problems: a survey.
\newblock {\em Proceedings of Symposium in Applied Mathematics}, 40:171--198,
  1990.

\bibitem{johKro:95}
C.R. Johnson and B.~KROSCHEL.
\newblock Principal submatrices, geometric multiplicities, and structured
  eigenvectors.
\newblock {\em SIAM J. Matrix Anal. Appl.}, 16:1004--1012, 1995.

\bibitem{JoKrWo:95}
C.R. Johnson, B.~Kroschel, and H.~Wolkowicz.
\newblock An interior-point method for approximate positive semidefinite
  completions.
\newblock {\em Comput. Optim. Appl.}, 9(2):175--190, 1998.

\bibitem{MR99c:15040}
C.R. Johnson, B.K. KROSCHEL, and M.~LUNDQUIST.
\newblock The totally nonnegative completion problem.
\newblock In {\em Topics in Semidefinite and Interior-Point Methods (Toronto,
  ON, 1996)}, pages 97--107. Amer. Math. Soc., Providence, RI, 1998.

\bibitem{johRod:84}
C.R. Johnson and L.~RODMAN.
\newblock Inertia possibilities for completions of partial {H}ermitian
  matrices.
\newblock {\em Linear and Multilinear Algebra}, 16:179--195, 1984.

\bibitem{johschr:96}
C.R. Johnson and E.A. SCHREINER.
\newblock The relationship between {$AB$ }and {$BA$}.
\newblock {\em American Math. Monthly}, Aug-Sept:578--582, 1996.

\bibitem{JohTar:95}
C.R. Johnson and P.~Tarazaga.
\newblock Approximate semidefinite matrices in a subspace.
\newblock {\em SIAM J. Matrix Anal. Appl.}, 19(4):861--871, 1999.

\bibitem{Johnson}
N.~Johnson and S.~KOTZ.
\newblock {\em Distributions in Statistics: Continuous Multivariate
  Distributions}.
\newblock John Wiley \& Sons, New York, NY, 1972.

\bibitem{JoNeWi:34}
P.~JORDAN, J.~VON NEUMANN, and E.~WIGNER.
\newblock On an algebraic generalization of the quantum mechanical formalism.
\newblock {\em Annals of Mathematics}, 35:29--64, 1934.

\bibitem{JK95}
E.~JOUINI and H.~KALLAL.
\newblock Martingales and arbitrage in securities markets with transaction
  costs.
\newblock {\em Journal of Economic Theory}, 66:178--197, 1995.

\bibitem{MR95g:90042}
M.~J{\"U}NGER, A.~MARTIN, G.~REINELT, and R.~WEISMANTEL.
\newblock Quadratic $0/1$ optimization and a decomposition approach for the
  placement of electronic circuits.
\newblock {\em Math. Programming}, 63(3, Ser. B):257--279, 1994.

\bibitem{ZDG:96}
{K. ZHOU with J. DOYLE} and K.~GLOVER.
\newblock {\em Robust and Optimal Control}.
\newblock Prentice Hall, 1996.

\bibitem{Kah:96}
N.~KAHALE.
\newblock A semidefinite bound for mixing rates of {M}arkov chains.
\newblock In {\em Integer programming and combinatorial optimization
  (Vancouver, BC, 1996)}, volume 1084 of {\em Lecture Notes in Comput. Sci.},
  pages 190--203. Springer, Berlin, 1996.

\bibitem{KaWi:71}
C.~KALLINA and A.C. WILLIAMS.
\newblock Linear programming in reflexive spaces.
\newblock {\em SIAM Rev.}, 13:350--376, 1971.

\bibitem{Kal:63}
R.E. KALMAN.
\newblock {L}yapunov functions for the problem of {L}ur'e in automatic control.
\newblock {\em Proc. Nat. Acad. Sci., USA}, 49:201--205, 1963.

\bibitem{Kal:63a}
R.E. KALMAN.
\newblock On a new characterization of linear passive systems.
\newblock In {\em Proc. First Annual Allerton Conf. on Communication, Control
  and Computing}, pages 456--470, 1963.

\bibitem{int:Kamath3}
A.~KAMATH and N.K. KARMARKAR.
\newblock A continuous method for computing bounds in integer quadratic
  optimization problems.
\newblock {\em J. Global Optim.}, 2(3):229--241, 1992.
\newblock Conference on Computational Methods in Global Optimization, II
  (Princeton, NJ, 1991).

\bibitem{Kan:48}
L.V. KANTOROVICH.
\newblock Functional analysis and applied mathematics.
\newblock {\em Uspekhi Mat. Nauk.}, 3:89--185, 1948.
\newblock Transl. by C. Benster as N.B.S. Rept. 1509, Washington D.C., 1952.

\bibitem{MR87j:15039}
D.~L. KAR{\v{C}}ICKA.
\newblock Self-conditionally positive semidefinite matrices.
\newblock {\em Mat. Fak. Univ. Kiril Metodij Skopje Godi\v sen Zb.},
  33(34):53--57, 1982/83.

\bibitem{KargerMotwaniSudan94}
D.~KARGER, R.~MOTWANI, and M.~SUDAN.
\newblock Approximate graph coloring by semidefinite programming.
\newblock {\em J. Assoc. Comput. Mach.}, 45:246--265, 1998.

\bibitem{Karischthesis:95}
S.~Karisch.
\newblock {\em Nonlinear Approaches for Quadratic Assignment and Graph
  Partition Problems}.
\newblock PhD thesis, Graz, Austria, 1995.

\bibitem{KaRe:95dec}
S.E. Karisch and F.~Rendl.
\newblock Semidefinite programming and graph equipartition.
\newblock In {\em Topics in Semidefinite and Interior-Point Methods}, volume~18
  of {\em The Fields Institute for Research in Mathematical Sciences,
  Communications Series}, Providence, Rhode Island, 1998. American Mathematical
  Society.

\bibitem{KaReCl:97}
S.E. Karisch, F.~Rendl, and J.~Clausen.
\newblock solving graph bisection problems with semidefinite programming.
\newblock Technical Report Report DIKU-Tr-97/9, University of Copenhagen, Dept.
  of Computer Science, 1997.

\bibitem{KaReWo:93}
S.E. Karisch, F.~Rendl, and H.~Wolkowicz.
\newblock Trust regions and relaxations for the quadratic assignment problem.
\newblock In {\em Quadratic assignment and related problems (New Brunswick, NJ,
  1993)}, pages 199--219. Amer. Math. Soc., Providence, RI, 1994.

\bibitem{KS53}
S.~KARLIN and L.S. SHAPLEY.
\newblock Geometry of moment spaces.
\newblock {\em Memoirs Amer. Math. Soc.}, 12, 1953.

\bibitem{KarStu}
S.~KARLIN and W.J. STUDDEN.
\newblock {\em Tchebycheff Systems: with Applications in Analysis and
  Statistics}.
\newblock Pure and Applied Mathematics, A Series of Texts and Monographs.
  Interscience Publishers, John Wiley and Sons, 1966.

\bibitem{Kar:95b}
H.~KARLOFF.
\newblock How good is the {G}oemans-{W}illiamson {M}{A}{X} {C}{U}{T} algorithm?
\newblock In {\em Proceedings of the Twenty-eighth Annual ACM Symposium on the
  Theory of Computing (Philadelphia, PA, 1996)}, pages 427--434, New York,
  1996. ACM.

\bibitem{Kar:95}
H.~KARLOFF.
\newblock How good is the {G}oemans-{W}illiamson {M}{A}{X} {C}{U}{T} algorithm?
\newblock {\em SIAM J. on Computing}, 29(1):336--350, 1999.

\bibitem{KarloffZ97}
H.~KARLOFF and U.~ZWICK.
\newblock A $7/8$-approximation algorithm for {MAX 3SAT}?
\newblock In {\em Proc. 38th Symp. on Found. of Comp. Sci.}, pages 406--415,
  1997.

\bibitem{Karmarkar:84}
N.K. KARMARKAR.
\newblock A new polynomial time algorithm for linear programming.
\newblock {\em Combinatorica}, 4:373--395, 1984.

\bibitem{Ka:72}
R.~M. KARP.
\newblock Reducibility among combinatorial problems.
\newblock In R.~E. Miller and J.W. Thatcher, editors, {\em Complexity of
  Computer Computation}, pages 85--103. Plenum Press, New York, 1972.

\bibitem{Kato:76}
T.~KATO.
\newblock {\em Perturbation theory for linear operators}.
\newblock Springer-Verlag, Berlin, second edition, 1976.
\newblock Grundlehren der Mathematischen Wissenschaften, Band 132.

\bibitem{Kawa:88}
H.~KAWASAKI.
\newblock An envelope-like effect of infinitely many inequality constraints on
  second-order necessary conditions for minimization problems.
\newblock {\em Math. Programming}, 41:73--96, 1988.

\bibitem{ke}
F.P. KELLY.
\newblock {\em Reversibility and Stochastic Networks}.
\newblock John Wiley \& Sons, New York, 1979.

\bibitem{Kem81}
J.H.B. KEMPERMANN.
\newblock On the role of duality in the theory of moments.
\newblock In {\em Lecture Notes in Econom. and Math. Systems}, volume 215,
  pages 63--92, Berlin-New York, 1983. Springer.

\bibitem{Kem87}
J.H.B. KEMPERMANN.
\newblock Geometry of the moment problem.
\newblock In {\em Proc. Sympos. Appl. Math.}, volume~37, pages 16--53,
  Providence, RI, 1987.

\bibitem{KiBe:89}
H.A.L. KIERS and J.M.F.~TEN BERGE.
\newblock Optimality conditions for the trace of certain matrix products.
\newblock {\em Linear Algebra Appl.}, 126:125--134, 1989.

\bibitem{kinsta}
D.~KINDERLEHRER and G.~STAMPACCHIA.
\newblock {\em An Introduction to Variational Inequalities and Applications}.
\newblock Academic Press, New York, NY, 1980.

\bibitem{Kiwiel83}
K.C. KIWIEL.
\newblock An aggregate subgradient method for nonsmooth convex minimization.
\newblock {\em Math. Programming}, 27:320--341, 1983.

\bibitem{Kiwiel90}
K.C. KIWIEL.
\newblock Proximity control in bundle methods for convex nondifferentiable
  minimization.
\newblock {\em Math. Programming}, 46:105--122, 1990.

\bibitem{MR1427530}
P.~KLEIN and H.-I LU.
\newblock Efficient approximation algorithms for semidefinite programs arising
  from {M}{A}{X} {C}{U}{T} and {C}{O}{L}{O}{R}{I}{N}{G}.
\newblock In {\em Proceedings of the Twenty-eighth Annual ACM Symposium on the
  Theory of Computing (Philadelphia, PA, 1996)}, pages 338--347, New York,
  1996. ACM.

\bibitem{kl}
G.P. KLIMOV.
\newblock Time sharing service systems {I}.
\newblock {\em Theory Probab. Appl.}, 19:532--551, 1974.

\bibitem{kl2}
G.P. KLIMOV.
\newblock Time sharing service systems {II}.
\newblock {\em Theory Probab. Appl.}, 23:314--321, 1978.

\bibitem{Kn:94}
D.E. Knuth.
\newblock The sandwich theorem.
\newblock {\em Electronic J. Combinatorics}, 1:48pp, 1994.

\bibitem{KLQ:95}
C.-W. KO, J.~LEE, and M.~QUEYRANNE.
\newblock An exact algorithm for maximum entropy sampling.
\newblock {\em Oper. Res.}, 43(4):684--691, 1995.

\bibitem{KLW:98}
C.-W. KO, J.~LEE, and K.~WAYNE.
\newblock A spectral bound for {D}-optimality.
\newblock In A.C. Atkinson, L.~Pronzato, and H.P. Wynn, editors, {\em MODA 5 -
  Advances in Model-Oriented Data Analysis and Experimental Design (Marseilles,
  1998)}, Contributions to Statistics. Springer, Berlin, 1998.

\bibitem{Koj}
M.~Kojima.
\newblock Private communication.
\newblock Technical report, Dept. of Information Sciences, Tokyo Institute of
  Technology, Tokyo, Japan, 1995.

\bibitem{KoKoHa:94}
M.~Kojima, S.~KOJIMA, and S.~HARA.
\newblock Linear algebra for semidefinite programming.
\newblock Technical Report 1004, Dept. of Information Sciences, Tokyo Institute
  of Technology, Tokyo, Japan, 1997.
\newblock Linear matrix inequalities and positive semidefinite programming
  (Japanese) (Kyoto, 1996).

\bibitem{KMNY:91}
M.~Kojima, N.~MEGIDDO, T.~NOMA, and A.~YOSHISE.
\newblock {\em A Unified Approach to Interior Point Algorithms for Linear
  Complementarity Problems}.
\newblock Lecture Notes in Computer Science. Springer-Verlag, NY, USA, 1991.

\bibitem{KMY:89}
M.~Kojima, S.~MIZUNO, and A.~YOSHISE.
\newblock A polynomial time algorithm for a class of linear complementarity
  problems.
\newblock {\em Math. Programming}, 44:1--26, 1989.

\bibitem{int:Kojima4}
M.~Kojima, S.~MIZUNO, and A.~YOSHISE.
\newblock A primal--dual interior point algorithm for linear programming.
\newblock In N.~Megiddo, editor, {\em Progress in Mathematical Programming~:
  Interior Point and Related Methods}, pages 29--47. Springer Verlag, New York,
  1989.

\bibitem{KMY:91}
M.~Kojima, S.~MIZUNO, and A.~YOSHISE.
\newblock An {O}${(\sqrt{n}{L})}$ iteration potential reduction algorithm for
  linear complementarity problems.
\newblock {\em Math. Programming}, 50:331--342, 1991.

\bibitem{KoShShi:95}
M.~Kojima, M.~Shida, and S.~Shindoh.
\newblock Reduction of monotone linear complementarity problems over cones to
  linear programs over cones.
\newblock Technical report, Dept. of Information Sciences, Tokyo Institute of
  Technology, Tokyo, Japan, 1995.

\bibitem{KoShShi:96}
M.~Kojima, M.~Shida, and S.~Shindoh.
\newblock Local convergence of predictor-corrector infeasible-interior-point
  algorithms for {SDP}s and {SDLCP}s.
\newblock Technical report, Dept. of Information Sciences, Tokyo Institute of
  Technology, Tokyo, Japan, 1996.

\bibitem{KoShSh:96}
M.~Kojima, M.~Shida, and S.~Shindoh.
\newblock A note on the {N}esterov-{T}odd and the {K}ojima-{S}hindoh-{H}ara
  search directions in semidefinite programming.
\newblock Technical report, Department of Mathematical and Computing Sciences
  Tokyo Institute of Technology, Oh-Okayama, Meguro, Tokyo 152-8552, 1999.
\newblock To appear in Optim. Methods Softw.

\bibitem{int:Kojima30}
M.~Kojima, M.~Shida, and S.~Shindoh.
\newblock A predictor-corrector interior point algorithm for the semidefinite
  linear complementarity problem using the {Alizadeh-Haeberley-Overton} search
  direction.
\newblock {\em SIAM J. Optim.}, 9(2):444--465, 1999.

\bibitem{KoShHa:94}
M.~Kojima, S.~Shindoh, and S.~HARA.
\newblock Interior-point methods for the monotone semidefinite linear
  complementarity problem in symmetric matrices.
\newblock {\em SIAM J. Optim.}, 7(1):86--125, 1997.

\bibitem{KoTu:98b}
M.~Kojima and L.~Tun{\c{c}}el.
\newblock Discretization and localization in successive convex relaxation
  methods for nonconvex quadratic optimization problems.
\newblock Technical Report CORR 98-34, Dept. of Combinatorics and Optimization,
  University of Waterloo, 1998.

\bibitem{KojimaTuncel:98}
M.~Kojima and L.~TUN{\c{C}}EL.
\newblock Monotonicity of primal-dual interior-point algorithms for
  semidefinite programming problems.
\newblock {\em Optim. Methods Softw.}, 10:275--296, 1998.

\bibitem{KoTu:99}
M.~Kojima and L.~Tun{\c{c}}el.
\newblock On the finite convergence of successive convex relaxation methods.
\newblock Technical Report CORR99-36, Dept. of Combinatorics and Optimization,
  University of Waterloo, 1999.

\bibitem{KoTu:98}
M.~Kojima and L.~Tun{\c{c}}el.
\newblock Cones of matrices and successive convex relaxations of nonconvex
  sets.
\newblock {\em SIAM J. Optim.}, 10(3):750--778, 2000.

\bibitem{Ko:88}
F.~K{\"O}RNER.
\newblock A tight bound for the {B}oolean quadratic optimization problem and
  its use in a branch and bound algorithm.
\newblock {\em Optimization}, 19(5):711--721, 1988.

\bibitem{Ko:92}
F.~K{\"{O}}RNER.
\newblock Remarks on a difficult test problem for quadratic {B}oolean
  programming.
\newblock {\em Optimization}, 26:355--357, 1992.

\bibitem{Kortan:77}
K.O. KORTANEK.
\newblock Constructing a perfect duality in infinite programming.
\newblock {\em Appl. Math. Optim.}, 3(4):357--372, 1977.

\bibitem{KortanZhang:98}
K.O. KORTANEK and Q.~Zhang.
\newblock Prefect duality in semi-infinite and semidefinite programming.
\newblock Technical report, Department of Management Sciences The University of
  Iowa, 1998.

\bibitem{KoK:96}
M.~KOSHELER and V.~KREINOVITCH.
\newblock Interval computations web site.
\newblock {\tt cs.utep.edu/interval-comp/main.html}, 1996.

\bibitem{Kruk:96}
S.~Kruk.
\newblock Semidefinite programming applied to nonlinear programming.
\newblock Master's thesis, University of Waterloo, 1996.

\bibitem{KrMuReVaWo:98}
S.~Kruk, M.~Muramatsu, F.~Rendl, R.J. Vanderbei, and H.~Wolkowicz.
\newblock The {G}auss-{N}ewton direction in semidefinite programming.
\newblock {\em Optim. Methods Softw.}, 15(1):1--28, 2001.

\bibitem{KrWo:97}
S.~Kruk and H.~Wolkowicz.
\newblock {S}{Q}$^2${P}, sequential quadratic constrained quadratic
  programming.
\newblock In {\em Advances in {N}onlinear {P}rogramming (Beijing, 1996)}, pages
  177--204, Dordrecht, 1998. Kluwer Acad. Publ.

\bibitem{Kuhn:76}
H.W. KUHN.
\newblock Nonlinear programming: a historical view.
\newblock In R.W. Cottle and C.E. Lemke, editors, {\em Nonlinear Programming},
  pages 1--26, Providence, R.I., 1976. AMS.

\bibitem{MR13:855f}
H.W. KUHN and A.W. TUCKER.
\newblock Nonlinear programming.
\newblock In {\em Proceedings of the Second Berkeley Symposium on Mathematical
  Statistics and Probability, 1950}, pages 481--492, Berkeley and Los Angeles,
  1951. University of California Press.

\bibitem{kume}
P.R. KUMAR and S.P. MEYN.
\newblock Duality and linear programs for stability and performance analysis of
  queueing networks and scheduling policies.
\newblock {\em IEEE Trans. Autom. Control}, 41:4--16, 1996.

\bibitem{kuku}
S.~KUMAR and P.R. KUMAR.
\newblock Performance bounds for queueing networks and scheduling policies.
\newblock {\em IEEE Trans. Autom. Control}, 39:1600--1611, 1994.

\bibitem{kur76}
S.~Kurcyusz.
\newblock On the existence and nonexistence of {L}agrange multipliers in
  {B}anach spaces.
\newblock {\em Journal of Optimization Theory and Applications}, 20:81--110,
  1976.

\bibitem{Kw:89}
M.K. KWONG.
\newblock Some results on matrix monotone functions.
\newblock {\em Linear Algebra Appl.}, 118:129--153, 1989.

\bibitem{Lan87}
H.J. LANDAU.
\newblock Classical background on the moment problem.
\newblock In ed. H.J.~Landau, editor, {\em Moments in Mathematics}, number~37
  in Proc. Sympos. Appl. Math., Series III, pages 1--15, Providence, RI, 1987.
  American Mathematical Society.

\bibitem{MR96e:15039}
J.B. Lasserre.
\newblock A new {F}arkas lemma for positive semidefinite matrices.
\newblock {\em IEEE Trans. Automat. Control}, 40(6):1131--1133, 1995.

\bibitem{Lass:96}
J.B. Lasserre.
\newblock Linear programming with positive semi-definite matrices.
\newblock {\em MPE}, 2:499--521, 1996.

\bibitem{MR1430294}
J.B. Lasserre.
\newblock A {F}arkas lemma without a standard closure condition.
\newblock {\em SIAM J. Control Optim.}, 35(1):265--272, 1997.

\bibitem{Laurmp:97}
M.~Laurent.
\newblock Cuts, matrix completions and graph rigidity.
\newblock {\em Math. Programming}, 79:255--284, 1997.

\bibitem{Laurmp:97real}
M.~Laurent.
\newblock The real positive semidefinite completion problem for series-parallel
  graphs.
\newblock {\em Linear Algebra Appl.}, 252:347--366, 1997.

\bibitem{Laur:97b}
M.~Laurent.
\newblock A connection between positive semidefinite and {E}uclidean distance
  matrix completion problems.
\newblock {\em Linear Algebra Appl.}, 273:9--22, 1998.

\bibitem{LaPo:94}
M.~Laurent and S.~POLJAK.
\newblock On a positive semidefinite relaxation of the cut polytope.
\newblock {\em Linear Algebra Appl.}, 223/224:439--461, 1995.

\bibitem{LaPorep:94}
M.~Laurent and S.~POLJAK.
\newblock On the facial structure of the correlation matrices.
\newblock {\em SIAM J. Matrix Anal. Appl.}, 17(3):530--547, 1996.

\bibitem{LaurPolRend:97}
M.~Laurent, S.~POLJAK, and F.~Rendl.
\newblock Connections between semidefinite relaxations of the max-cut and
  stable set problems.
\newblock {\em Math. Programming}, 77:225--246, 1997.

\bibitem{Lee:98}
J.~LEE.
\newblock Constrained maximum-entropy sampling.
\newblock {\em Oper. Res.}, 46:655--664, 1998.

\bibitem{lh82}
J.~De Leeuw and W.~Heiser.
\newblock Theory of multidimensional scaling.
\newblock In P.~R. Krishnaiah and L.~N. Kanal, editors, {\em Handbook of
  Statistics}, volume~2, pages 285--316. North-Holland, 1982.

\bibitem{LeO:98}
C.~LEMAR\'ECHAL and F.~OUSTRY.
\newblock Nonsmooth algorithms to solve semidefinite programs.
\newblock In L.~EL Ghaoui and S-I. Niculescu, editors, {\em Recent Advances on
  LMI methods in Control}, Advances in Design and Control series. SIAM, 1999.
\newblock To appear.

\bibitem{LemOustry:99}
C.~Lemar\'echal and F.~Oustry.
\newblock Semidefinite relaxations and {L}agrangian duality with application to
  combinatorial optimization.
\newblock Technical report, Institut National de Recherche en Informatique et
  en Automatique, INRIA, St Martin, France, 1999.

\bibitem{LemMau:80}
F.~LEMPIO and H.~MAURER.
\newblock Differential stability in infinite-dimensional nonlinear programming.
\newblock {\em Appl. Math. Optim.}, 6:139--152, 1980.

\bibitem{MR83m:49013}
F.~LEMPIO and J.~ZOWE.
\newblock Higher order optimality conditions.
\newblock In {\em Modern applied mathematics (Bonn, 1979)}, pages 147--193.
  North-Holland, Amsterdam, 1982.

\bibitem{Lev:75}
E.S. LEVITIN.
\newblock On differential properties of the optimal value of parametric
  problems of mathematical programming.
\newblock {\em Dokl. Akad. Nauk SSSR}, 224:1354--1358, 1975.

\bibitem{lesi}
H.~LEVY and M.~SIDI.
\newblock Polling systems: applications, modeling, and optimization.
\newblock {\em IEEE Trans. Comm.}, 38:1750--1760, 1990.

\bibitem{Lewco663:94}
A.S. Lewis.
\newblock {\em Take-home final exam, {C}ourse {CO}663 in {C}onvex {A}nalysis}.
\newblock University of Waterloo, Ontario, Canada, 1994.

\bibitem{Lew:96}
A.S. LEWIS.
\newblock Convex analysis on the {H}ermitian matrices.
\newblock {\em SIAM J. Optim.}, 6(1):164--177, 1996.

\bibitem{Le:94}
A.S. LEWIS.
\newblock Derivatives of spectral functions.
\newblock {\em Math. Oper. Res.}, 21(3):576--588, 1996.

\bibitem{MR97g:90097}
A.S. LEWIS.
\newblock Group invariance and convex matrix analysis.
\newblock {\em SIAM J. Matrix Anal. Appl.}, 17(4):927--949, 1996.

\bibitem{Lew:95}
A.S. LEWIS.
\newblock Eigenvalue-constrained faces.
\newblock {\em Linear Algebra Appl.}, 269:159--181, 1998.

\bibitem{LewOver:96}
A.S. LEWIS and M.L. Overton.
\newblock Eigenvalue optimization.
\newblock {\em Acta Numerica}, 5:149--190, 1996.

\bibitem{LiTa:94}
C.K. LI and B.S. TAM.
\newblock A note on extreme correlation matrices.
\newblock {\em SIAM J. Matrix Anal. Appl.}, 15(3):903--908, 1994.

\bibitem{Lim:79}
M.H. LIM.
\newblock Linear transformations on symmetric matrices.
\newblock {\em Linear and Multilinear Algebra}, 7:47--57, 1979.

\bibitem{LinSaig:95b}
C.~LIN and R.~SAIGAL.
\newblock An infeasible start predictor corrector method for semi-definite
  linear programming.
\newblock Technical report, Dept. of Ind. and Oper. Eng., Univ. of Michigan,
  Ann Arbor, MI, 1995.

\bibitem{LinSaig:95}
C.~LIN and R.~SAIGAL.
\newblock A predictor corrector method for semi-definite linear programming.
\newblock Technical report, Dept. of Ind. and Oper. Eng., Univ. of Michigan,
  Ann Arbor, MI, 1995.

\bibitem{LinSaig:97}
C.~LIN and R.~SAIGAL.
\newblock On solving large-scale semidefinite programming problems - a case
  study of quadratic assignment problem.
\newblock Technical report, Dept. of Ind. and Oper. Eng., Univ. of Michigan,
  Ann Arbor, MI, 1997.

\bibitem{LiRe:99}
A.~LISSER and F.~Rendl.
\newblock Telecommunication clustering using linear and semidefinite
  programming.
\newblock Technical report, Institut fuer Mathematik, Universitaet Klagenfurt,
  A - 9020 Klagenfurt, Austria, 1999.

\bibitem{LiuZhu:97}
J.~Liu and L.~ZHU.
\newblock A minimum principle and estimates of the eigenvalues for schur
  complements positive semidefinite {H}ermitian matrices.
\newblock {\em Linear Algebra Appl.}, 265:123--147, 1997.

\bibitem{sLiu:96}
S.~Liu.
\newblock Reverse of a convex matrix inequality.
\newblock {\em IMAGE}, 16:32, 1996.
\newblock Problem Corner.

\bibitem{Lo}
A.~LO.
\newblock Semiparametric upper bounds for option prices and expected payoffs.
\newblock {\em Journal of Financial Economics}, 19:373--388, 1987.

\bibitem{MR1655138}
M.S. Lobo, L.~Vandenberghe, S.~Boyd, and H.~Lebret.
\newblock Applications of second-order cone programming.
\newblock {\em Linear Algebra Appl.}, 284(1-3):193--228, 1998.
\newblock ILAS Symposium on Fast Algorithms for Control, Signals and Image
  Processing (Winnipeg, MB, 1997).

\bibitem{Lo:80}
R.~LOEWY.
\newblock Extreme points of a convex subset of the cone of positive
  semidefinite matrices.
\newblock {\em Math. Ann.}, 253:227--232, 1980.

\bibitem{longstaff}
F.~LONGSTAFF.
\newblock Martingale restriction tests of option pricing models, version 1.
\newblock Technical report, University of California, Los Angeles, 1990.
\newblock Working paper.

\bibitem{Lo:79}
L.~Lov{\'{a}}sz.
\newblock On the {S}hannon capacity of a graph.
\newblock {\em IEEE Transactions on Information Theory}, 25:1--7, 1979.

\bibitem{LoSc:91}
L.~Lov{\'{a}}sz and A.~Schrijver.
\newblock Cones of matrices and set-functions and 0-1 optimization.
\newblock {\em SIAM J. Optim.}, 1(2):166--190, 1991.

\bibitem{Loew:34}
K.~L\"{O}WNER.
\newblock {\"Uber} monotone matrixfunktionen.
\newblock {\em Math. Z.}, 38:177--216, 1934.

\bibitem{MR97g:65069}
L.Z. LU.
\newblock Matrix bounds and simple iterations for positive semidefinite
  solutions to discrete-time algebraic {R}iccati equations.
\newblock {\em Xiamen Daxue Xuebao Ziran Kexue Ban}, 34(4):512--516, 1995.

\bibitem{LuPaRo:96}
S.~Lucidi, L.~PALAGI, and M.~Roma.
\newblock Quadratic programs with quadratic constraint; characterization of
  {KKT} points and equivalence with an unconstrained problem.
\newblock Technical report, Universita di Roma la Sapienca, 1995.

\bibitem{Lu:69}
D.G. Luenberger.
\newblock {\em Optimization by Vector Space Methods}.
\newblock John Wiley, 1969.

\bibitem{MR97i:15022}
M.~LUNDQUIST and W.~BARRETT.
\newblock Rank inequalities for positive semidefinite matrices.
\newblock {\em Linear Algebra Appl.}, 248:91--100, 1996.

\bibitem{LuJo:91}
M.~LUNDQUIST and C.R. Johnson.
\newblock Linearly constrained positive definite completions.
\newblock {\em Linear Algebra Appl.}, 150:195--207, 1991.

\bibitem{lb}
X.~Luo and D.~Bertsimas.
\newblock A new algorithm for state constrained separated continuous linear
  programs.
\newblock {\em SIAM J. Contr. Optim.}, 1:177--210, 1998.

\bibitem{LL94}
X.D. Luo and Z.-Q. Luo.
\newblock Extensions of {H}offman's error bound to polynomial systems.
\newblock {\em SIAM J. Optim.}, 4:383--392, 1994.

\bibitem{LuoStZh:95}
Z-Q. Luo, J.~F. Sturm, and S.~Zhang.
\newblock Superlinear convergence of a symmetric primal-dual path-following
  algorithm for semidefinite programming.
\newblock {\em SIAM J. Optim.}, 8:59--81, 1998.

\bibitem{LuoStZh:96}
Z-Q. Luo, J.F. Sturm, and S.~Zhang.
\newblock Duality and self-duality for conic convex programming.
\newblock Technical report, Erasmus University Rotterdam, The Netherlands,
  1996.

\bibitem{LuoStZh:97}
Z-Q. Luo, J.F. Sturm, and S.~Zhang.
\newblock Duality results for conic convex programming.
\newblock Technical Report Report 9719/A, April, Erasmus University Rotterdam,
  Econometric Institute EUR, P.O. Box 1738, 3000 DR, The Netherlands, 1997.

\bibitem{Sun:95}
Z-Q. Luo and J.~SUN.
\newblock An analytic center based column generation algorithm for convex
  quadratic feasibility problems.
\newblock Technical report, McMaster University, Hamilton, Ontario, 1995.

\bibitem{LuoZh:97}
Z-Q. Luo and S.~Zhang.
\newblock On extensions of the {F}rank-{W}olfe theorems.
\newblock {\em Comput. Optim. Appl.}, 13(1-3):87--110, 1999.
\newblock Computational optimization---a tribute to Olvi Mangasarian, Part II.

\bibitem{Lur:57}
A.I. LUR'E.
\newblock {\em Some Nonlinear Problems in the Theory of Automatic Control}.
\newblock H. M. Stationery Off., London, 1957.
\newblock In Russian, 1951.

\bibitem{Lya:47}
A.M. LYAPUNOV.
\newblock {\em Probl\`eme g\'en\'eral de la stabilit\'e du mouvement},
  volume~17 of {\em Annals of Mathematics Studies}.
\newblock Princeton University Press, Princeton, 1947.

\bibitem{ly}
A.M.\ LYAPUNOV.
\newblock The general problem of stability of motion.
\newblock {\em Ann. math. Studies}, 11, 1949.
\newblock Princeton (in Russian: Moscow 1935).

\bibitem{Maa:85}
Z.A. MAANY.
\newblock A new algorithm for highly curved constrained optimization.
\newblock Technical Report T.R. 161, The Hatfield Polytechnic Numerical
  Optimization Centre, 1985.

\bibitem{MangFrom:67}
O.L. MANGASARIAN and S.~FROMOVITZ.
\newblock The {F}ritz {J}ohn necessary optimality conditions in the presence of
  equality and inequality constraints.
\newblock {\em J. Math. Anal. Appl.}, 17:37--47, 1967.

\bibitem{marminc:64}
M.~MARCUS and H.~MINC.
\newblock {\em A Survey of Matrix Theory and Matrix Inequalities}.
\newblock Dover Publications Inc., New York, 1992.
\newblock Reprint of the 1969 edition.

\bibitem{MarcusMoyls:59}
M.~MARCUS and B.N. MOYLS.
\newblock Linear transformations on algebras of matrices.
\newblock {\em Canadian J. Math.}, 11:61--66, 1959.

\bibitem{Markov884}
A.~MARKOV.
\newblock {\em On Certain Applications of Algebraic Continued Fractions}.
\newblock PhD thesis, 1884.
\newblock in Russian.

\bibitem{Mar84}
A.~MARSHALL.
\newblock Markov's inequality for random variables taking values in a linear
  topological space.
\newblock In {\em Inequalities in statistics and probability (Lincoln, Neb.,
  1982)}, pages 104--108. Inst. Math. Statist., Hayward, Calif., 1984.

\bibitem{MarOlk60a}
A.~MARSHALL and I.~OLKIN.
\newblock Multivariate {C}hebyshev inequalities.
\newblock {\em Ann. Math. Stat.}, 31:1001--1014, 1960.

\bibitem{MarOlk60b}
A.~MARSHALL and I.~OLKIN.
\newblock A one-sided inequality of the {C}hebyshev type.
\newblock {\em Ann. Math. Stat.}, 31:488--491, 1960.

\bibitem{MarOlk61}
A.~MARSHALL and I.~OLKIN.
\newblock A game theoretic proof that {C}hebyshev inequalities are sharp.
\newblock {\em Pacific. J. Math.}, 11:1421--1429, 1961.

\bibitem{MarOlk:79}
A.W. MARSHALL and I.~OLKIN.
\newblock {\em Inequalities: Theory of Majorization and its Applications}.
\newblock Academic Press, 1979.

\bibitem{Mar:94}
J.M. Martinez.
\newblock Local minimizers of quadratic functions on {E}uclidean balls and
  spheres.
\newblock {\em SIAM J. Optim.}, 4(1):159--176, 1994.

\bibitem{MR98a:49054}
A.~MATVEEV and V.A. Yakubovich.
\newblock Nonconvex problems of global optimization: linear-quadratic control
  problems with quadratic constraints.
\newblock {\em Dynam. Control}, 7(2):99--134, 1997.

\bibitem{MR58:15182}
H.~MAURER and J.~ZOWE.
\newblock Second-order necessary and sufficient optimality conditions for
  infinite-dimensional programming problems.
\newblock In {\em Optimization techniques (Proc. 8th IFIP Conf., W\"urzburg,
  1977), Part 2}, pages 13--21. Lecture Notes in Control and Information Sci.,
  Vol. 7. Springer, Berlin, 1978.

\bibitem{MR81e:90093}
H.~MAURER and J.~ZOWE.
\newblock First and second order necessary and sufficient optimality conditions
  for infinite-dimensional programming problems.
\newblock {\em Math. Programming}, 16(1):98--110, 1979.

\bibitem{Megiddo:88}
N.~MEGIDDO.
\newblock Pathways to the optimal set in linear programming.
\newblock In N.~Megiddo, editor, {\em Progress in Mathematical Programming,
  Interior Point and Related Methods}. Springer-Verlag, 1988.

\bibitem{MeR:97}
A.~MEGRETSKI and A.~RANTZER.
\newblock System analysis via integral quadratic constraints.
\newblock {\em IEEE Trans.\ Aut.\ Control}, 42(6):819--830, June 1997.

\bibitem{MR1461383}
M.~MESBAHI and G.P. PAPAVASSILOPOULOS.
\newblock A cone programming approach to the bilinear matrix inequality problem
  and its geometry.
\newblock {\em Math. Programming}, 77(2, Ser. B):247--272, 1997.

\bibitem{MR97j:93026}
M.~MESBAHI and G.P. PAPAVASSILOPOULOS.
\newblock On the rank minimization problem over a positive semidefinite linear
  matrix inequality.
\newblock {\em IEEE Trans. Automat. Control}, 42(2):239--243, 1997.

\bibitem{Mesz:97}
C.~MESZAROS.
\newblock {\em An efficient implementation of interior point methods for linear
  programming and their applications}.
\newblock PhD thesis, Eotvos Lorand University of Sciences, 1997.

\bibitem{MKT:95}
S.~MIZUNO, M.~Kojima, and M.J. Todd.
\newblock Infeasible-interior-point primal-dual potential-reduction algorithms
  for linear programming.
\newblock {\em SIAM J. Optim.}, 5:52--67, 1995.

\bibitem{MiToYe:94}
S.~MIZUNO, M.J. Todd, and Y.~YE.
\newblock On adaptive-step primal-dual interior-point algorithms for linear
  programming.
\newblock {\em Math. Oper. Res.}, 18(4):964--981, 1993.

\bibitem{Mockus:96}
J.~MOCKUS, L.~MOCKUS, and A.~MOCKUS.
\newblock Bayesian approach to combinatorial optimization.
\newblock Technical report, School of Engineering, Purdue University, W.
  Lafayette, IN, 1996.

\bibitem{Mont:95}
R.D.C. Monteiro.
\newblock Primal-dual path-following algorithms for semidefinite programming.
\newblock {\em SIAM J. Optim.}, 7(3):663--678, 1997.

\bibitem{Mont:98}
R.D.C. Monteiro.
\newblock Polynomial convergence of primal-dual algorithms for semidefinite
  programming based on the {Monteiro and Zhang} family of directions.
\newblock {\em SIAM J. Optim.}, 8:797--812, 1998.

\bibitem{MonteiroAdler:89}
R.D.C. Monteiro and I.~ADLER.
\newblock Interior path following primal-dual algorithms. {Part I: Linear
  programming}.
\newblock {\em Math. Programming}, 44:27--42, 1989.

\bibitem{MonteiroAdler:89a}
R.D.C. Monteiro and I.~ADLER.
\newblock Interior path following primal-dual algorithms. {Part II: Convex
  quadratic programming}.
\newblock {\em Math. Programming}, 44:43--66, 1989.

\bibitem{MonPan98-1}
R.D.C. Monteiro and J.-S. Pang.
\newblock On two interior-point mappings for nonlinear semidefinite
  complementarity problems.
\newblock {\em Math. Oper. Res.}, 23:39--60, 1998.

\bibitem{MonPan99-1}
R.D.C. Monteiro and J.-S. Pang.
\newblock A potential reduction {Newton} method for constrained equations.
\newblock {\em SIAM J. Optim.}, 9:729--754, 1999.

\bibitem{MT-98}
R.D.C. Monteiro and T.~TSUCHIYA.
\newblock Polynomial convergence of primal-dual algorithms for the second-order
  cone program based on the {MZ}-family of directions.
\newblock Technical report, The School of ISyE, Georgia Institute of
  Technology, Atlanta, GA 30332, USA, 1998.

\bibitem{TSUMOnt:97}
R.D.C. Monteiro and T.~TSUCHIYA.
\newblock Polynomial convergence of a new family of primal-dual algorithms for
  semidefinite programming.
\newblock {\em SIAM J. Optim.}, 9(3):551--577 (electronic), 1999.

\bibitem{MoTu:96}
R.D.C. Monteiro and T.~TSUCHIYA.
\newblock Polynomiality of primal-dual algorithms for semidefinite linear
  complementarity problems based on the {Kojima-Shindoh-Hara} family of
  directions.
\newblock {\em Math. Programming}, 84:39--53, 1999.

\bibitem{MontZanj:97}
R.D.C. Monteiro and P.R. ZANJ{\'A}COMO.
\newblock Implementation of primal-dual methods for semidefinite programming
  based on {M}onteiro and {T}suchiya {N}ewton directions and their variants.
\newblock Technical report, Georgia Tech, Atlanta, GA, 1997.

\bibitem{MontZanj:96}
R.D.C. Monteiro and P.R. ZANJ{\'A}COMO.
\newblock A note on the existence of the {A}lizadeh-{H}aeberly-{O}verton
  direction for semidefinite programming.
\newblock {\em Math. Programming}, 78(3, Ser. A):393--396, 1997.

\bibitem{MontZhang:96}
R.D.C. Monteiro and Y.~Zhang.
\newblock A unified analysis for a class of long-step primal-dual
  path-following interior-point algorithms for semidefinite programming.
\newblock {\em Math. Programming}, 81(3, Ser. A):281--299, 1998.

\bibitem{Moo:79}
R.E. MOORE.
\newblock {\em Methods and Applications of Interval Analysis}.
\newblock {SIAM}, Philadelphia, 1979.

\bibitem{More:93}
J.J. Mor\'{e}.
\newblock Generalizations of the trust region problem.
\newblock {\em Optim. Methods Software}, 2:189--209, 1993.

\bibitem{MoSO:79}
J.J. Mor\'{e} and D.C. Sorensen.
\newblock On the use of directions of negative curvature in a modified {N}ewton
  method.
\newblock {\em Math. Programming}, 16:1--20, 1979.

\bibitem{MoSo:83}
J.J. Mor\'{e} and D.C. Sorensen.
\newblock Computing a trust region step.
\newblock {\em SIAM J. Sci. Statist. Comput.}, 4:553--572, 1983.

\bibitem{MoSo:82b}
J.J. Mor\'{e} and D.C. Sorensen.
\newblock {N}ewton's method.
\newblock In Gene~H. Golub, editor, {\em Studies in Numerical Analysis},
  volume~24 of {\em MAA Studies in Mathematics}. The Mathematical Association
  of America, 1984.

\bibitem{MoreWu:96}
J.J. Mor\'{e} and Z.~Wu.
\newblock Global continuation for distance geometry problems.
\newblock {\em SIAM J. Optim.}, 7(3):814--836, 1997.

\bibitem{MoreWu:97}
J.J. MOR\'{E} and Z.~WU.
\newblock Distance geometry optimization for protein structures.
\newblock {\em J. Global Optim.}, 15(3):219--234, 1999.

\bibitem{MoshZib:99}
L.~MOSHEYEV and M.~ZIBULEVSKY.
\newblock Penalty/barrier multiplier algorithm for semidefinite programming.
\newblock Technical report, Technion, Haifa, Israel, 1999.

\bibitem{MVZ}
J.M. MULVEY, R.J. Vanderbei, and S.A. ZENIOS.
\newblock Robust optimization of large-scale systems.
\newblock {\em Operations Research}, 43:264--281, 1995.

\bibitem{MR1622879}
M.~Muramatsu.
\newblock Affine scaling algorithm fails for semidefinite programming.
\newblock {\em S\=urikaisekikenky\=usho K\=oky\=uroku}, 1004:128--137, 1997.
\newblock Linear matrix inequalities and positive semidefinite programming
  (Japanese) (Kyoto, 1996).

\bibitem{Muramatsu:96}
M.~Muramatsu.
\newblock Affine scaling algorithm fails for semidefinite programming.
\newblock {\em Math. Programming}, 83(3, Ser. A):393--406, 1998.

\bibitem{MurVan:96}
M.~Muramatsu and R.J. Vanderbei.
\newblock Primal-dual affine-scaling algorithms fail for semidefinite
  programming.
\newblock Technical report, SOR, Princeton University, Princeton, NJ, 1997.

\bibitem{MK87}
K.G. MURTY and S.N. KABADI.
\newblock Some {NP}-complete problems in quadratic and nonlinear programming.
\newblock {\em Math. Programming}, 39:117--129, 1987.

\bibitem{MR99d:15018}
G.~N{\AE}VDAL and H.J. WOERDEMAN.
\newblock Cone inclusion numbers.
\newblock {\em SIAM J. Matrix Anal. Appl.}, 19(3):613--639, 1998.

\bibitem{NO96a}
M.V. NAYAKKANKUPPAM and M.L. Overton.
\newblock Primal--dual interior--point methods for semidefinite programming.
\newblock In {\em Proceedings of the IEEE International Symposium on
  Computer--Aided Control System Design}, pages 235--239. IEEE Control Systems
  Society, September 1996.

\bibitem{NO97a}
M.V. NAYAKKANKUPPAM and M.L. Overton.
\newblock Conditioning of semidefinite programs.
\newblock Technical report, Courant Institute of Mathematical Sciences, NYU,
  New York, NY, March 1997.

\bibitem{NW88}
G.L. NEMHAUSER and L.A. WOLSEY.
\newblock {\em Integer and Combinatorial Optimization}.
\newblock John Wiley \& Sons, New York, NY, 1988.

\bibitem{NemRoosTerl:98}
A.~Nemirovski, C.~Roos, and T.~Terlaky.
\newblock On maximization of quadratic form over intersection of ellipsoids
  with common center.
\newblock {\em Math. Program.}, 86(3, Ser. A):463--473, 1999.

\bibitem{MR1461381}
A.S. Nemirovski.
\newblock The long-step method of analytic centers for fractional problems.
\newblock {\em Math. Programming}, 77(2, Ser. B):191--224, 1997.

\bibitem{Nemirovski:97}
A.S. Nemirovski.
\newblock On normal self-concordant barriers and long-step interior point
  methods.
\newblock Technical report, Faculty of Industrial Engineering, Institute of
  Technology, Technion, Haifa, ISRAEL, 1997.

\bibitem{Nemi:97}
A.S. Nemirovski.
\newblock Private communication.
\newblock Technical report, Faculty of Industrial Engineering, Institute of
  Technology, Technion, Haifa, ISRAEL, 1997.

\bibitem{NS-96}
A.S. Nemirovski and K.~Scheinberg.
\newblock Extension of {K}armarkar's algorithm onto convex quadratically
  constrained quadratic programming.
\newblock {\em Math. Programming}, 72:273--289, 1996.

\bibitem{MR99a:90144}
Y.~Nesterov.
\newblock Semidefinite relaxation and nonconvex quadratic optimization.
\newblock {\em Optim. Methods Softw.}, 9(1-3):141--160, 1998.

\bibitem{Nesterov:97}
Y.E. Nesterov.
\newblock Long-step strategies in interior-point primal-dual methods.
\newblock {\em Math. Programming}, 76:47--94, 1997.

\bibitem{Nest:97}
Y.E. Nesterov.
\newblock Quality of semidefinite relaxation for nonconvex quadratic
  optimization.
\newblock Technical report, CORE, Universite Catholique de Louvain, Belgium,
  1997.

\bibitem{nesterov97}
Y.E. Nesterov.
\newblock Structure of non-negative polynomial and optimization problems.
\newblock Technical report, Louvan-la-Neuve, Belgium, 1997.
\newblock Preprint DP 9749.

\bibitem{Nest:98b}
Y.E. Nesterov.
\newblock Global quadratic optimization via conic relaxation.
\newblock Technical report, CORE, Universite Catholique de Louvain, Belgium,
  1998.

\bibitem{Nest:98}
Y.E. Nesterov.
\newblock Semidefinite relaxation and nonconvex quadratic optimization.
\newblock {\em Optim. Methods Softw.}, 9:141--160, 1998.
\newblock Special Issue Celebrating the 60th Birthday of Professor Naum Shor.

\bibitem{NeN:88}
Y.E. Nesterov and A.S. Nemirovski.
\newblock A general approach to polynomial-time algorithms design for convex
  programming.
\newblock Technical report, Centr. Econ. \& Math. Inst., USSR Acad. Sci.,
  Moscow, USSR, 1988.

\bibitem{MR89k:90130}
Y.E. Nesterov and A.S. Nemirovski.
\newblock Polynomial barrier methods in convex programming.
\newblock {\em \`Ekonom. i Mat. Metody}, 24(6):1084--1091, 1988.

\bibitem{int:Nesterov4}
Y.E. Nesterov and A.S. Nemirovski.
\newblock Self--concordant functions and polynomial--time methods in convex
  programming.
\newblock {Book--Preprint}, Central Economic and Mathematical Institute, USSR
  Academy of Science, Moscow, USSR, 1989.
\newblock Published in Nesterov and Nemirovsky \cite{int:Nesterov5}.

\bibitem{NeN:90b}
Y.E. Nesterov and A.S. Nemirovski.
\newblock {\em Optimization over positive semidefinite matrices: {M}athematical
  background and user's manual}.
\newblock USSR Acad. Sci. Centr. Econ. \& Math. Inst., 32 Krasikova St.,
  Moscow~117418 USSR, 1990.

\bibitem{NeN:90}
Y.E. Nesterov and A.S. Nemirovski.
\newblock Self-concordant functions and polynomial time methods in convex
  programming.
\newblock Technical report, Centr. Econ. \& Math. Inst., USSR Acad. Sci.,
  Moscow, USSR, April 1990.

\bibitem{NeN:91}
Y.E. Nesterov and A.S. Nemirovski.
\newblock Conic formulation of a convex programming problem and duality.
\newblock Technical report, Centr. Econ. \& Math. Inst., USSR Academy of
  Sciences, Moscow USSR, 1991.

\bibitem{nem92}
Y.E. Nesterov and A.S. Nemirovski.
\newblock Conic duality and its applications in convex programming.
\newblock {\em Optim. Methods Softw.}, 1:95--115, 1992.

\bibitem{int:Nesterov5}
Y.E. Nesterov and A.S. Nemirovski.
\newblock {\em Interior Point Polynomial Algorithms in Convex Programming}.
\newblock SIAM Publications. SIAM, Philadelphia, USA, 1994.

\bibitem{nem}
Y.E. Nesterov and A.S. Nemirovski.
\newblock An interior-point method for generalized linear-fractional
  programming.
\newblock {\em Math. Programming}, 69(1):177--204, 1995.

\bibitem{MR99a:90192}
Y.E. Nesterov and A.S. Nemirovski.
\newblock Multi-parameter surfaces of analytic centers and long-step
  surface-following interior point methods.
\newblock {\em Math. Oper. Res.}, 23(1):1--38, 1998.

\bibitem{nem99}
Y.E. Nesterov and A.S. Nemirovski.
\newblock On self-concordant convex-concave functions.
\newblock {\em Optim. Methods Softw.}, 1999.
\newblock To appear.

\bibitem{NesterovTodd:97}
Y.E. Nesterov and M.J. Todd.
\newblock Self-scaled barriers and interior-point methods for convex
  programming.
\newblock {\em Math. Oper. Res.}, 22(1):1--42, 1997.

\bibitem{NesterovTodd:98}
Y.E. Nesterov and M.J. Todd.
\newblock Primal-dual interior-point methods for self-scaled cones.
\newblock {\em SIAM J. Optim.}, 8:324--364, 1998.

\bibitem{MR95b:90073}
A.~NEUMAIER.
\newblock An optimality criterion for global quadratic optimization.
\newblock {\em J. Global Optim.}, 2(2):201--208, 1992.

\bibitem{neu}
J.~VON NEUMANN.
\newblock {\em Collected Works}.
\newblock Pergamon Press, New York, 1962.
\newblock A.H.\ Traub, ed.

\bibitem{MR55:13315}
L.W. NEUSTADT.
\newblock {\em Optimization}.
\newblock Princeton University Press, Princeton, N. J., 1976.
\newblock A Theory of Necessary Conditions, With a chapter by H. T. Banks.

\bibitem{ninomora}
J.~NI{N}O-MORA.
\newblock Optimal resource allocation in a dynamic and stochastic environment:
  A mathematical programming approach.
\newblock Ph.D. Dissertation, Sloan School of Management, MIT, 1995.

\bibitem{nunezthesis}
M.A. NUNEZ.
\newblock {\em Condition Numbers and Properties of Central Trajectories in
  Convex Programming}.
\newblock PhD thesis, 1997.

\bibitem{Nunez:98}
M.A. NUNEZ.
\newblock A characterization of ill-posed data instances for convex
  programming.
\newblock Technical report, Chapman University, School of Business and
  Economics, Orange, CA, 1998.

\bibitem{OlPu:82}
I.~OLKIN and R.~PUKELSHEIM.
\newblock The distance between two random vectors with given dispersion
  matrices.
\newblock {\em Linear Algebra Appl.}, 48:257--263, 1982.

\bibitem{OrDo:72}
G.I. ORLOVA and Ya.G. DORFMAN.
\newblock Finding the maximum cut in a graph.
\newblock {\em Engrg. Cybernetics}, 10(3):502--506, 1972.

\bibitem{Ous:97a}
F.~OUSTRY.
\newblock The {${\cal U}$}-{L}agrangian of the maximum eigenvalue function.
\newblock {\em SIAM J. Optim.}, 1998.
\newblock To appear.

\bibitem{Ous:98}
F.~OUSTRY.
\newblock A second-order bundle method to minimize the maximum eigenvalue
  function.
\newblock Submitted to Math.\ Programming, February 1998.

\bibitem{Ov:88}
M.L. Overton.
\newblock On minimizing the maximum eigenvalue of a symmetric matrix.
\newblock {\em SIAM J. Matrix Anal. Appl.}, 9:256--268, 1988.

\bibitem{Ov:92}
M.L. Overton.
\newblock Large-scale optimization of eigenvalues.
\newblock {\em SIAM J. Optim.}, 2(1):88--120, 1992.

\bibitem{OvWo:96}
M.L. Overton and H.~Wolkowicz, editors.
\newblock {\em Semidefinite Programming}.
\newblock North-Holland Publishing Co., Amsterdam, 1997.
\newblock Dedicated to the memory of Svatopluk Poljak, Math. Programming {\bf
  77} (1997), no. 2, Ser. B.

\bibitem{MR90h:65036}
M.L. Overton and R.S. Womersley.
\newblock On minimizing the spectral radius of a nonsymmetric matrix function:
  optimality conditions and duality theory.
\newblock {\em SIAM J. Matrix Anal. Appl.}, 9(4):473--498, 1988.

\bibitem{OvWom:91}
M.L. Overton and R.S. Womersley.
\newblock On the sum of the largest eigenvalues of a symmetric matrix.
\newblock {\em SIAM J. Matrix Anal. Appl.}, 13(1):41--45, 1992.

\bibitem{OvWom:93copy}
M.L. Overton and R.S. Womersley.
\newblock Optimality conditions and duality theory for minimizing sums of the
  largest eigenvalues of symmetric matrices.
\newblock {\em Math. Programming}, 62(2, Ser. B):321--357, 1993.

\bibitem{ow2}
M.L. Overton and R.S. Womersley.
\newblock Second derivatives for optimizing eigenvalues of symmetric matrices.
\newblock {\em SIAM J. Matrix Anal. Appl.}, 16(3):697--718, 1995.

\bibitem{Pac:94}
A.~PACKARD.
\newblock Gain scheduling via linear fractional transformations.
\newblock {\em Syst.\ Control Letters}, 22:79--92, 1994.

\bibitem{Pad:89}
M.~W. PADBERG.
\newblock The {B}oolean quadric polytope: {S}ome characteristics, facets and
  relatives.
\newblock {\em Math. Programming}, Ser. B, 45(1):139--172, 1989.

\bibitem{patsi}
C.H. PAPADIMITRIOU and J.N. TSITSIKLIS.
\newblock The complexity of optimal queueing network control.
\newblock {\em Math. Oper. Res.}, 1, 1998.

\bibitem{papan}
F.~PAPANGELOU.
\newblock Integrability of expected increments and a related random change of
  time scale.
\newblock {\em Trans. Amer. Math. Soc.}, 165:483--506, 1972.

\bibitem{prw:93}
P.~Pardalos, F.~Rendl, and H.~Wolkowicz.
\newblock The quadratic assignment problem: a survey and recent developments.
\newblock In P.M. Pardalos and H.~Wolkowicz, editors, {\em Quadratic assignment
  and related problems (New Brunswick, NJ, 1993)}, pages 1--42. Amer. Math.
  Soc., Providence, RI, 1994.

\bibitem{PardWolk:97}
P.~Pardalos and H.~Wolkowicz, editors.
\newblock {\em Semidefinite Programming and Interior-Point Approaches for
  Combinatorial Optimization Problems}.
\newblock Kluwer Academic Publishers, Hingham, MA, 1998.
\newblock Papers from the workshop held at the University of Toronto, Toronto,
  ON, May 15--17, 1996, J. Comb. Optim. {\bf 2} (1998), no. 1.

\bibitem{PardWolk:96}
P.~Pardalos and H.~Wolkowicz, editors.
\newblock {\em Topics in Semidefinite and Interior-Point Methods}, The Fields
  Institute for Research in Mathematical Sciences, Communications Series,
  Providence, RI, 1998. American Mathematical Society.

\bibitem{P:94}
P.M. PARDALOS.
\newblock On the passage from local to global in optimization.
\newblock In {\em Mathematical Programming: State of the Art 1994}, pages
  220--247. The University of Michigan, 1994.

\bibitem{P:96}
P.M. PARDALOS.
\newblock Continuous approaches to discrete optimization problems.
\newblock In {\em Nonlinear Optimization and Applications}, pages 313--328.
  Plenum Publishing, 1996.

\bibitem{RaP:97}
P.M. PARDALOS and M.V. Ramana.
\newblock Semidefinite programming.
\newblock In {\em Interior {P}oint {M}ethods of {M}athematical {P}rogramming},
  pages 369--398. Kluwer Academic Publishers, 1997.

\bibitem{PR:97}
P.M. PARDALOS and M.G.C. RESENDE.
\newblock Interior point methods for global optimization problems.
\newblock In {\em Interior Point methods of Mathematical Programming}, pages
  467--500. Kluwer Academic Publishers, 1997.

\bibitem{PardRos87}
P.M. Pardalos and J.B. ROSEN.
\newblock {\em Constrained global optimization: Algorithms and applications},
  volume 268 of {\em Lecture Notes in Computer Science}.
\newblock Springer-Verlag, Berlin, 1987.

\bibitem{PardShallXue}
P.M. Pardalos, D.~SHALLOWAY, and G.~XUE, editors.
\newblock {\em Global minimization of nonconvex energy functions: molecular
  conformation and protein folding}, volume~23 of {\em DIMACS Series in
  Discrete Mathematics and Theoretical Computer Science}.
\newblock American Mathematical Society, Providence, RI, 1996.
\newblock Papers from the DIMACS Workshop held as part of the DIMACS Special
  Year on Mathematical Support for Molecular Biology at Rutgers University, New
  Brunswick, New Jersey, March 20--21, 1995.

\bibitem{Pard:91}
P.M. Pardalos and S.A. Vavasis.
\newblock Quadratic programming with one negative eigenvalue is {N}{P}-hard.
\newblock {\em J. Global Optim.}, 1(1):15--22, 1991.

\bibitem{GPat:94}
G.~Pataki.
\newblock On the facial structure of cone-{LP}'s and semidefinite programs.
\newblock Technical Report 595, Graduate School of Industrial Administration,
  Carnegie Mellon University, 1994.

\bibitem{MR1441799}
G.~Pataki.
\newblock Cone-{L}{P}'s and semidefinite programs: geometry and a simplex-type
  method.
\newblock In {\em Integer programming and combinatorial optimization
  (Vancouver, BC, 1996)}, volume 1084 of {\em Lecture Notes in Comput. Sci.},
  pages 162--174. Springer, Berlin, 1996.

\bibitem{Pat:96}
G.~Pataki.
\newblock {\em Cone Programming and Eigenvalue Optimization: Geometry and
  Algorithms}.
\newblock PhD thesis, Pittsburgh, PA, 1996.

\bibitem{GPat:95}
G.~Pataki.
\newblock On the rank of extreme matrices in semidefinite programs and the
  multiplicity of optimal eigenvalues.
\newblock {\em Math. Oper. Res.}, 23(2):339--358, 1998.

\bibitem{PatTun:97}
G.~Pataki and L.~Tun{\c{c}}el.
\newblock On the generic properties of convex optimization problems in conic
  form.
\newblock {\em Math. Programming}, to appear.

\bibitem{Pena:97}
J.~Pe{\~n}a.
\newblock Computing the distance to infeasibility: theoretical and practical
  issues.
\newblock Technical report, Cornell University, Ithaca,, NY, 1997.

\bibitem{PengYuan:95}
J.~Peng and Y.~Yuan.
\newblock Optimality conditions for the minimization of a quadratic with two
  quadratic constraints.
\newblock {\em SIAM J. Optim.}, 7(3):579--594, 1997.

\bibitem{MR37:3315}
A.L. PERESSINI.
\newblock {\em Ordered Topological Vector Spaces}.
\newblock Harper \& Row Publishers, New York, 1967.

\bibitem{MR37:1165}
E.L. PETERSON and J.G. ECKER.
\newblock Geometric programming: {A} unified duality theory for quadratically
  constrained quadratic programs and $l\sb{p}$-constrained
  $l\sb{p}$-approximation problems.
\newblock {\em Bull. Amer. Math. Soc.}, 74:316--321, 1968.

\bibitem{MR50:12244}
E.L. PETERSON and J.G. ECKER.
\newblock Geometric programming: duality in quadratic programming and
  $l\sb{p}$-approximation. {I}{I}. ({C}anonical programs).
\newblock {\em SIAM J. Appl. Math.}, 17:317--340, 1969.

\bibitem{MR50:12243}
E.L. PETERSON and J.G. ECKER.
\newblock Geometric programming: duality in quadratic programming and
  $l\sb{p}$-approximation. {I}.
\newblock In {\em Proceedings of the Princeton Symposium on Mathematical
  Programming (Princeton Univ., 1967)}, pages 445--480, Princeton, N.J., 1970.
  Princeton Univ. Press.

\bibitem{MR50:12245}
E.L. PETERSON and J.G. ECKER.
\newblock Geometric programming: duality in quadratic programming and
  $l\sb{p}$-approximation. {I}{I}{I}. {D}egenerate programs.
\newblock {\em J. Math. Anal. Appl.}, 29:365--383, 1970.

\bibitem{Pit91}
I.~PITOWSKI.
\newblock Correlation polytopes: their geometry and complexity.
\newblock {\em Math. Programming}, 50:395--414, 1991.

\bibitem{Pit96}
I.~PITOWSKI.
\newblock Correlation polytopes {II}: the geometry of limit laws in
  probability.
\newblock preprint, 1996.

\bibitem{pr2:92}
S.~POLJAK and F.~RENDL.
\newblock Nonpolyhedral relaxations of graph-bisection problems.
\newblock {\em SIAM J. Optim.}, 5(3), 1995.
\newblock 467-487.

\bibitem{PoReWo:94}
S.~Poljak, F.~Rendl, and H.~Wolkowicz.
\newblock A recipe for semidefinite relaxation for $(0,1)$-quadratic
  programming.
\newblock {\em J. Global Optim.}, 7(1):51--73, 1995.

\bibitem{PoljakT94}
S.~POLJAK and Z.~TUZA.
\newblock On the relative error of the polyhedral approximation of the max-cut
  problem.
\newblock {\em Operations Research Letters}, 16:191--198, 1994.

\bibitem{PoTu:95}
S.~POLJAK and Z.~TUZA.
\newblock The max-cut problem- a survey.
\newblock In {\em Special Year on Combinatorial Optimization, DIMACS series in
  Discrete Mathematics and Theoretical Computer Science}. AMS, 1995.

\bibitem{PoWo:93}
S.~Poljak and H.~Wolkowicz.
\newblock Convex relaxations of $(0,1)$-quadratic programming.
\newblock {\em Math. Oper. Res.}, 20(3):550--561, 1995.

\bibitem{PorkKhach:95}
L.~PORKOLAB and L.~KHACHIYAN.
\newblock On the complexity of semidefinite programs.
\newblock {\em J. Global Optim.}, 10(4):351--365, 1997.

\bibitem{KP-96}
L.~PORKOLAB and L.~KHACHIYAN.
\newblock Testing the feasibility of semidefinite programs.
\newblock In P.~Pardalos and H.~Wolkowicz, editors, {\em Topics in Semidefinite
  and Interior-Point Methods (Toronto, ON, 1996)}, pages 17--26. Amer. Math.
  Soc., Providence, RI, 1998.

\bibitem{PorJud:94}
L.~PORTUGAL and J.~JUDICE.
\newblock A hybrid algorithm for the solution of a single commodity spatial
  equilibrium model.
\newblock Technical report, Universidade de Coimbra, Coimbra, Portugal, 1994.

\bibitem{PotShe:95}
F.A. Potra and R.~Sheng.
\newblock A superlinearly convergent primal-dual infeasible-interior-point
  algorithm for semidefinite programming.
\newblock Technical Report Reports on Computational Mathematics, 78, University
  of Iowa, Iowa City, IA, 1995.

\bibitem{PoSh:98}
F.A. Potra and R.~Sheng.
\newblock On homogeneous interior-point algorithms for semidefinite
  programming.
\newblock {\em Optim. Methods Softw.}, 9:161--184, 1998.
\newblock Special Issue Celebrating the 60th Birthday of Professor Naum Shor.

\bibitem{Pow:97}
M.~J.~D. Powell.
\newblock The use of band matrices for second derivative approximations in
  trust region algorithms.
\newblock In {\em Advances in nonlinear programming (Beijing, 1996)}, pages
  3--28. Kluwer Acad. Publ., Dordrecht, 1998.

\bibitem{powell2}
M.J.D. Powell.
\newblock Trust region calculations revisited.
\newblock Report DAMTP 1997/NA18, Cambridge University, 1997.
\newblock Presented at the 17th Biennial Conference on Numerical Analysis
  (Dundee).

\bibitem{Prekopa93}
A.~PREKOPA.
\newblock Bounds on probabilities and expectations using multivariate moments
  of discrete distributions.
\newblock RUTCOR Research Report, 1993.

\bibitem{Puk:93}
F.~PUKELSHEIM.
\newblock {\em Optimal Design of Experiments}.
\newblock Wiley Series in Probability and Mathematical Statistics: Probability
  and Mathematical Statistics. John Wiley \& Sons Inc., New York, 1993.
\newblock A Wiley-Interscience Publication.

\bibitem{PyS:82}
E.~S. PYATNITSKII and V.~I. SKORODINSKII.
\newblock Numerical methods of {L}yapunov function construction and their
  application to the absolute stability problem.
\newblock {\em Syst.\ Control Letters}, 2(2):130--135, August 1982.

\bibitem{QuistKlerkRoosTerlaky:97}
A.J. QUIST, E.~de~Klerk, C.~Roos, and T.~Terlaky.
\newblock Copositive relaxation for general quadratic programming.
\newblock {\em Optim. Methods Softw.}, 9:185--208, 1998.
\newblock Special Issue Celebrating the 60th Birthday of Professor Naum Shor.

\bibitem{MR95j:90062}
P.~RAGHAVAN.
\newblock Randomized approximation algorithms in combinatorial optimization.
\newblock In {\em Foundations of software technology and theoretical computer
  science (Madras, 1994)}, volume 880 of {\em Lecture Notes in Comput. Sci.},
  pages 300--317. Springer, Berlin, 1994.

\bibitem{Ram:93}
M.V. Ramana.
\newblock {\em An Algorithmic Analysis of Multiquadratic and Semidefinite
  Programming Problems}.
\newblock PhD thesis, Johns Hopkins University, Baltimore, Md, 1993.

\bibitem{Ram:95}
M.V. Ramana.
\newblock An exact duality theory for semidefinite programming and its
  complexity implications.
\newblock {\em Math. Programming}, 77(2):129--162, 1997.

\bibitem{RaGo:94}
M.V. Ramana and A.J. Goldman.
\newblock Some geometric results in semidefinite programming.
\newblock {\em J. Global Optim.}, 7(1):33--50, 1995.

\bibitem{int:Ramana2}
M.V. Ramana and P.M. PARDALOS.
\newblock Semidefinite programming.
\newblock In T.~Terlaky, editor, {\em Interior Point Methods of Mathematical
  programming}, pages 369--398, Dordrecht, The Netherlands, 1996. Kluwer.

\bibitem{RaTuWo:95}
M.V. Ramana, L.~Tun{\c{c}}el, and H.~Wolkowicz.
\newblock Strong duality for semidefinite programming.
\newblock {\em SIAM J. Optim.}, 7(3):641--662, 1997.

\bibitem{Ran:96}
A.~RANTZER.
\newblock On the {Kalman}-{Yakubovich}-{Popov} {L}emma.
\newblock {\em Syst.\ Control Letters}, 28(1):7--10, 1996.

\bibitem{Rendl:97}
F.~Rendl.
\newblock Semidefinite programming and combinatorial optimization.
\newblock {\em Appl. Numer. Math.}, 29:255--281, 1999.

\bibitem{ReVaWo:93b}
F.~Rendl, R.~J. Vanderbei, and H.~Wolkowicz.
\newblock Max-min eigenvalue problems, primal-dual interior point algorithms,
  and trust region subproblems.
\newblock {\em Optim. Methods Softw.}, 5:1--16, 1995.

\bibitem{ReWo:89}
F.~Rendl and H.~Wolkowicz.
\newblock Applications of parametric programming and eigenvalue maximization to
  the quadratic assignment problem.
\newblock {\em Math. Programming}, 53(1, Ser. A):63--78, 1992.

\bibitem{ReWo:90}
F.~Rendl and H.~Wolkowicz.
\newblock A projection technique for partitioning the nodes of a graph.
\newblock {\em Ann. Oper. Res.}, 58:155--179, 1995.
\newblock Applied mathematical programming and modeling, II (APMOD 93)
  (Budapest, 1993).

\bibitem{ReWo:94}
F.~Rendl and H.~Wolkowicz.
\newblock A semidefinite framework for trust region subproblems with
  applications to large scale minimization.
\newblock {\em Math. Programming}, 77(2, Ser. B):273--299, 1997.

\bibitem{MR89b:90130}
J.~Renegar.
\newblock A polynomial-time algorithm, based on {N}ewton's method, for linear
  programming.
\newblock {\em Math. Programming}, 40(1 (Ser. A)):59--93, 1988.

\bibitem{Renegar:92}
J.~Renegar.
\newblock On the computational complexity and geometry of the first-order
  theory of the reals. {I}{I}{I}. {Q}uantifier elimination.
\newblock {\em J. Symbolic Comput.}, 13(3):329--352, 1992.

\bibitem{MR1246132}
J.~Renegar.
\newblock Ill-posed problem instances.
\newblock In {\em From Topology to Computation: Proceedings of the Smalefest
  (Berkeley, CA, 1990)}, pages 340--358, New York, 1993. Springer.

\bibitem{MR95d:65116}
J.~Renegar.
\newblock Is it possible to know a problem instance is ill-posed? {S}ome
  foundations for a general theory of condition numbers.
\newblock {\em J. Complexity}, 10(1):1--56, 1994.

\bibitem{Ren:94}
J.~Renegar.
\newblock Some perturbation theory for linear programming.
\newblock {\em Math. Programming}, 65(1, Ser. A):73--91, 1994.

\bibitem{MR96c:90048}
J.~Renegar.
\newblock Incorporating condition measures into the complexity theory of linear
  programming.
\newblock {\em SIAM J. Optim.}, 5(3):506--524, 1995.

\bibitem{MR96i:90029}
J.~Renegar.
\newblock Linear programming, complexity theory and elementary functional
  analysis.
\newblock {\em Math. Programming}, 70(3, Ser. A):279--351, 1995.

\bibitem{MR97g:90134}
J.~Renegar.
\newblock Condition numbers, the barrier method, and the conjugate-gradient
  method.
\newblock {\em SIAM J. Optim.}, 6(4):879--912, 1996.

\bibitem{MR1634197}
J.~Renegar.
\newblock Recent progress on the complexity of the decision problem for the
  reals.
\newblock In {\em Quantifier elimination and cylindrical algebraic
  decomposition (Linz, 1993)}, pages 220--241. Springer, Vienna, 1998.

\bibitem{MR93a:90038}
J.~Renegar and M.~SHUB.
\newblock Unified complexity analysis for {N}ewton {L}{P} methods.
\newblock {\em Math. Programming}, 53(1, Ser. A):1--16, 1992.

\bibitem{MR97f:65002}
J.~Renegar, M.~SHUB, and S.~SMALE, editors.
\newblock {\em The Mathematics of Numerical Analysis}, Providence, RI, 1996.
  American Mathematical Society.

\bibitem{DeSh:82}
G.~DELLA RICCIA and A.~Shapiro.
\newblock Minimum rank and minimum trace of covariance matrices.
\newblock {\em Psychometrika}, 47:443--448, 1982.

\bibitem{rob76b}
S.~M. Robinson.
\newblock First order conditions for general nonlinear optimization.
\newblock {\em SIAM Journal on Applied Mathematics}, 30:597--607, 1976.

\bibitem{rob76}
S.~M. Robinson.
\newblock Regularity and stability for convex multivalued functions.
\newblock {\em Math. Oper. Res.}, 1:130--143, 1976.

\bibitem{MR84d:90084}
S.~M. Robinson.
\newblock Generalized equations and their solutions. {I}{I}. {A}pplications to
  nonlinear programming.
\newblock {\em Math. Programming Stud.}, 19:200--221, 1982.
\newblock Optimality and stability in mathematical programming.

\bibitem{robinson}
S.M. ROBINSON.
\newblock An application of error bounds for convex programming in a linear
  space.
\newblock {\em SIAM J.\ Contr.}, 13:271--273, 1975.

\bibitem{rob76a}
S.M. Robinson.
\newblock Stability theorems for systems of inequalities, part ii:
  differentiable nonlinear systems.
\newblock {\em SIAM J. Numerical Analysis}, 13:497--513, 1976.

\bibitem{Rocka:74}
R.T. Rockafellar.
\newblock {\em Conjugate Duality and Optimization}.
\newblock SIAM, Philadelphia, PA, 1974.
\newblock Regional Conference Series in Applied Mathematics.

\bibitem{Rocka:70}
R.T. Rockafellar.
\newblock {\em Convex analysis}.
\newblock Princeton Landmarks in Mathematics. Princeton University Press,
  Princeton, NJ, 1997.
\newblock Reprint of the 1970 original, Princeton Paperbacks.

\bibitem{Roh:89}
J.~ROHN.
\newblock Systems of linear interval equations.
\newblock {\em Linear Algebra Appl.}, 126:39--78, 1989.

\bibitem{Roh:97}
J.~ROHN.
\newblock Overestimations in bounding solutions of perturbed linear equations.
\newblock {\em Linear Algebra Appl.}, 262:55--66, September 1997.

\bibitem{int:Roos}
K.~ROOS, T.~Terlaky, and J.-Ph. VIAL.
\newblock {\em Theory and Algorithms for Linear Optimization: An interior Point
  Approach}.
\newblock John Wiley \& Sons, New York, 1997.

\bibitem{Ross:98}
A.M. ROSS.
\newblock Optimization over cones: {SDP}pack versus {SeDuMi}.
\newblock Technical report, 1998.

\bibitem{ross76}
S.~ROSS.
\newblock Options and efficiency.
\newblock {\em Quarterly Journal of Economics}, 90:75--89, 1976.

\bibitem{Rota}
G.-C. ROTA.
\newblock Twelve problems in probability no one likes to bring up.
\newblock The Fubini Lectures, Torino, June 3-5, 1998.

\bibitem{Rothaus:60}
O.S. ROTHAUS.
\newblock Domains of positivity.
\newblock {\em Abh. Math. Sem. Univ. Hamburg}, 24:189--235, 1960.

\bibitem{Rubin94}
M.~RUBINSTEIN.
\newblock Implied binomial trees.
\newblock {\em J. Finance}, 49(3):771--819, 1994.

\bibitem{Saad92}
Y.~SAAD.
\newblock {\em Numerical Methods for Large Eigenvalue Problems}.
\newblock Halsted Press, New York, 1992.

\bibitem{Saf:82}
M.G. SAFONOV.
\newblock Stability margins of diagonally perturbed multivariable feedback
  systems.
\newblock {\em IEE Proc.}, 129-D(6):251--256, November 1982.

\bibitem{Sor:95}
S.A. Santos and D.C. Sorensen.
\newblock A new matrix-free algorithm for the large-scale trust-region
  subproblem.
\newblock Technical Report TR95-20, Rice University, Houston, TX, 1995.

\bibitem{sz}
R.W.H.\ SARGENT and X.\ ZHANG.
\newblock An interior-point algorithm for general nonlinear complementarity
  problems and nonlinear programs.
\newblock Report, Centre for Process Systems Engineering, Imperial College,
  London, 1998.

\bibitem{Scarf58}
H.~SCARF.
\newblock A min-max solution of an inventory problem.
\newblock In {\em Studies in the mathematical theory of inventory and
  production}, pages 201--209, Stanford University Press, Stanford, CA, 1958.
  K.J. Arrow and S. Karlin and H. Scarf, eds.

\bibitem{MR83g:90075}
S.~SCHAIBLE and W.T. ZIEMBA, editors.
\newblock {\em Generalized Concavity in Optimization and Economics}, New York,
  1981. Academic Press Inc. [Harcourt Brace Jovanovich Publishers].

\bibitem{Sch:96}
C.~SCHERER.
\newblock Mixed {$H_2$/$H_\infty$} control for time-varying and linear
  para\-metrically-varying systems.
\newblock {\em Int.\ J.\ Robust and Nonlinear Control}, 6(9/10):929--952,
  Nov--Dec 1996.

\bibitem{Sch:96a}
C.~SCHERER.
\newblock Robust generalized ${H}_2$ control for uncertain and {LPV} systems
  with general scalings.
\newblock In {\em Proc.\ IEEE Conf.\ on Decision and Control}, pages
  3970--3975, December 1996.

\bibitem{SA-99b}
S.H. SCHMIETA and F.~Alizadeh.
\newblock Extension of commutative class of primal-dual interior point
  algorithms to symmetric cones.
\newblock Technical Report RRR 13-99, {RUTCOR, Rutgers University}, {640
  Bartholomew Road, Piscataway, NJ 08854-8803}, July 1999.
\newblock {Available at URL: {\tt
  ftp://rutcor.rutgers.edu/pub/rrr/reports99/13.ps}}.

\bibitem{SZ:92}
H.~SCHRAMM and J.~ZOWE.
\newblock A version of the bundle idea for minimizing a nonsmooth function:
  Conceptual idea, convergence analysis, numerical results.
\newblock {\em SIAM J. Optim.}, 2:121--152, 1992.

\bibitem{Sch:79}
A.~SCHRIJVER.
\newblock A comparison of the {D}elsarte and {L}ov{\'{a}}sz bounds.
\newblock {\em IEEE Trans. Infor. Theory}, IT-25:425--429, 1979.

\bibitem{SeifiTuncel:98}
A.~SEIFI and L.~TUN{\c{C}}EL.
\newblock A constant-potential infeasible-start interior-point algorithm with
  computational experiments and applications.
\newblock {\em Comput. Optim. Appl.}, 9:107--152, 1998.

\bibitem{SSL79}
S.~SENGUPTA, W.~SIU, and N.C. LIND.
\newblock A linear programming formulation of the problem of moments.
\newblock {\em Z. Angew. Math. Mecg.}, 10:533--537, 1979.

\bibitem{ShA:90}
J.~S. SHAMMA and M.~ATHANS.
\newblock Analysis of gain scheduled control for nonlinear plants.
\newblock {\em IEEE Trans.\ Aut.\ Control}, 35(8):898--907, August 1990.

\bibitem{ShA:92}
J.~S. SHAMMA and M.~ATHANS.
\newblock Gain scheduling: Potential hazards and possible remedies.
\newblock {\em IEEE Control Syst.\ Mag.}, pages 101--107, June 1992.

\bibitem{shyao}
J.G. SHANTHIKUMAR and D.D. YAO.
\newblock Multiclass queueing systems: Polymatroidal structure and optimal
  scheduling control.
\newblock {\em Oper. Res.}, 40:S293--299, 1992.

\bibitem{Shap:82}
A.~Shapiro.
\newblock Rank-reducibility of a symmetric matrix and sampling theory of
  minimum trace factor analysis.
\newblock {\em Psycometrika}, 47:187--199, 1982.

\bibitem{Shap:82a}
A.~Shapiro.
\newblock Weighted minimum trace factor analysis.
\newblock {\em Psycometrika}, 47:243--263, 1982.

\bibitem{Shap:83}
A.~Shapiro.
\newblock On the unsolvability of inverse eigenvalues problems almost
  everywhere.
\newblock {\em Linear Algebra Appl.}, 49:27--31, 1983.

\bibitem{Shap:85}
A.~Shapiro.
\newblock Extremal problems on the set of nonnegative definite matrices.
\newblock {\em Linear Algebra Appl.}, 67:7--18, 1985.

\bibitem{Shap:94b}
A.~Shapiro.
\newblock First and second order analysis of nonlinear semidefinite programs.
\newblock {\em Math. Programming}, 77:301--320, 1997.

\bibitem{Shap:94c}
A.~Shapiro.
\newblock On uniqueness of {L}agrange multipliers in optimization problems
  subject to cone constraints.
\newblock {\em SIAM J. Optim.}, 7(2):508--518, 1997.

\bibitem{MR93m:90086}
A.~Shapiro and J.~F. Bonnans.
\newblock Sensitivity analysis of parametrized programs under cone constraints.
\newblock {\em SIAM J. Control Optim.}, 30(6):1409--1422, 1992.

\bibitem{ShapBoth:88}
A.~Shapiro and J.D. BOTHA.
\newblock Dual algorithms for orthogonal {P}rocrustes rotations.
\newblock {\em SIAM J. Matrix Anal. Appl.}, 9(3):378--383, 1988.

\bibitem{Shap:94}
A.~Shapiro and M.K.H. FAN.
\newblock On eigenvalue optimization.
\newblock {\em SIAM J. Optim.}, 5:552--569, 1995.

\bibitem{PotShe:97}
R.~Sheng and F.A. Potra.
\newblock Nonsymmetric search directions for semidefinite programming.
\newblock Technical report, University of Iowa, Iowa City, IA, 1997.

\bibitem{Sheppard}
W.F. SHEPPARD.
\newblock On the calculation of the double integral expressing normal
  correlation.
\newblock {\em Trans. Cambr. Phil. Soc.}, 19:23--66, 1900.

\bibitem{MR91k:90116}
H.D. Sherali and W.P. Adams.
\newblock A hierarchy of relaxations between the continuous and convex hull
  representations for zero-one programming problems.
\newblock {\em SIAM J. Discrete Math.}, 3(3):411--430, 1990.

\bibitem{MR95c:90078}
H.D. Sherali and W.P. Adams.
\newblock A hierarchy of relaxations and convex hull characterizations for
  mixed-integer zero-one programming problems.
\newblock {\em Discrete Appl. Math.}, 52(1):83--106, 1994.

\bibitem{ShAd:96}
H.D. Sherali and W.P. Adams.
\newblock Computational advances using the reformulation-linearization
  technique (rlt) to solve discrete and continuous nonconvex problems.
\newblock {\em Optima}, 49:1--6, 1996.

\bibitem{MR1682748}
H.D. Sherali and W.P. Adams.
\newblock {\em A reformulation-linearization technique for solving discrete and
  continuous nonconvex problems}.
\newblock Kluwer Academic Publishers, Dordrecht, 1999.

\bibitem{MR95b:90055}
H.D. Sherali and A.~ALAMEDDINE.
\newblock A new reformulation-linearization technique for bilinear programming
  problems.
\newblock {\em J. Global Optim.}, 2(4):379--410, 1992.

\bibitem{MR1657057}
H.D. Sherali, R.S. KRISHNAMURTHY, and F.A. AL-KHAYYAl.
\newblock Enumeration approach for linear complementarity problems based on a
  reformulation-linearization technique.
\newblock {\em J. Optim. Theory Appl.}, 99(2):481--507, 1998.

\bibitem{MR97d:90077}
H.D. Sherali and Y.~Lee.
\newblock Tighter representations for set partitioning problems.
\newblock {\em Discrete Appl. Math.}, 68(1-2):153--167, 1996.

\bibitem{MR95m:90071}
H.D. Sherali, Y.~Lee, and W.P. Adams.
\newblock A simultaneous lifting strategy for identifying new classes of facets
  for the {B}oolean quadric polytope.
\newblock {\em Oper. Res. Lett.}, 17(1):19--26, 1995.

\bibitem{MR95e:90101}
H.D. Sherali and C.~H. TUNCBILEK.
\newblock A global optimization algorithm for polynomial programming problems
  using a reformulation-linearization technique.
\newblock {\em J. Global Optim.}, 2(1):101--112, 1992.
\newblock Conference on Computational Methods in Global Optimization, I
  (Princeton, NJ, 1991).

\bibitem{MR96d:90075}
H.D. Sherali and C.~H. TUNCBILEK.
\newblock A reformulation-convexification approach for solving nonconvex
  quadratic programming problems.
\newblock {\em J. Global Optim.}, 7(1):1--31, 1995.

\bibitem{MR99f:90061}
H.D. Sherali and C.~H. TUNCBILEK.
\newblock New reformulation linearization/convexification relaxations for
  univariate and multivariate polynomial programming problems.
\newblock {\em Oper. Res. Lett.}, 21(1):1--9, 1997.

\bibitem{KoShShi:96a}
M.~Shida, S.~Shindoh, and M.~Kojima.
\newblock Existence and uniqueness of search directions in interior-point
  algorithms for the {SDP} and monotone {SDLCP}.
\newblock {\em SIAM J. Optim.}, 8:387--396, 1998.

\bibitem{ShoTam}
J.A. SHOHAT and J.D. TAMARKIN.
\newblock {\em The {P}roblem of {M}oments}.
\newblock American Mathematical Society, New York, 1943.
\newblock American Mathematical Society Mathematical surveys, vol. II.

\bibitem{MR91m:90111}
N.~Z. Shor.
\newblock Dual quadratic estimates in polynomial and {B}oolean programming.
\newblock {\em Ann. Oper. Res.}, 25(1-4):163--168, 1990.
\newblock Computational methods in global optimization.

\bibitem{MR94k:90166}
N.~Z. Shor.
\newblock Dual estimates in multiextremal problems.
\newblock {\em J. Global Optim.}, 2(4):411--418, 1992.

\bibitem{Sho:87}
N.Z. Shor.
\newblock Quadratic optimization problems.
\newblock {\em Izv. Akad. Nauk SSSR Tekhn. Kibernet.}, 222(1):128--139, 222,
  1987.

\bibitem{MR96h:05194}
N.Z. Shor and O.A. BEREZOVSK{\u{I}}.
\newblock New algorithms for solving a weighted problem on the maximum cut of a
  graph.
\newblock {\em Kibernet. Sistem. Anal.}, 2:100--106, 187, 1995.

\bibitem{MR86k:90110}
N.Z. Shor and A.S. DAVYDOV.
\newblock A method of obtaining estimates in quadratic extremal problems with
  {B}oolean variables.
\newblock {\em Kibernetika (Kiev)}, 2:48--50, 54, 131, 1985.

\bibitem{MR88f:90128}
N.Z. Shor and S.I. STETSENKO.
\newblock Extremal spectral problems on classes of symmetric matrices and
  combinatorial problems.
\newblock {\em Kibernet. i Vychisl. Tekhn.}, 69:8--15, 113, 1986.

\bibitem{ssb}
G.A. SHULTZ, R.B. Schnabel, and R.H. BYRD.
\newblock A family of trust-region based algorithms for unconstrained
  optimization with strong global convergence properties.
\newblock {\em SIAM J. Numer. Anal.}, 22(1):47--67, 1985.

\bibitem{DeRi:92}
C.~DE SIMONE and G.~RINALDI.
\newblock A cutting plane algorithm for the max cut problem.
\newblock Technical report, Istituto di Analisi dei Sistemi ed Informatica del
  CNR, Rome, 1992.

\bibitem{Sip96}
M.~SIPSER.
\newblock {\em Introduction to the Theory of Computation}.
\newblock PWS, Boston, MA, 1996.

\bibitem{Skutella99}
M.~SKUTELLA.
\newblock Convex quadratic and semidefinite programming relaxations in
  scheduling.
\newblock Technical report, Technische Universitat Berlin, Berlin, Germany,
  1999.
\newblock manuscript.

\bibitem{Smi95}
J.~SMITH.
\newblock Generalized {C}hebyshev inequalities: theory and applications in
  decision analysis.
\newblock {\em Oper. Res.}, 43:807--825, 1995.

\bibitem{so85}
G.\ SONNEVEND.
\newblock An {`analytical centre'} for polyhedrons and new classes of global
  algorithms for linear {(smooth, convex)} programming.
\newblock In {\em System Modelling and Optimization}, pages 866--875. Springer,
  Berlin, 1986.
\newblock Lecture Notes in Control and Information Sciences No. 84.

\bibitem{Sorensen92}
D.C. Sorensen.
\newblock Implicit application of polynomial filters in a k-step {A}rnoldi
  method.
\newblock {\em SIAM J. Matrix Anal. Appl.}, 13(1):357--385, 1992.

\bibitem{spr-73}
T.A. SPRINGER.
\newblock {\em {J}ordan Algebras and Algebraic Groups}.
\newblock Springer-Verlag, 1973.

\bibitem{SteTun:97}
T.~STEPHEN and L.~TUN{\c{C}}EL.
\newblock On a representation of the matching polytope via semidefinite
  liftings.
\newblock Technical Report CORR 97-11, Department of Combinatorics and
  Optimization, Waterloo, Ont, 1997.

\bibitem{sw5}
R.~Stern and H.~Wolkowicz.
\newblock Trust region problems and nonsymmetric eigenvalue perturbations.
\newblock {\em SIAM J. Matrix Anal. Appl.}, 15(3):755--778, 1994.

\bibitem{StWo:93}
R.~Stern and H.~Wolkowicz.
\newblock Indefinite trust region subproblems and nonsymmetric eigenvalue
  perturbations.
\newblock {\em SIAM J. Optim.}, 5(2):286--313, 1995.

\bibitem{stw2}
R.J. Stern and H.~Wolkowicz.
\newblock Exponential nonnegativity on the ice cream cone.
\newblock {\em SIAM J. Matrix Anal. Appl.}, 12(1):160--165, 1991.

\bibitem{stw1}
R.J. Stern and H.~Wolkowicz.
\newblock Invariant ellipsoidal cones.
\newblock {\em Linear Algebra Appl.}, 150:81--106, 1991.

\bibitem{stw3}
R.J. Stern and H.~Wolkowicz.
\newblock A note on generalized invariant cones and the {K}ronecker canonical
  form.
\newblock {\em Linear Algebra Appl.}, 147:97--100, 1991.

\bibitem{stw4}
R.J. Stern and H.~Wolkowicz.
\newblock Results on invariant cones.
\newblock {\em Linear Algebra Appl.}, 166:1--26, 1991.
\newblock Proceedings from the Haifa Matrix Theory Conference, June 1990.

\bibitem{stsun:90}
G.W. Stewart and J-G. SUN.
\newblock {\em Matrix Perturbation Theory}.
\newblock Academic Press, 1990.

\bibitem{St:85}
J.~STOER.
\newblock Principles of sequential quadratic programming methods for solving
  nonlinear programs.
\newblock In K.~Schittkowski, editor, {\em Computational Mathematical
  Programming}, pages 165--207. Springer-Verlag, Berlin, 1985.

\bibitem{int:Stoer2}
J.~STOER and M.~WECHS.
\newblock Infeasible-interior-point paths for sufficient linear complementarity
  problems and their analyticity.
\newblock Technical report, Institut f\"ur Angewandte Mathematik und Statistik,
  Universit\"at W\"urzburg, W\"urzburg, Germany, 1996.
\newblock Manuscript.

\bibitem{StoWit:70}
J.~STOER and C.~WITZGALL.
\newblock {\em Convexity and Optimization in Finite Dimensions}.
\newblock Springer, Berlin-Heidelberg-New York, 1970.

\bibitem{Sturm:97}
J.F. Sturm.
\newblock {\em Primal-Dual Interior Point Approach to Semidefinite
  Programming}.
\newblock PhD thesis, 1997.

\bibitem{S98guide}
J.F. Sturm.
\newblock Using {S}e{D}u{M}i 1.02, a {M}{A}{T}{L}{A}{B} toolbox for
  optimization over symmetric cones.
\newblock {\em Optim. Methods Softw.}, 11/12(1-4):625--653, 1999.
\newblock sedumi.ie.lehigh.edu.

\bibitem{S98lmi}
J.F. Sturm.
\newblock Error bounds for linear matrix inequalities.
\newblock {\em SIAM J. Optim.}, 10(4):1228--1248 (electronic), 2000.

\bibitem{SturmZhang}
J.F. Sturm and S.~Zhang.
\newblock On sensitivity of central solutions in semidefinite programming.
\newblock Technical report, Econometric Institute, Erasmus University,
  Rotterdam, The Netherlands, 1998.

\bibitem{SturmZhang:95}
J.F. Sturm and S.~Zhang.
\newblock Symmetric primal-dual path following algorithms for semidefinite
  programming.
\newblock {\em Appl. Numer. Math.}, 29:301--315, 1999.

\bibitem{MR91j:52008}
C.~H. SUNG and B.-S. TAM.
\newblock A study of projectionally exposed cones.
\newblock {\em Linear Algebra Appl.}, 139:225--252, 1990.

\bibitem{MR86j:90118}
B.-S. TAM.
\newblock On the duality operator of a convex cone.
\newblock {\em Linear Algebra Appl.}, 64:33--56, 1985.

\bibitem{MR91d:15040}
B.-S. TAM.
\newblock On the distinguished eigenvalues of a cone-preserving map.
\newblock {\em Linear Algebra Appl.}, 131:17--37, 1990.

\bibitem{TamBar:92}
B.-S. TAM.
\newblock Graphs and irreducible cone preserving maps.
\newblock {\em Linear and Multilinear Algebra}, 31:12--25, 1992.

\bibitem{Tam:92}
B.-S. TAM.
\newblock On the structure of the cone of positive operators.
\newblock {\em Linear Algebra Appl.}, 167:65--85, 1992.
\newblock Sixth Haifa Conference on Matrix Theory (Haifa, 1990).

\bibitem{MR97m:47050}
B.-S. TAM.
\newblock Extreme positive operators on convex cones.
\newblock In {\em Five decades as a mathematician and educator}, pages
  515--558. World Sci. Publishing, River Edge, NJ, 1995.

\bibitem{MR91k:15009}
B.-S. TAM and P.~H. LIOU.
\newblock Linear transformations which map the class of inverse ${M}$-matrices
  onto itself.
\newblock {\em Tamkang J. Math.}, 21(2):159--167, 1990.

\bibitem{MR94h:15011}
B.-S. TAM and H.~SCHNEIDER.
\newblock On the core of a cone-preserving map.
\newblock {\em Trans. Amer. Math. Soc.}, 343(2):479--524, 1994.

\bibitem{Tanabe:87}
K.~TANABE.
\newblock Complementarity-enforcing centered {Newton} method for linear
  programming: {Global} methods.
\newblock Manuscript at the symposium {``New Methods for Linear Programming''},
  The Institute of Statistical Mathematics, 4-6-7 Minamiazabu, Minatoku, Tokyo,
  Japan 106, 1987.
\newblock Title of revised version is: Complementarity-enforcing centered
  {Newton} method for mathematical programming: Global method.

\bibitem{Tanabe:88}
K.~TANABE.
\newblock Centered {N}ewton method for mathematical programming.
\newblock In {\em System Modeling and Optimization}, pages 197--206, NY, USA,
  1988. Springer-Verlag.

\bibitem{BeniTang:96}
X.~TANG and A.~BEN-ISRAEL.
\newblock Two consequences of {M}inkowski's $2^n$ {T}heorem.
\newblock Technical report, RUTCOR, Rutgers University, 1996.

\bibitem{TaTr:93}
P.~Tarazaga and M.W. TROSSET.
\newblock An optimization problem on subsets of the symmetric positive
  semidefinite matrices.
\newblock Technical report, Rice University, Houston, Texas, 1993.

\bibitem{Taus:67}
O.~TAUSSKY.
\newblock Positive definite matrices.
\newblock In O.~Shisha, editor, {\em Inequalities}. Academic Press Inc., New
  York and London, 1967.

\bibitem{MR37:2785}
O.~TAUSSKY.
\newblock Positive-definite matrices and their role in the study of the
  characteristic roots of general matrices.
\newblock {\em Advances in Math.}, 2:175--186 (1968), 1968.

\bibitem{Terl:85}
T.~Terlaky.
\newblock On $l_p$ programming.
\newblock {\em European J. Oper. Res.}, 22:70--100, 1985.

\bibitem{Ti:Si:98}
G.A. TIJSSEN and G.~SIERKSMA.
\newblock Balinski-{T}ucker simplex tableaus: Dimensions, degeneracy degrees,
  and interior points of optimal faces.
\newblock {\em Math. Programming}, 81:349--372, 1998.

\bibitem{Tit:75}
D.M. TITTERINGTON.
\newblock Optimal design: some geometrical aspects of ${D}$-optimality.
\newblock {\em Biometrika}, 62(2):313--320, 1975.

\bibitem{Todd:85}
M.J. Todd.
\newblock `{F}at' triangulations, or solving certain nonconvex matrix
  optimization problems.
\newblock {\em Math. Programming}, 31:123--136, 1985.

\bibitem{Todd:97}
M.J. Todd.
\newblock A study of search directions in primal-dual interior-point methods
  for semidefinite programming.
\newblock {\em Optim. Methods Softw.}, 11\&12:1--46, 1999.

\bibitem{ToddTohTut:96b}
M.J. Todd, K.C. Toh, and R.H. {T\"{u}t\"{u}nc\"{u}}.
\newblock A {MATLAB} software package for semidefinite programming.
\newblock Technical report, School of OR and IE, Cornell University, Ithaca,
  NY, 1996.

\bibitem{ToddTohTut:98}
M.J. Todd, K.C. Toh, and R.H. {T\"{u}t\"{u}nc\"{u}}.
\newblock On the {N}esterov-{T}odd direction in semidefinite programming.
\newblock {\em SIAM J. Optim.}, 8(3):769--796, 1998.

\bibitem{ToddYe:90}
M.J. Todd and Y.~Ye.
\newblock A centered projective algorithm for linear programming.
\newblock {\em Math. Oper. Res.}, 15:508--529, 1990.

\bibitem{Toh:97}
K.C. Toh.
\newblock Search directions for primal-dual interior point methods in
  semidefinite programming.
\newblock Technical report, Department of Mathematics, National University of
  Singapore, Singapore, 1997.

\bibitem{Tong80}
Y.L. TONG.
\newblock {\em Probability Inequalities in Multivariate Distributions}.
\newblock New York, Academic Press, 1980.

\bibitem{Trosset:97b}
M.W. TROSSET.
\newblock Computing distances between convex sets and subsets of the positive
  semidefinite matrices.
\newblock Technical report, Rice University, Houston, Texas, 1997.

\bibitem{Trosset:97a}
M.W. TROSSET.
\newblock Applications of multidimensional scaling to molecular conformation.
\newblock {\em Computing Science and Statistics}, 29:148--152, 1998.

\bibitem{Tse:98}
P.~Tseng.
\newblock Search directions and convergence analysis of some infeasible
  path-following methods for the monotone semi-definite {LCP}.
\newblock {\em Optim. Methods Softw.}, 9:245--268, 1998.

\bibitem{TSU:97}
T.~TSUCHIYA.
\newblock A polynomial primal-dual path-following algorithm for second-order
  cone programming.
\newblock Technical report, The Institute of Statistical Mathematics, Tokyo,
  Japan, 1997.

\bibitem{tsu-98}
T.~TSUCHIYA.
\newblock A convergence analysis of the scaling-invariant primal-dual
  path-following algorithms for second-order cone programming.
\newblock Technical Report Research Memorandum No. 664, The Institute of
  Statistical Mathematics, Tokyo, Japan, 1998.

\bibitem{Tuncel:94}
L.~TUN{\c{C}}EL.
\newblock Constant potential primal-dual algorithms: A framework.
\newblock {\em Math. Programming}, 66:145--159, 1994.

\bibitem{Tuncel:98b}
L.~TUN{\c{C}}EL.
\newblock Lecture notes on ``{C}onvex optimization: Barrier functions and
  interior-point methods''.
\newblock Technical Report B-336, Department of Mathematical and Computing
  Sciences, Tokyo Institute of Technology, Tokyo, Japan, 1998.

\bibitem{Tuncel:98a}
L.~TUN{\c{C}}EL.
\newblock Primal-dual symmetry and scale invariance of interior-point
  algorithms for convex optimization.
\newblock {\em Math. Oper. Res.}, 23:708--718, 1998.

\bibitem{Tuncel:99}
L.~TUN{\c{C}}EL.
\newblock Interior-point methods for semidefinite programming.
\newblock In {\em Encyclopedia of Optimization}, MA, USA, 1999. Kluwer Academic
  Publishers.

\bibitem{Tun:99}
L.~TUN{\c{C}}EL.
\newblock Generalization of primal-dual interior-point methods to convex
  optimization problems in conic form.
\newblock {\em Foundations of Computational Mathematics}, 1(3):229--254, 2001.

\bibitem{TuncelTodd:97}
L.~TUN{\c{C}}EL and M.J. Todd.
\newblock On the interplay among entropy, variable metrics and potential
  functions in interior-point algorithms.
\newblock {\em Comput. Optim. Appl.}, 8:5--19, 1997.

\bibitem{TunXu:99b}
L.~TUN{\c{C}}EL and S.~XU.
\newblock Complexity analyses of discretized successive convex relaxation
  methods.
\newblock Technical Report CORR 99-37, Department of Combinatorics and
  Optimization, Waterloo, Ont, 1999.

\bibitem{TunXu:99}
L.~TUN{\c{C}}EL and S.~XU.
\newblock On homogeneous convex cones, {C}aratheodory number, and duality
  mapping semidefinite liftings.
\newblock Technical Report CORR 99-21, Department of Combinatorics and
  Optimization, Waterloo, Ont, 1999.

\bibitem{utl}
T.~URBAN, A.L. TITS, and C.T. LAWRENCE.
\newblock A primal-dual interior-point method for nonconvex optimization with
  multiple logarithmic barrier parameters and with strong convergence
  properties.
\newblock Report, University of Maryland, College Park, 1998.

\bibitem{Urs:75}
C.~URSESCU.
\newblock Multifunctions with convex closed graph.
\newblock {\em Czechoslovak Math. J.}, 25:438--441, 1975.

\bibitem{VHV:91}
S.~{VAN HUFFEL} and J.~VANDEWALLE.
\newblock {\em The total least squares problem: computational aspects and
  analysis}, volume~9 of {\em Frontiers in applied Math.}
\newblock SIAM, Philadelphia, PA, 1991.

\bibitem{VaB1:97}
L.~Vandenberghe and V.~BALAKRISHNAN.
\newblock Algorithms and software for {LMI} problems in control.
\newblock {\em IEEE Control Syst.\ Mag.}, pages 89--95, October 1997.

\bibitem{VaB1:99}
L.~Vandenberghe and V.~BALAKRISHNAN.
\newblock Semidefinite programming duality and linear system theory:
  connections and implications for computation.
\newblock Technical report, UCLA, Los Angeles, CA, 1999.
\newblock To appear in the Proceedings of the 1999 Conference on Decision and
  Control.

\bibitem{VaB:93b}
L.~Vandenberghe and S.~Boyd.
\newblock A polynomial-time algorithm for determining quadratic {L}yapunov
  functions for nonlinear systems.
\newblock In {\em Eur. Conf. Circuit Th. and Design}, pages 1065--1068, 1993.

\bibitem{VanBoy:94b}
L.~Vandenberghe and S.~Boyd.
\newblock Positive definite programming.
\newblock In {\em Mathematical Programming: State of the Art, 1994}, pages
  276--308. The University of Michigan, 1994.

\bibitem{VaB:94c}
L.~Vandenberghe and S.~Boyd.
\newblock {\em {SP}: Software for Semidefinite Programming. User's Guide,
  {B}eta Version.}
\newblock K.U. Leuven and Stanford University, October 1994.

\bibitem{VanBoy:93}
L.~Vandenberghe and S.~Boyd.
\newblock A primal-dual potential reduction method for problems involving
  matrix inequalities.
\newblock {\em Math. Programming}, 69(1, Ser. B):205--236, 1995.

\bibitem{VanBoy:94}
L.~Vandenberghe and S.~Boyd.
\newblock Semidefinite programming.
\newblock {\em SIAM Rev.}, 38(1):49--95, 1996.

\bibitem{MR99c:90143}
L.~Vandenberghe and S.~Boyd.
\newblock Connections between semi-infinite and semidefinite programming.
\newblock In {\em Semi-infinite programming}, pages 277--294. Kluwer Acad.
  Publ., Boston, MA, 1998.

\bibitem{MR1677204}
L.~Vandenberghe and S.~Boyd.
\newblock Applications of semidefinite programming.
\newblock {\em Appl. Numer. Math.}, 29(3):283--299, 1999.
\newblock Proceedings of the Stieltjes Workshop on High Performance
  Optimization Techniques (HPOPT '96) (Delft).

\bibitem{VBW:98}
L.~Vandenberghe, S.~Boyd, and S.-P. WU.
\newblock Determinant maximization with linear matrix inequality constraints.
\newblock {\em SIAM J. Matrix Anal. Appl.}, 19(2):499--533, 1998.

\bibitem{Vanderbei:98}
R.J. Vanderbei.
\newblock {\em Linear Programming: Foundations and Extensions}.
\newblock Kluwer Acad. Publ., Dordrecht, 1998.

\bibitem{MR97b:90077}
R.J. Vanderbei and Y.~Bing.
\newblock The simplest semidefinite programs are trivial.
\newblock {\em Math. Oper. Res.}, 20(3):590--596, 1995.

\bibitem{vs}
R.J.\ Vanderbei and D.F.\ SHANNO.
\newblock An interior point algorithm for nonconvex nonlinear programming.
\newblock Report SOR-97-21, Dept.\ of Statistics and OR, Princeton University,
  1997.

\bibitem{Va:85}
A.~VARDI.
\newblock A trust region algorithm for equality constrained minimization:
  convergence properties and implementation.
\newblock {\em SIAM J. Numer. Anal.}, 22:575--591, 1985.

\bibitem{Vav:91}
S.A. Vavasis.
\newblock {\em Nonlinear Optimization: Complexity Issues}.
\newblock Oxford Science, New York, 1991.

\bibitem{Vava:99}
S.A. Vavasis.
\newblock A note on efficient computation of the gradient in semidefinite
  programming.
\newblock Technical report, Cornell University, Ithaca, NY, 1999.

\bibitem{Vial:94}
J.-P. VIAL.
\newblock Computational experience with a primal-dual interior-point method for
  smooth convex programming.
\newblock {\em Optim. Methods Softw.}, 3:285--316, 1994.

\bibitem{Vin:65}
E.B. VINBERG.
\newblock The theory of homogeneous cones.
\newblock {\em Trans. Moscow Math.}, 12:340--403, 1965.

\bibitem{WP94}
T.~Wang and J.S. Pang.
\newblock Global error bounds for convex quadratic inequality systems.
\newblock {\em Optimization}, 31:1--12, 1994.

\bibitem{Waterhouse:89}
W.C. WATERHOUSE.
\newblock Linear transformations preserving symmetric rank one matrices.
\newblock {\em Journal of Algebra}, 125:502--518, 1989.

\bibitem{wein90}
L.M. WEIN.
\newblock Scheduling networks of queues: Heavy traffic analysis of a
  two-station network with controllable inputs.
\newblock {\em Oper. Res.}, 38:1065--1078, 1990.

\bibitem{weiss}
G.~WEISS.
\newblock On the optimal draining of re--entrant fluid lines.
\newblock In {\em Stochastic Networks, Proceedings of the IMA}, pages 91--104.
  F. Kelly and R. Williams eds., 1995.

\bibitem{Wel:82a}
W.J. WELCH.
\newblock Algorithmic complexity: {T}hree {N}{P}-hard problems in computational
  statistics.
\newblock {\em J. Statist. Comput. Simulation}, 15(1):17--25, 1982.

\bibitem{Wel:82b}
W.J. WELCH.
\newblock Branch-and-bound search for experimental designs based on
  {D}-optimality and other criteria.
\newblock {\em Technometrics}, 24(1):41--48, 1982.

\bibitem{Wells:95}
C.P. Wells.
\newblock {\em An Improved Method for Sampling of Molecular Conformation
  Space}.
\newblock PhD thesis, 1995.

\bibitem{Wilk:65}
J.H. WILKINSON.
\newblock {\em The Algebraic Eigenvalue Problem}.
\newblock Oxford University Press, London, 1965.

\bibitem{Wil:71a}
J.~C. WILLEMS.
\newblock Least squares stationary optimal control and the algebraic {R}iccati
  equation.
\newblock {\em IEEE Trans.\ Aut.\ Control}, AC-16(6):621--634, December 1971.

\bibitem{MR97a:93032}
H.K. WIMMER.
\newblock The set of positive semidefinite solutions of the algebraic {R}iccati
  equation of discrete-time optimal control.
\newblock {\em IEEE Trans. Automat. Control}, 41(5):660--671, 1996.

\bibitem{w14}
H.~Wolkowicz.
\newblock A constrained matrix optimization problem.
\newblock {\em SIAM Review 23}, 101, 1981.

\bibitem{w11}
H.~Wolkowicz.
\newblock Some applications of optimization in matrix theory.
\newblock {\em Linear Algebra Appl.}, 40:101--118, 1981.

\bibitem{Wolk:93}
H.~Wolkowicz.
\newblock Explicit solutions for interval semidefinite linear programs.
\newblock {\em Linear Algebra Appl.}, 236:95--104, 1996.

\bibitem{Wolk:image98}
H.~Wolkowicz.
\newblock Semidefiniteness of a sum: Problem solution 19-5.5.
\newblock {\em IMAGE, The Bulletin of ILAS}, 20:30--31, 1998.

\bibitem{wolkcamb:99}
H.~Wolkowicz.
\newblock Semidefinite and {L}agrangian relaxations for hard combinatorial
  problems.
\newblock In M.J.D. Powell, editor, {\em Proceedings of 19th IFIP TC7
  Conference on System Modelling and Optimization, July, 1999, Cambridge},
  pages 269--309. Kluwer Academic Publishers, Boston, MA, 2000.

\bibitem{wolk:98}
H.~Wolkowicz.
\newblock Duality for semidefinite programming.
\newblock In {\em Encyclopedia of Optimization}. Kluwer Academic Publishers,
  Boston, MA, 2001.

\bibitem{Wolkapplhand:99}
H.~Wolkowicz.
\newblock Semidefinite programming.
\newblock In P.M. Pardalos and M.G.C. Resende, editors, {\em Handbook of
  Applied Optimization}, pages 40--50. Oxford University Press, New York, 2002.

\bibitem{WoZh:93}
H.~Wolkowicz and Q.~Zhao.
\newblock An all-inclusive efficient region of updates for least change secant
  methods.
\newblock {\em SIAM J. Optim.}, 5(1):172--191, 1995.

\bibitem{WoZh:96}
H.~Wolkowicz and Q.~Zhao.
\newblock Semidefinite programming relaxations for the graph partitioning
  problem.
\newblock {\em Discrete Appl. Math.}, 96/97:461--479, 1999.
\newblock Selected for the special Editors' Choice, Edition 1999.

\bibitem{SWright:96}
S.~Wright.
\newblock {\em Primal-Dual Interior-Point Methods}.
\newblock Society for Industrial and Applied Mathematics (SIAM), Philadelphia,
  Pa, 1996.

\bibitem{Wu:95}
F.~WU.
\newblock {\em Control of Linear Parameter Varying Systems}.
\newblock Doctoral Dissertation. Engineering-Mechanical Eng.\ Dept., University
  of California Berkeley, 1995.

\bibitem{Wu:98}
Z.~WU.
\newblock A subgradient algorithm for nonlinear integer programming.
\newblock Technical report, Rice University, Houston, Tx, 1998.

\bibitem{int:Xu1}
X.~XU, P.-F. HUNG, and Y.~YE.
\newblock A simplified homogeneous and self-dual linear programming algorithm
  and its implementation.
\newblock {\em Ann. Oper. Res.}, 62:151--171, 1996.

\bibitem{Yak:62}
V.A. YAKUBOVICH.
\newblock The solution of certain matrix inequalities in automatic control
  theory.
\newblock {\em Soviet Math. Dokl.}, 3:620--623, 1962.
\newblock In Russian, 1961.

\bibitem{Yak:64}
V.A. YAKUBOVICH.
\newblock Solution of certain matrix inequalities encountered in nonlinear
  control theory.
\newblock {\em Soviet Math. Dokl.}, 5:652--656, 1964.

\bibitem{Yak:65}
V.A. Yakubovich.
\newblock The method of matrix inequalities in the stability theory of
  nonlinear control systems, {$I$, $II$, $III$}.
\newblock {\em Automation and Remote Control}, 25-26(4):905--917, 577--592,
  753--763, April 1967.

\bibitem{Ya:73}
V.A. Yakubovich.
\newblock Minimization of quadratic functionals under the quadratic constraints
  and the necessity of a frequency condition in the quadratic criterion for
  absolute stability of nonlinear control systems.
\newblock {\em Dokl. Akad. Nauk SSSR}, 209(14):1039--1042, 1973.

\bibitem{Ya:71}
V.A. Yakubovich.
\newblock The {S}-procedure and duality theorems for nonconvex problems of
  quadratic programming.
\newblock {\em Vestnik Leningrad. Univ.}, 1973(1):81--87, 1973.

\bibitem{MR93g:49026}
V.A. Yakubovich.
\newblock Nonconvex optimization problem: the infinite-horizon linear-quadratic
  control problem with quadratic constraints.
\newblock {\em Systems Control Lett.}, 19(1):13--22, 1992.

\bibitem{MR95m:68087}
M.~YANNAKAKIS.
\newblock On the approximation of maximum satisfiability.
\newblock {\em J. Algorithms}, 17(3):475--502, 1994.
\newblock Third Annual ACM-SIAM Symposium on Discrete Algorithms (Orlando, FL,
  1992).

\bibitem{ye-90}
Y.~Ye.
\newblock A class of projective transformations for linear programming.
\newblock {\em SIAM J. Comput.}, 19(3):457--466, 1990.

\bibitem{Ye:91}
Y.~Ye.
\newblock An {O}$(n^3 {L})$ potential reduction algorithm for linear
  programming.
\newblock {\em Math. Programming}, 50:239--258, 1991.

\bibitem{Ye:92b}
Y.~YE.
\newblock A new complexity result on minimization of a quadratic function with
  a sphere constraint.
\newblock In {\em Recent Advances in Global Optimization}, pages 19--31.
  Princeton University Press, 1992.

\bibitem{Ye-1}
Y.~Ye.
\newblock On affine scaling algorithms for nonconvex quadratic programming.
\newblock {\em Math. Programming}, 56:285--300, 1992.

\bibitem{Ye:94}
Y.~YE.
\newblock Combining binary search and {N}ewton's method to compute real roots
  for a class of real functions.
\newblock {\em Journal of Complexity}, 10:271--280, 1994.

\bibitem{Yinye:97b}
Y.~Ye.
\newblock {\em Interior Point Algorithms: Theory and Analysis}.
\newblock Wiley-Interscience series in Discrete Mathematics and Optimization.
  John Wiley \& Sons, New York, 1997.

\bibitem{Ye99}
Y.~Ye.
\newblock A .699-approximation algorithm for max-bisection.
\newblock Technical report, University of Iowa, Iowa City, IA, 1999.

\bibitem{Yinye:97}
Y.~Ye.
\newblock Approximating quadratic programming with bound and quadratic
  constraints.
\newblock {\em Math. Programming}, 84:219--226, 1999.

\bibitem{int:Ye55}
Y.~YE, M.J. Todd, and S.~MIZUNO.
\newblock An {${\cal O}(\sqrt{n} L)$}--iteration homogeneous and self--dual
  linear programming algorithm.
\newblock {\em Math. Oper. Res.}, 19:53--67, 1994.

\bibitem{YildTodd:99}
E.A. YILDIRIM and M.J. Todd.
\newblock Sensitivity analysis in linear programming and semidefinite
  programming using interior-point methods.
\newblock {\em Math. Programming}, 90(2):229--261, 2001.

\bibitem{Yuan:83b}
Y.~YUAN.
\newblock Some properties of trust region algorithms for nonsmooth
  optimization.
\newblock Technical Report DAMTP 1983/NA14, Department of Applied Mathematics
  and Theoretical Physics, University of Cambridge, Cambridge, England, 1983.

\bibitem{Yuan:90}
Y.~YUAN.
\newblock On a subproblem of trust region algorithms for constrained
  optimization.
\newblock {\em Math. Programming}, 47:53--63, 1990.

\bibitem{Yuan:91}
Y.~YUAN.
\newblock A dual algorithm for minimizing a quadratic function with two
  quadratic constraints.
\newblock {\em Journal of Computational Mathematics}, 9:348--359, 1991.

\bibitem{MR89b:15040}
F.~Z. Zhang.
\newblock On the best {E}uclidean fit to a distance matrix.
\newblock {\em Beijing Shifan Daxue Xuebao}, 4:21--24, 1987.

\bibitem{Zhang:95}
Y.~Zhang.
\newblock Basic equalities and inequalities in primal-dual interior-point
  methods for semidefinite programming.
\newblock Technical report, Department of Mathematics and Statistics,
  University of Maryland Baltimore County, 1995.

\bibitem{YZha:98}
Y.~Zhang.
\newblock On extending some primal-dual interior-point algorithms from linear
  programming to semidefinite programming.
\newblock {\em SIAM J. Optim.}, 8:365--386, 1998.

\bibitem{qz}
Q.~Zhao.
\newblock Measures for least change secant methods.
\newblock Master's thesis, University of Waterloo, 1993.

\bibitem{zhao:96}
Q.~Zhao.
\newblock {\em Semidefinite Programming for Assignment and Partitioning
  Problems}.
\newblock PhD thesis, University of Waterloo, 1996.

\bibitem{KaReWoZh:94}
Q.~Zhao, S.E. Karisch, F.~Rendl, and H.~Wolkowicz.
\newblock Semidefinite programming relaxations for the quadratic assignment
  problem.
\newblock {\em J. Comb. Optim.}, 2(1):71--109, 1998.
\newblock Semidefinite programming and interior-point approaches for
  combinatorial optimization problems (Fields Institute, Toronto, ON, 1996).

\bibitem{Zieb:98}
A.D. ZIEBUR.
\newblock Chain rules for functions of matrices.
\newblock {\em Linear Algebra Appl.}, 283:87--97, 1998.

\bibitem{Ziegler:99}
G.M. ZIEGLER.
\newblock Lectures on 0/1-polytopes.
\newblock Technical report, Technische Universitat Berlin, Berling, Germany,
  1999.

\bibitem{ZoBySch:96}
Z.~ZOU, R.H. BYRD, and R.B. SCHNABEL.
\newblock A stochastic/perturbation global optimization algorithm for distance
  geometry problems.
\newblock Technical report, Dept. of Computer Science, University of Colorado,
  Boulder, Co, 1996.

\bibitem{Zowe:79}
J.~Zowe and S.~Kurcyusz.
\newblock Regularity and stability for the mathematical programming problem in
  {B}anach spaces.
\newblock {\em Appl. Math. Optim.}, 5:49--62, 1979.

\bibitem{MR80a:90131}
J.~ZOWE and H.~MAURER.
\newblock Optimality conditions for the programming problem in infinite
  dimensions.
\newblock In {\em Optimization and operations research (Proc. Workshop, Univ.
  Bonn, Bonn, 1977)}, volume 157 of {\em Lecture Notes in Econom. and Math.
  Systems}, pages 261--270. Springer, Berlin, 1978.

\bibitem{Zwick98}
U.~ZWICK.
\newblock Finding almost satisfying assignments.
\newblock In {\em Proc. of the 30th {ACM} Symp. on Theory Comput.}, pages
  551--560, 1998.

\bibitem{Zwick99}
U.~ZWICK.
\newblock Outward rotations: A tool for rounding solutions of semidefinite
  programming relaxations, with applications to {MAX CUT} and other problems.
\newblock In {\em Proc. of the 31st {ACM} Symp. on Theory Comput.}, pages
  679--687, 1999.

\end{thebibliography}
