\begin{thebibliography}{1000}

\bibitem{ipm:Abhyankar1}
S.~S. Abhyankar, T.~L. Morin, and T.~B. Trafalis.
\newblock Efficient faces of polytope\,: {Interior} point algorithms,
  parameterization of algebraic varieties, and multiple objective optimization.
\newblock In J.~C. Lagarias and M.~J. Todd, editors, {\em Mathematical
  Developments Arising from Linear Programming\,:\,Proceedings of a Joint
  Summer Research Conference held at Bowdoin College, Brunswick, Maine, USA,
  June/July 1988}, volume 114 of {\em Contemporary Mathematics}, pages
  319--341. American Mathematical Society, Providence, Rhode Island, USA, 1990.

\bibitem{ipm:Adler1}
I.~Adler.
\newblock A primal--dual implementation of {Karmarkar's} algorithm.
\newblock {Talk held at the ORSA/TIMS Joint National Meeting in Atlanta, GA,
  USA}, Operations Research Center, University of California, Berkeley,
  CA\,94720, USA, November 1985.

\bibitem{ipm:Adler13}
I.~Adler.
\newblock Computational tests of the {Karmarkar} algorithm.
\newblock {Talk held at the SIAM Conference on Optimization in Houston, TX,
  USA}, Department of Industrial Engineering and Operations Research,
  University of California, Berkeley, CA~94720, USA, May 1987.

\bibitem{ipm:Adler12}
I.~Adler.
\newblock Implementation issues of path--following algorithms for linear
  programming.
\newblock {Talk held at the EURO/TIMS Joint International Conference on
  Operational Research in Paris, France}, Department of Industrial Engineering
  and Operations Research, University of California, Berkeley, CA~94720, USA,
  July 1988.

\bibitem{ipm:Adler18}
I.~Adler and F.~Alizadeh.
\newblock Primal--dual interior point algorithms for convex quadratically
  constrained and semidefinite optimization problems.
\newblock {RUTCOR Research Report} RRR~46--95, RUTCOR -- Rutgers Center for
  Operations Research, Hill Center for Mathematical Sciences, New Brunswick,
  NJ~08903, USA, 1995.

\bibitem{ipm:Adler15}
I.~Adler and P.~A. Beling.
\newblock Polynomial algorithms for {LP} over a subring of the algebraic
  integers with applications to {LP} with circulant matrices.
\newblock {\em Mathematical Programming}, 57:121--143, 1992.
\newblock Condensed version in\,: {\em 32nd Annual Symposium on Foundations of
  Computer Science (San Juan, 1991), pp.\,480--487, IEEE Computer Society
  Press, Los Alamitos, CA, USA, 1991}.

\bibitem{ipm:Adler17}
I.~Adler and P.~A. Beling.
\newblock Polynomial algorithms for linear programming over the algebraic
  numbers.
\newblock {\em Algorithmica}, 12:436--457, 1994.

\bibitem{ipm:Adler7}
I.~Adler, {M. de} Carvalho, M.~G.~C. Resende, and G.~Veiga.
\newblock Computational performance of variants of {Karmarkar's} algorithm.
\newblock {Talk held at the ORSA/TIMS Joint National Meeting in St. Louis,
  USA}, Department of Industrial Engineering and Operations Research,
  University of California, Berkeley, CA~94720, USA, October 1987.

\bibitem{ipm:Adler8}
I.~Adler, {M. de} Carvalho, M.~G.~C. Resende, and G.~Veiga.
\newblock A {Monte--Carlo} study of variants of interior point algorithms.
\newblock {Technical Report}, Department of Industrial Engineering and
  Operations Research, University of California, Berkeley, CA~94720, USA, 1987.

\bibitem{ipm:Adler6}
I.~Adler, N.~K. Karmarkar, M.~G.~C. Resende, and G.~Veiga.
\newblock Implementation of an interior point algorithm for linear programming.
\newblock {Technical Report}, Department of Industrial Engineering and
  Operations Research, University of California, Berkeley, CA\,94720, USA,
  1986.

\bibitem{ipm:Adler9}
I.~Adler, N.~K. Karmarkar, M.~G.~C. Resende, and G.~Veiga.
\newblock Data structures and programming techniques for the implementation of
  {Karmarkar's} algorithm.
\newblock {\em ORSA Journal on Computing}, 1:84--106, 1989.

\bibitem{ipm:Adler10}
I.~Adler, N.~K. Karmarkar, M.~G.~C. Resende, and G.~Veiga.
\newblock An implementation of {Karmarkar's} algorithm for linear programming.
\newblock {\em Mathematical Programming}, 44:297--335, 1989.
\newblock (Errata in {\em Mathematical Programming}, 50:415, 1991).

\bibitem{ipm:Adler5}
I.~Adler, N.~K. Karmarkar, and G.~Veiga.
\newblock Implementing an interior point algorithm for linear programming.
\newblock {Talk held at the ORSA/TIMS Joint National Meeting in Miami Beach,
  FL, USA}, Department of Industrial Engineering and Operations Research,
  University of California, Berkeley, CA\,94720, USA, October 1986.

\bibitem{ipm:Adler14}
I.~Adler and R.~D.~C. Monteiro.
\newblock Limiting behavior of the affine scaling continuous trajectories for
  linear programming problems.
\newblock In J.~C. Lagarias and M.~J. Todd, editors, {\em Mathematical
  Developments Arising from Linear Programming\,: Proceedings of a Joint Summer
  Research Conference held at Bowdoin College, Brunswick, Maine, USA, June/July
  1988}, volume 114 of {\em Contemporary Mathematics}, pages 189--211. American
  Mathematical Society, Providence, Rhode Island, USA, 1990.

\bibitem{ipm:Adler11}
I.~Adler and R.~D.~C. Monteiro.
\newblock An interior point algorithm applied to a class of convex separable
  programming problems.
\newblock {Talk held at the ORSA/TIMS Joint National Meeting in Nashville,
  Tennessee, USA}, Department of Industrial Engineering and Operations
  Research, University of California, Berkeley, CA~94720, USA, May 1991.

\bibitem{ipm:Adler2}
I.~Adler and R.~D.~C. Monteiro.
\newblock Limiting behavior of the affine scaling continuous trajectories for
  linear programming problems.
\newblock {\em Mathematical Programming}, 50:29--51, 1991.

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

\bibitem{ipm:Adler16}
I.~Adler and R.~Shamir.
\newblock A randomized scheme for speeding up algorithms for linear and convex
  programming with high constraints--to--variables ratio.
\newblock {\em Mathematical Programming}, 61:39--53, 1993.

\bibitem{ipm:Adler4}
I.~Adler and G.~Veiga.
\newblock On implementing interior point methods for linear programming.
\newblock {Talk held at the ORSA/TIMS Joint National Meeting in Los Angeles,
  CA, USA}, Department of Industrial Engineering and Operations Research,
  University of California, Berkeley, CA\,94720, USA, April 1986.

\bibitem{ipm:Akguel2}
M.~Akg{\"{u}}l.
\newblock On the exact solution of a system of linear homogeneous equations via
  a projective algorithm.
\newblock {\em Arabian Journal for Science and Engineering}, 15(4):753--754,
  1990.

\bibitem{ipm:Akguel1}
M.~Akg{\"{u}}l.
\newblock A short proof of {Karmarkar's} main result.
\newblock {\em Do{\u{g}}a T{\"{u}}rk Matematik Dergisi (Turkish Journal of
  Mathematics, Ankara)}, 14:48--55, 1990.

\bibitem{ipm:Akrotirianakis1}
I.~Akrotirianakis and B.~Rustem.
\newblock A globally convergent interior point algorithm for general
  non--linear programming problems.
\newblock {Technical Report} 97--14, Department of Computing, Imperial College
  of Science, Technology and Medicine, 180~Queen's Gate, London\,SW7\,2BZ,
  United Kingdom, November 1997.

\bibitem{ipm:AlSultan2}
K.~S. {Al--Sultan}.
\newblock {\em Nearest point problems\,: {Theory} and algorithms}.
\newblock PhD thesis, University of Michigan, Ann Arbor, Michigan, USA, 1990.

\bibitem{ipm:AlSultan1}
K.~S. {Al--Sultan}.
\newblock A {Newton} based radius reduction algorithm for nearest point
  problems in pos cones.
\newblock {\em ORSA Journal on Computing}, 6:282--289, 1994.

\bibitem{ipm:Alfakih1}
A.~Y. Alfakih, A.~Khandani, and H.~Wolkowicz.
\newblock An interior--point algorithm for the {Euclidean} distance matrix
  completion problem.
\newblock {Research Report} CORR~97--9, Department of Combinatorics and
  Optimization, University of Waterloo, Waterloo, Ontario, Canada, 1997.

\bibitem{ipm:Alizadeh4}
F.~Alizadeh.
\newblock {\em Combinatorial optimization with interior point methods and
  semi--definite matrices}.
\newblock PhD thesis, University of Minnesota, Minneapolis, Minnesota, USA,
  1991.

\bibitem{ipm:Alizadeh1}
F.~Alizadeh.
\newblock A sublinear--time randomized parallel algorithm for the maximum
  clique problem in perfect graphs.
\newblock {\em Proceedings of the Second ACM--SIAM Symposium on Discrete
  Algorithms}, pages 188--194, 1991.

\bibitem{ipm:Alizadeh3}
F.~Alizadeh.
\newblock Combinatorial optimization with semi--definite matrices.
\newblock In E.~Balas, G.~Cornu{\'e}jols, and R.~Kannan, editors, {\em
  Proceedings of the Second Integer Programming and Combinatorial Optimization
  (IPCO) Conference}, pages 385--405. Carnegie--Mellon University, Pittsburg,
  PA, USA, 1992.

\bibitem{ipm:Alizadeh2}
F.~Alizadeh.
\newblock Optimization over the 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, Amsterdam, The Netherlands, 1992.

\bibitem{ipm:Alizadeh5}
F.~Alizadeh.
\newblock Interior point methods in semidefinite programming with applications
  to combinatorial optimization.
\newblock {\em SIAM Journal on Optimization}, 5:13--51, 1995.

\bibitem{ipm:Alizadeh9}
F.~Alizadeh, J.-P.~A. Haeberly, M.~V. Nayakkankuppam, and M.~L. Overton.
\newblock {SDPpack} user's guide, version 0.8beta.
\newblock {Technical Report} 734, Department of Computer Science, New York
  University, New York, NY, USA, March 1997.

\bibitem{ipm:Alizadeh11}
F.~Alizadeh, J.-P.~A. Haeberly, M.~V. Nayakkankuppam, M.~L. Overton, and
  S.~Schmieta.
\newblock {SDPpack} user's guide, version 0.9beta.
\newblock {Technical Report} 737, Department of Computer Science, New York
  University, New York, NY, USA, 1997.

\bibitem{ipm:Alizadeh8}
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 Applied Linear Algebra (Proceedings of
  the 5th SIAM Conference, held in Snowbird, UT, USA, June 1994)}, pages
  113--117. SIAM Publications, Philadelphia, PA, USA, 1994.

\bibitem{ipm:Alizadeh6}
F.~Alizadeh, J.-P.~A. Haeberly, and M.~L. Overton.
\newblock Complementarity and nondegeneracy in semidefinite programming.
\newblock {RUTCOR Research Report}, RUTCOR -- Rutgers Center for Operations
  Research, Hill Center for Mathematical Sciences, New Brunswick, NJ~08903,
  USA, March 1995.

\bibitem{ipm:Alizadeh7}
F.~Alizadeh, J.-P.~A. Haeberly, and M.~L. Overton.
\newblock Primal--dual interior--point methods for semidefinite programming.
\newblock {RUTCOR Research Report}, RUTCOR -- Rutgers Center for Operations
  Research, Hill Center for Mathematical Sciences, New Brunswick, NJ~08903,
  USA, 1995.
\newblock Also published as\,: Technical Report, Courant Institute of
  Mathematical Sciences, New York University, New York, 1995.

\bibitem{ipm:Alizadeh10}
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 Journal on Optimization}, 8:746--768, 1998.

\bibitem{ipm:Alizadeh12}
F.~Alizadeh and S.~Schmieta.
\newblock Optimization with semidefinite, quadratic and linear constraints.
\newblock {RUTCOR Research Report} RRR\,23--97, RUTCOR -- Rutgers Center for
  Operations Research, Hill Center for Mathematical Sciences, New Brunswick,
  NJ~08903, USA, November 1997.

\bibitem{ipm:Altman4}
A.~Altman.
\newblock An application of an interior point method for problems with
  uncertainty.
\newblock In A.~Bachem, U.~Derigs, M.~J{\"u}nger, and R.~Schrader, editors,
  {\em Operations Research~'93}, pages 5--7. Physica Verlag (A Springer--Verlag
  Company), Heidelberg, Germany, 1994.

\bibitem{ipm:Altman8}
A.~Altman.
\newblock The interior point method for nondifferentiable optimization.
\newblock {\em Journal of Computer and Systems Sciences International},
  33(6):12--21, 1995.

\bibitem{ipm:Altman5}
A.~Altman.
\newblock {\em QHOPDM} -- {A} higher order primal--dual method for large scale
  convex quadratic programming.
\newblock {\em European Journal of Operational Research}, 87:200--202, 1995.

\bibitem{ipm:Altman9}
A.~Altman.
\newblock Higher order primal--dual interior point method for separable convex
  quadratic optimization.
\newblock {\em Control and Cybernetics (Poland)}, 25:761--772, 1996.

\bibitem{ipm:Altman6}
A.~Altman, M.~Amann, G.~Klaassen, A.~Ruszczynski, and W.~Sch{\"o}pp.
\newblock Cost--effective sulphur emission reduction under uncertainty.
\newblock {\em European Journal of Operational Research}, 90:395--412, 1996.

\bibitem{ipm:Altman2}
A.~Altman and J.~Gondzio.
\newblock {\em HOPDM} -- {A} higher order primal--dual method for large scale
  linear programming.
\newblock {Program Manual}, Systems Research Institute, Polish Academy of
  Sciences, Newelska6, PL--01--447~Warshaw, Poland, July 1992.
\newblock See also Altman and Gondzio \cite{ipm:Altman3}.

\bibitem{ipm:Altman1}
A.~Altman and J.~Gondzio.
\newblock An efficient implementation of a higher order primal--dual interior
  point method for large sparse linear programs.
\newblock {\em Archives of Control Sciences}, 2:23--40, 1993.

\bibitem{ipm:Altman3}
A.~Altman and J.~Gondzio.
\newblock {\em HOPDM} -- {A} higher order primal--dual method for large scale
  linear programming.
\newblock {\em European Journal of Operational Research}, 66:159--160, 1993.
\newblock See also Altman and Gondzio \cite{ipm:Altman2}, and Gondzio
  \cite{ipm:Gondzio9}.

\bibitem{ipm:Altman10}
A.~Altman and J.~Gondzio.
\newblock Regularized symmetric indefinite systems in interior point methods
  for linear and quadratic optimization.
\newblock {Logilab Technical Report} 98.6, Section of Management Studies,
  University of Geneva, 102 Bd. Carl Vogt, CH--1211 Geneva 4, Switzerland,
  March 1998.

\bibitem{ipm:Altman7}
A.~Altman and K.~C. Kiwiel.
\newblock A note on some analytic center cutting plane methods for convex
  feasibility and minimization problems.
\newblock {\em Computational Optimization and Applications}, 5:175--180, 1996.

\bibitem{ipm:Amaya1}
J.~Amaya.
\newblock Numerical experiments with the symmetric affine scaling algorithm on
  degenerate linear programming problems.
\newblock {\em Optimization}, 27:51--62, 1993.

\bibitem{ipm:Amaya2}
J.~Amaya.
\newblock On the symmetric affine scaling algorithm for linear programming.
\newblock {\em Optimization}, 32:147--158, 1995.

\bibitem{ipm:Andersen7}
E.~D. Andersen.
\newblock Finding all linearly dependent rows in large--scale linear
  programming.
\newblock {\em Optimization Methods and Software}, 6:219--2227, 1995.

\bibitem{ipm:Andersen19}
E.~D. Andersen.
\newblock Implementation of interior point methods for large scale linear
  programming.
\newblock {Technical Report} 96--1, Department of Management, School of
  Business and Admininstration, Odense Uinversity, Odense, Denmark, 1996.

\bibitem{ipm:Andersen21}
E.~D. Andersen.
\newblock On exploiting problem structure in a basis identification procedure
  for linear programming.
\newblock {Technical Report} 96--6, Department of Management, School of
  Business and Admininstration, Odense Uinversity, Odense, Denmark, 1996.

\bibitem{ipm:Andersen16}
E.~D. Andersen.
\newblock {\em Solution of linear and convex optimization problems with
  interior--point methods}.
\newblock PhD thesis, Department of Mathematics and Computer Science, Odense
  University,, DK--5320~Odense~M, Denmark, January 1996.

\bibitem{ipm:Andersen26}
E.~D. Andersen.
\newblock The homogeneous self--dual methods for linear programming.
\newblock In C.~A. Floudas and P.~M. Pardalos, editors, {\em Encyclopaedia of
  Optimization}. Kluwer Academic Publishers, Dordrecht, The Netherlands, 1997.

\bibitem{ipm:Andersen9}
E.~D. Andersen and K.~D. Andersen.
\newblock Presolving in linear programming.
\newblock {\em Mathematical Programming}, 71:221--245, 1995.

\bibitem{ipm:Andersen18}
E.~D. Andersen and K.~D. Andersen.
\newblock {The APOS LP solver}.
\newblock {Technical Report}, Center of Operations Research and Econometrics,
  Universite Catholique de Louvain, B--1348~Louvain--la--Neuve, Belgium, 1995.

\bibitem{ipm:Andersen20}
E.~D. Andersen and K.~D. Andersen.
\newblock {The APOS linear programming solver\,: An} implementation of the
  homogeneous algorithm.
\newblock {CORE Discussion Paper} 9337, Center of Operations Research and
  Econometrics, Universite Catholique de Louvain, B--1348~Louvain--la--Neuve,
  Belgium, 1997.

\bibitem{ipm:Andersen24}
E.~D. Andersen and K.~D. Andersen.
\newblock A parallel interior--point algorithm for linear programming on a
  shared memory machine.
\newblock {CORE Discussion Paper} 9808, Center of Operations Research and
  Econometrics, Universite Catholique de Louvain, B--1348~Louvain--la--Neuve,
  Belgium, 1998.

\bibitem{ipm:Andersen25}
E.~D. Andersen and A.~Damgaard.
\newblock Utility based option pricing with proportional transaction costs and
  diversification problems\,: {An} interior point optimization approach.
\newblock {Technical Report}, Department of Management, School of Business and
  Admininstration, Odense University, Odense, Denmark, 1997.

\bibitem{ipm:Anderson15}
E.~D. Andersen, J.~Gondzio, C.~M{\'e}sz{\'a}ros, and X.~Xu.
\newblock Implementation of interior point methods for large scale linear
  programming.
\newblock In T.~Terlaky, editor, {\em Interior Point Methods of Mathematical
  Programming}, volume~5 of {\em Applied Optimization}, pages 189--252. Kluer
  Academic Publishers, Dordrecht, The Netherlands, 1996.

\bibitem{ipm:Andersen6}
E.~D. Andersen and Y.~Ye.
\newblock Combining interior--point algorithms and pivoting for linear
  programming.
\newblock {\em Management Science}, 42:1719--1731, 1996.

\bibitem{ipm:Andersen23}
E.~D. Andersen and Y.~Ye.
\newblock On a homogeneous algorithm for a monotone complementarity problem
  with nonlinear equality constraints.
\newblock In M.~C. Ferris and J.-S. Pang, editors, {\em Complementarity and
  Variational Problems\,: State--of--the--Art (Baltimore 1995)}, pages 1--11.
  SIAM Publications, Philadelphia, PA, USA, 1997.

\bibitem{ipm:Andersen22}
E.~D. Andersen and Y.~Ye.
\newblock A computational study of the homogeneous algorithm for large-- scale
  convex optimization.
\newblock {\em Computational Optimization and Applications}, 10:243--269, 1998.

\bibitem{ipm:Andersen13}
E.~D. Andersen and Y.~Ye.
\newblock On a homogeneous algorithm for the monotone complementarity problem.
\newblock {\em Mathematical Programming}, 84:375--399, 1999.

\bibitem{ipm:Andersen5}
J.~A. Andersen.
\newblock {\em Iterative methods for the solution of linear programs}.
\newblock PhD thesis, Department of Mathematics and Statistics, Brunel
  University, Uxbridge, Middlesex~UB8\,3PH, United Kingdom, 1992.

\bibitem{ipm:Andersen4}
J.~A. Andersen, R.~Levkovitz, and G.~Mitra.
\newblock Adapting the interior point method for the solution of linear
  programs on high performance computers.
\newblock In O.~Balci, R.~Sharda, and S.~A. Zenios, editors, {\em Operations
  Research and Computer Science\,: New Developments in Their Interfaces}, pages
  73--86. Pergamon Press, Oxford, United Kingdom, 1992.

\bibitem{ipm:Andersen1}
J.~A. Andersen, R.~Levkovitz, G.~Mitra, and M.~Tamiz.
\newblock Adopting interior search algorithms for the solution of {LP}s for
  serial, coarse grain parallel and massively parallel computers.
\newblock {Talk held at the First International Symposium on Interior Point
  Methods for Linear Programming\,: Theory and Practice, in Scheveningen, The
  Netherlands}, Department of Mathematics and Statistics, Brunel University,
  Uxbridge, Middlesex~UB8~3PH, United Kingdom, January 1990.

\bibitem{ipm:Andersen2}
J.~A. Andersen and G.~Mitra.
\newblock Solving the {Newton} iteration step of the interior point method on
  massively parallel ({SIMD}) computer.
\newblock {Talk held at the Symposium APMOD~'91---Applied Mathematical
  Programming and Modelling, Brunel University, London, United Kingdom},
  Department of Mathematics and Statistics, Brunel University, Uxbridge,
  Middlesex~UB8~3PH, United Kingdom, January 1991.

\bibitem{ipm:Andersen3}
K.~D. Andersen.
\newblock An infeasible dual affine scaling method for linear programming.
\newblock {\em Mathematical Programming Society Committee on Algorithms (COAL)
  Bulletin}, 22:19--27, 1993.

\bibitem{ipm:Andersen10}
K.~D. Andersen.
\newblock A large scaling implementation of the dual affine scaling algorithm.
\newblock Preprint, Department of Mathematics and Computer Science, Odense
  University, DK--5320~Odense~M, Denmark, 1993.
\newblock To appear in {\em Mathematical Programming Society Committee on
  Algorithms (COAL) Bulletin}.

\bibitem{ipm:Andersen17}
K.~D. Andersen.
\newblock An efficient {Newton} barrier method for minimizing a sum of
  {Euclidean} norms.
\newblock {\em SIAM Journal on Optimization}, 6:74--95, 1996.

\bibitem{ipm:Andersen11}
K.~D. Andersen.
\newblock A modified {Schur} complement for handling dense columns in interior
  point methods for linear programming.
\newblock {\em ACM Transactions on Mathematical Software}, 22:348--356, 1996.

\bibitem{ipm:Andersen8}
K.~D. Andersen and E.~Christiansen.
\newblock Limit analysis with the dual affine scaling algorithm.
\newblock {\em Journal of Computational and Applied Mathematics}, 59:233--243,
  1995.

\bibitem{ipm:Andersen27}
K.~D. Andersen, E.~Christiansen, A.~R. Conn, and M.~L. Overton.
\newblock An efficient primal--dual interior--point method for minimizing a sum
  of {Euclidean} norms.
\newblock {CORE Discussion Paper}, Center of Operations Research and
  Econometrics, Universite Catholique de Louvain, B--1348~Louvain--la--Neuve,
  Belgium, August 1998.

\bibitem{ipm:Andersen12}
K.~D. Andersen and E.~D. Christiansen.
\newblock A {Newton} barrier method for minimizing a sum of {Euclidean} norms
  subject to linear equality constraints.
\newblock Preprint 95--07, Department of Mathematics and Computer Science,
  Odense University, DK--5320~Odense~M, Denmark, February 1995.

\bibitem{ipm:Andersen14}
K.~D. Andersen and E.~D. Christiansen.
\newblock A symmetric primal--dual {Newton} method for minimizing a sum of
  norms.
\newblock Preprint, Department of Mathematics and Computer Science, Odense
  University, DK--5320~Odense~M, Denmark, 1995.

\bibitem{ipm:Andrusenko1}
S.~K. Andrusenko, E.~A. Nurminskii, and P.~I. Stetsyuk.
\newblock Numerical experiments in a new class of algorithms in linear
  programming.
\newblock {\em Zhurnal Vychislitel'noi Matematiki~i~ Matematicheskoi Fiziki
  (Moscow)}, 27:349--356, 1987.
\newblock Translated in\,: {\em USSR Computational Mathematics and Mathematical
  Physics}, 27(2):18--22, 1987.

\bibitem{ipm:Angier1}
N.~Angier.
\newblock Folding the perfect corner.
\newblock {\em Time Magazin}, 124:55, December 3, 1984.

\bibitem{ipm:Anitescu2}
M.~Anitescu, G.~Lesaja, and F.~Potra.
\newblock Equivalence between different formulations of the linear
  complementarity problem.
\newblock {Reports on Computational Mathematics}~71, Department of Mathematics,
  University of Iowa, Iowa City, IA~52242, USA, June 1995.

\bibitem{ipm:Anitescu1}
M.~Anitescu, G.~Lesaja, and F.~Potra.
\newblock An infeasible--interior--point predictor--corrector algorithm for the
  {$P_{*}$}--geometric {LCP}.
\newblock {\em Applied Mathematics and Optimization}, 36:203--228, 1997.

\bibitem{ipm:Anstreicher1}
K.~M. Anstreicher.
\newblock Analysis of a modified {Karmarkar} algorithm for linear programming.
\newblock {Technical Report} B\#84, Yale School of Management, Yale University,
  New Haven, CT~06520, USA, August 1985.

\bibitem{ipm:Anstreicher2}
K.~M. Anstreicher.
\newblock Analysis of {Karmarkar's} algorithm for fractional linear
  programming.
\newblock {Technical Report}, Yale School of Management, Yale University, New
  Haven, CT~06520, USA, November 1985.

\bibitem{ipm:Anstreicher3}
K.~M. Anstreicher.
\newblock A monotonic projective algorithm for fractional linear programming.
\newblock {\em Algorithmica}, 1(4):483--498, 1986.

\bibitem{ipm:Anstreicher4}
K.~M. Anstreicher.
\newblock A strenghtened acceptance criterion for approximate projections in
  {Karmarkar's} algorithm.
\newblock {\em Operations Research Letters}, 5:211--214, 1986.

\bibitem{ipm:Anstreicher5}
K.~M. Anstreicher.
\newblock On the complexity of the projective algorithm for standard form
  linear programming.
\newblock {Technical Report} B\#104, Yale School of Management, Yale
  University, New Haven, CT~06520, USA, 1987.

\bibitem{ipm:Anstreicher7}
K.~M. Anstreicher.
\newblock Linear programming and the {Newton} barrier flow.
\newblock {\em Mathematical Programming}, 41:367--373, 1988.

\bibitem{ipm:Anstreicher18}
K.~M. Anstreicher.
\newblock A combined phase\,{I}\,--\,phase\,{II} projective algorithm for
  linear programming.
\newblock {\em Mathematical Programming}, 43:209--223, 1989.

\bibitem{ipm:Anstreicher10}
K.~M. Anstreicher.
\newblock Progress in interior point algorithms since 1984.
\newblock {\em SIAM News}, 22:12--14, March 1989.

\bibitem{ipm:Anstreicher22}
K.~M. Anstreicher.
\newblock Recent developments in algorithms for linear programming.
\newblock {Talk held at the Third SIAM Conference on Optimization in Boston,
  MA, USA}, Yale School of Management, Yale University, New Haven, CT~06520,
  USA, April 1989.

\bibitem{ipm:Anstreicher9}
K.~M. Anstreicher.
\newblock The worst--case step in {Karmarkar's} algorithm.
\newblock {\em Mathematics of Operations Research}, 14:294--302, 1989.

\bibitem{ipm:Anstreicher6}
K.~M. Anstreicher.
\newblock Dual ellipsoids and degeneracy in the projective algorithm for linear
  programming.
\newblock In J.~C. Lagarias and M.~J. Todd, editors, {\em Mathematical
  Developments Arising from Linear Programming\,: Proceedings of a Joint Summer
  Research Conference held at Bowdoin College, Brunswick, Maine, USA, June/July
  1988}, volume 114 of {\em Contemporary Mathematics}, pages 141--149. American
  Mathematical Society, Providence, Rhode Island, USA, 1990.

\bibitem{ipm:Anstreicher12}
K.~M. Anstreicher.
\newblock A standard form variant and safeguarded linesearch for the modified
  {Karmarkar} algorithm.
\newblock {\em Mathematical Programming}, 47:337--351, 1990.

\bibitem{ipm:Anstreicher23}
K.~M. Anstreicher.
\newblock Advances in interior point methods for linear programming.
\newblock {Tutorial held at the ORSA/TIMS Joint National Meeting in Anaheim,
  CA, USA}, Department of Management Science, University of Iowa, Iowa City,
  IA~52242, USA, November 1991.

\bibitem{ipm:Anstreicher11}
K.~M. Anstreicher.
\newblock A combined phase\,{I}\,--\,phase\,{II} scaled potential algorithm for
  linear programming.
\newblock {\em Mathematical Programming}, 52:429--439, 1991.

\bibitem{ipm:Anstreicher17}
K.~M. Anstreicher.
\newblock On monotonicity in the scaled potential algorithm for linear
  programming.
\newblock {\em Linear Algebra and Its Applications}, 152:223--232, 1991.

\bibitem{ipm:Anstreicher8}
K.~M. Anstreicher.
\newblock On the performance of {Karmarkar's} algorithm over a sequence of
  iterations.
\newblock {\em SIAM Journal on Optimization}, 1(1):22--29, 1991.

\bibitem{ipm:Anstreicher25}
K.~M. Anstreicher.
\newblock Efficient centering for linear programming interior point methods.
\newblock {Technical Report}, Department of Management Science, University of
  Iowa, Iowa City, IA~52242, USA, January 1992.

\bibitem{ipm:Anstreicher20}
K.~M. Anstreicher.
\newblock On interior algorithms for linear programming with no regularity
  assumptions.
\newblock {\em Operations Research Letters}, 11:209--212, 1992.

\bibitem{ipm:Anstreicher16}
K.~M. Anstreicher.
\newblock Strict monotonicity and improved complexity in the standard form
  projective algorithm for linear programming.
\newblock {\em Mathematical Programming}, 62:517--535, 1993.

\bibitem{ipm:Anstreicher31}
K.~M. Anstreicher.
\newblock Large step volumetric potential reduction algorithms for linear
  programming.
\newblock {\em Annals of Operations Research}, 62:521--538, 1996.

\bibitem{ipm:Anstreicher19}
K.~M. Anstreicher.
\newblock On long step path following and {SUMT} for linear and quadratic
  programming.
\newblock {\em SIAM Journal on Optimization}, 6:33--46, 1996.

\bibitem{ipm:Anstreicher37}
K.~M. Anstreicher.
\newblock Potential reduction algorithms.
\newblock In T.~Terlaky, editor, {\em Interior Point Methods of Mathematical
  Programming}, volume~5 of {\em Applied Optimization}, pages 125--158. Kluer
  Academic Publishers, Dordrecht, The Netherlands, 1996.

\bibitem{ipm:Anstreicher38}
K.~M. Anstreicher.
\newblock Ellipsoidal approximations of convex sets based on the volumetric
  barrier.
\newblock {Technical Report}, Department of Mathematics, University of Iowa,
  Iowa City, IA~52242, USA, March 1997.

\bibitem{ipm:Anstreicher36}
K.~M. Anstreicher.
\newblock {\em {Interior Point Methods in Theory and Practice}}, volume~76 of
  {\em Mathematical Programming}.
\newblock North Holland, Amsterdam, The Netherlands, 1997.
\newblock (Special issue).

\bibitem{ipm:Anstreicher32}
K.~M. Anstreicher.
\newblock On {Vaidya's} volumetric cutting plane method for convex programming.
\newblock {\em Mathematics of Operations Research}, 22:63--89, 1997.

\bibitem{ipm:Anstreicher33}
K.~M. Anstreicher.
\newblock Volumetric path following algorithms for linear programming.
\newblock {\em Mathematical Programming}, 76:245--263, 1997.

\bibitem{ipm:Anstreicher42}
K.~M. Anstreicher.
\newblock On the equivalence of convex programming bounds for {Boolean}
  quadratic programming.
\newblock {Technical Report}, Department of Mathematics, University of Iowa,
  Iowa City, IA~52242, USA, May 1998.

\bibitem{ipm:Anstreicher44}
K.~M. Anstreicher.
\newblock The volumetric barrier for convex quadratic constraints.
\newblock {Technical Report}, Department of Mathematics, University of Iowa,
  Iowa City, IA~52242, USA, October 1998.

\bibitem{ipm:Anstreicher40}
K.~M. Anstreicher.
\newblock The volumetric barrier for semidefinite programming.
\newblock {Technical Report}, Department of Mathematics, University of Iowa,
  Iowa City, IA~52242, USA, January 1998.

\bibitem{ipm:Anstreicher39}
K.~M. Anstreicher.
\newblock Towards a practical volumetric cutting plane method for convex
  programming.
\newblock {\em SIAM Journal on Optimization}, 9:190--206, 1999.

\bibitem{ipm:Anstreicher21}
K.~M. Anstreicher and R.~A. Bosch.
\newblock On partial updating in a potential reduction linear programming
  algorithm of {Kojima, Mizuno and Yoshise}.
\newblock {Technical Report}, Yale School of Management, Yale University, New
  Haven, CT~06520, USA, 1991.
\newblock Same as Bosch and Anstreicher \cite{ipm:Bosch2}.

\bibitem{ipm:Anstreicher13}
K.~M. Anstreicher and R.~A. Bosch.
\newblock Long steps in a ${O(n^{3}L)}$ algorithm for linear programming.
\newblock {\em Mathematical Programming}, 54:251--265, 1992.

\bibitem{ipm:Anstreicher30}
K.~M. Anstreicher and R.~A. Bosch.
\newblock A new infinity--norm path following algorithm for linear programming.
\newblock {\em SIAM Journal on Optimization}, 5:236--246, 1995.

\bibitem{ipm:Anstreicher35}
K.~M. Anstreicher and M.~Fampa.
\newblock A long--step path following algorithm for semidefinite programming
  problems.
\newblock In P.~M. Pardalos and M.~Wolkowicz, editors, {\em Topics in
  Semidefinite and Interior--Point Methods}, volume~18 of {\em Fields Institute
  Communications Series}, pages 181--196. American Mathematical Society (AMS),
  Providence, RI, USA, 1998.

\bibitem{ipm:Freund34}
K.~M. Anstreicher and R.~M. Freund.
\newblock Following a ''balanced'' trajectory from an infeasible point to an
  optimal linear programming solution with a polynomial--time algorithm.
\newblock {\em Mathematics of Operations Research}, 21:839--859, 1996.

\bibitem{ipm:Anstreicher34}
K.~M. Anstreicher and R.~M. Freund.
\newblock {\em {Interior Point Methods in Mathematical Programming}}, volume~62
  of {\em Annals of Operations Research}.
\newblock Baltzer Science Publishing Company, Basel, Switzerland, 1996.
\newblock Special issue.

\bibitem{ipm:Anstreicher15}
K.~M. Anstreicher, {D. den} Hertog, C.~Roos, and T.~Terlaky.
\newblock A long step barrier method for convex quadratic programming.
\newblock {\em Algorithmica}, 10:365--382, 1993.

\bibitem{ipm:Anstreicher24}
K.~M. Anstreicher and J.~Ji.
\newblock More on dual ellipsoids and degeneracy in interior algorithms for
  linear programming.
\newblock {Talk held at the Fourth SIAM Conference on Optimization in Chicago,
  IL, USA}, Department of Management Science, University of Iowa, Iowa City,
  IA~52242, USA, May 1992.

\bibitem{ipm:Anstreicher27}
K.~M. Anstreicher, J.~Ji, F.~A. Potra, and Y.~Ye.
\newblock Probabilistic analysis of an infeasible primal--dual algorithm for
  linear programming.
\newblock {Reports on Computational Mathematics}~27, Department of Mathematics,
  University of Iowa, Iowa City, IA~52242, USA, July 1992.

\bibitem{ipm:Anstreicher28}
K.~M. Anstreicher, J.~Ji, F.~A. Potra, and Y.~Ye.
\newblock Average performance of a self--dual interior--point algorithm for
  linear programming.
\newblock In P.~M. Pardalos, editor, {\em Complexity in Numerical
  Optimization}, pages 1--15. World Scientific Publishing Co., London, United
  Kingdom, 1993.

\bibitem{ipm:Anstreicher26}
K.~M. Anstreicher, J.~Ji, and Y.~Ye.
\newblock Average performance of an ellipsoid termination criterion for linear
  programming interior point algorithms.
\newblock {Technical Report} 92--01, Department of Management Science,
  University of Iowa, Iowa City, IA~52242, USA, February 1992.

\bibitem{ipm:Anstreicher29}
K.~M. Anstreicher and J.-Ph. Vial.
\newblock On the convergence of an infeasible primal--dual interior--point
  method for convex programming.
\newblock {\em Optimization Methods and Software}, 3:273--283, 1994.

\bibitem{ipm:Anstreicher14}
K.~M. Anstreicher and P.~Watteyne.
\newblock A family of search directions for {Karmarkar's} algorithm.
\newblock {\em Operations Research}, 41:759--767, 1993.

\bibitem{ipm:Anstreicher41}
K.~M. Anstreicher and H.~Wolkowicz.
\newblock On {Lagrangian} relaxation of quadratic matrix constraints.
\newblock {Research Report} CORR 98--24, Department of Combinatorics and
  Optimization, University of Waterloo, Waterloo, Ontario~N2L\,3G1, Canada,
  1998.

\bibitem{ipm:Arbel1}
A.~Arbel.
\newblock {\em {Exploring Interior Point Linear Programming\,: Algorithms and
  Software}}.
\newblock Foundations of Computing Series. MIT Press, Cambridge, MA~02142, USA,
  1993.

\bibitem{ipm:Arbel4}
A.~Arbel.
\newblock Generating interior search directions for multiobjective linear
  programming using approximate gradients and efficient anchoring points.
\newblock {\em Optimization}, 28:149--164, 1993.

\bibitem{ipm:Arbel2}
A.~Arbel.
\newblock An interior multiobjective linear programming algorithm.
\newblock {\em Computers and Operations Research}, 20(7):723--735, 1993.

\bibitem{ipm:Arbel12}
A.~Arbel.
\newblock Large--scale optimization methods applied to the cutting stock
  problem of irregular shapes.
\newblock {\em International Journal of Production Research}, 31:483--500,
  1993.

\bibitem{ipm:Arbel7}
A.~Arbel.
\newblock Using sequential generation of anchoring points in an interior
  multi--objective primal--dual linear programming algorithm.
\newblock {\em Archives of Control Sciences}, 2:5--21, 1993.

\bibitem{ipm:Arbel11}
A.~Arbel.
\newblock A weighted--gradient approach to multi--objective linear programming
  problems using the analytical hierarchy process.
\newblock {\em Mathematical Computations and Modelling}, 17(4--5):27--39, 1993.

\bibitem{ipm:Arbel3}
A.~Arbel.
\newblock Anchoring points and cones of opportunities in interior
  multiobjective linear programming.
\newblock {\em Journal of the Operational Research Society}, 45(1):83--96,
  1994.

\bibitem{ipm:Arbel9}
A.~Arbel.
\newblock Interior--point methods for multiobjective linear programming
  problems.
\newblock In G.~H.~Tzeng et~al., editor, {\em Multiple Criteria Decision
  Making, Proceedings of the 10th International Conference ''Expand and Enrich
  the Domain of Thinking and Application'', held at Taipei, Taiwan, July 1992},
  pages 27--36. Springer Verlag, Berlin, Germany, 1994.

\bibitem{ipm:Arbel5}
A.~Arbel.
\newblock An interior multiobjective primal--dual linear programming algorithm
  using approximated gradients and sequential generation of anchor points.
\newblock {\em Optimization}, 30:137--150, 1994.

\bibitem{ipm:Arbel8}
A.~Arbel.
\newblock A multiobjective interior primal--dual linear programming algorithm.
\newblock {\em Computers and Operations Research}, 21:433--445, 1994.

\bibitem{ipm:Arbel6}
A.~Arbel.
\newblock Using efficient anchoring points for generating search directions in
  interior multi--objective linear programming.
\newblock {\em Journal of the Operational Research Society}, 45:330--334, 1994.

\bibitem{ipm:Arbel13}
A.~Arbel.
\newblock An interior multiple objective primal--dual linear programming
  algorithm using efficient anchoring points.
\newblock {\em Journal of the Operational Research Society}, 46:1121--1132,
  1995.

\bibitem{ipm:Arbel17}
A.~Arbel.
\newblock An interior multiobjective primal--dual linear programming algorithm
  based on approximated gradients and efficient anchoring points.
\newblock {\em Computers and Operations Research}, 24:353--365, 1997.

\bibitem{ipm:Arbel16}
A.~Arbel and P.~Korhonen.
\newblock Using aspiration levels in an interactive interior multiobjective
  linear programming algorithm.
\newblock {\em European Journal of the Operational Research}, 89:193--201,
  1996.

\bibitem{ipm:Arbel18}
A.~Arbel and P.~Korhonen.
\newblock Using aspiration levels in an interior primal--dual multiobjective
  linear programming algorithm.
\newblock {\em Journal of Multi--Criteria Decisions and Analysis}, 5:61--71,
  1996.

\bibitem{ipm:Arbel15}
A.~Arbel and S.~S. Oren.
\newblock Generating interior search directions for multiobjective linear
  programming.
\newblock {\em Journal of Multi--Criteria Decisions and Analysis}, 2:73--86,
  1993.

\bibitem{ipm:Arbel10}
A.~Arbel and S.~S. Oren.
\newblock A modification of {Karmarkar's} algorithm for multiple objective
  linear programming.
\newblock In G.~H. Tzeng, editor, {\em Multiple Criteria Decision Making,
  Proceedings of the 10th International Conference ''Expand and Enrich the
  Domain of Thinking and Application'', held at Taipei, Taiwan, July 1992},
  pages 37--46. Springer Verlag, Berlin, Germany, 1994.

\bibitem{ipm:Arbel14}
A.~Arbel and S.~S. Oren.
\newblock Using approximate gradients in developing an interactive interior
  primal--dual multiobjective linear programming algorithm.
\newblock {\em European Journal of the Operational Research}, 89:202--211,
  1996.

\bibitem{ipm:Arbel19}
A.~Arbel and P.Korhonen.
\newblock An interior multiobjective linear programming algorithm using
  aspirations.
\newblock In G.~Fandel and T.~Gal, editors, {\em Multiple Criteria Decision
  Making, Proceedings of the Conference held at Hagen, Germany, 1995}, volume
  448 of {\em Lecture Notes in Economics and Mathematical Systems}, pages
  245--254. Springer Verlag, Berlin, Germany, 1997.

\bibitem{ipm:ArgaezRamos1}
M.~{Arg{\'a}ez Ramos}.
\newblock {\em Exact and inexact {Newton} linesearch interior--point algorithms
  for nonlinear programming problems}.
\newblock PhD thesis, Department of Computational and Applied Mathematics, Rice
  University, Houston, TX~77251, USA, 1997.
\newblock Available as\,: Technical Report TR97--13.

\bibitem{ipm:Armacost1}
A.~Armacost and S.~Mehrotra.
\newblock A computational comparison of the network simplex method with the
  dual affine scaling method.
\newblock {\em Journal of the Operational Research Society of India
  (Opsearch)}, 28(1):18--35, 1991.

\bibitem{ipm:Armand1}
P.~Armand, J.~C. Gilbert, and S.~Jan-J{\'e}gou.
\newblock A feasible {BFGS} interior point algorithm for solving strongly
  convex minimization problems.
\newblock {Research Report} 3500, Institute National de Recherche en
  Informatique et Automatique (INRIA), F--78153~Roquencourt, France, October
  1998.

\bibitem{ipm:Aronson1}
J.~Aronson, R.~Barr, R.~Helgason, J.~Kennington, A.~Loh, and H.~Zaki.
\newblock The projective transformation algorithm by {Karmarkar}\,: {A}
  computational experiment with assignment problems.
\newblock {Technical Report} 85--OR--3, Department of Operations Research,
  Southern Methodist University, Dallas, TX~75275, USA, August 1985.

\bibitem{ipm:Aronson2}
J.~Aronson, R.~Barr, R.~Helgason, J.~Kennington, A.~Loh, and H.~Zaki.
\newblock A specialization of {Karmarkar's} algorithm to solve network
  problems.
\newblock {Technical Report}, Department of Operations Research, Southern
  Methodist University, Dallas, TX~75275, USA, 1985.

\bibitem{ipm:Astfalk1}
G.~Astfalk, I.~J. Lustig, R.~E. Marsten, and D.~Shanno.
\newblock The interior--point method for linear programming.
\newblock {\em IEEE Software}, 9(4):61--68, 1992.

\bibitem{ipm:At1}
{The {AT~\&~T KORBX} Linear Programming System, AT~\&~T Bell Laboratories,
  Holmdel, NJ~07733, USA}, 1988.
\newblock Introduced at the ORSA/TIMS Joint National Meeting in Denver, CO,
  USA, October 1988.

\bibitem{ipm:Atkinson6}
D.~S. Atkinson.
\newblock {\em Scaling and interior--point methods in optimization}.
\newblock PhD thesis, Coordinated Science Laboratory, College of Engineering,
  University of Illinois at Urbana--Champaign, Urbana, IL~61820, USA, 1992.

\bibitem{ipm:Atkinson3}
D.~S. Atkinson and P.~M. Vaidya.
\newblock An analytic center based cutting plane algorithm for convex
  programming.
\newblock {Technical Report}, College of Commerce and Business Administration,
  University of Illinois at Urbana--Champaign, Urbana, IL~61820, USA, June
  1992.

\bibitem{ipm:Atkinson2}
D.~S. Atkinson and P.~M. Vaidya.
\newblock A cutting plane algorithm that uses analytic centers.
\newblock {Working Paper}, College of Commerce and Business Administration,
  University of Illinois at Urbana--Champaign, Urbana, IL~61820, USA, 1992.

\bibitem{ipm:Atkinson5}
D.~S. Atkinson and P.~M. Vaidya.
\newblock Minimizing weighted self--concordant logarithmic barrier functions by
  scaling.
\newblock {Preprint}, Department of Mathematics, University of Illinois at
  Urbana--Champaign, Urbana, IL~61820, USA, 1992.

\bibitem{ipm:Atkinson1}
D.~S. Atkinson and P.~M. Vaidya.
\newblock A scaling technique for finding the weighted analytic center of a
  polytope.
\newblock {\em Mathematical Programming}, 57:163--192, 1992.

\bibitem{ipm:Atkinson4}
D.~S. Atkinson and P.~M. Vaidya.
\newblock A cutting plane algorithm for convex programming that uses analytic
  centers.
\newblock {\em Mathematical Programming}, 69:1--43, 1995.

\bibitem{ipm:Asic4}
M.~D. A\u{s}i{\'c} and V.~V. Kova\u{c}evi{\'c}-Vuj\u{c}i{\'c}.
\newblock An interior semi--infinite programming method.
\newblock {\em Journal of Optimization Theory and Applications}, 59:369--390,
  1988.

\bibitem{ipm:Asic8}
M.~D. A\u{s}i{\'c} and V.~V. Kova\u{c}evi{\'c}-Vuj\u{c}i{\'c}.
\newblock Ill--conditionedness and interior--point methods.
\newblock {Technical Report}, Laboratory for Operations Research, Faculty of
  Organizational Sciences, University of Belgrade, Jove Ilica~154,
  YU--11040~Belgrade, Yugoslavia, February 1998.

\bibitem{ipm:Asic6}
M.~D. A\u{s}i{\'c}, V.~V. Kova\u{c}evi{\'c}-Vuj\u{c}i{\'c}, and M.~D.
  Radosavljevi{\'c}-Nikoli{\'c}.
\newblock Karmarkar algoritam\,: {Analiza} numericke stabilnosti i neke
  modifikacije.
\newblock {\em Proceedings of the 12th Yugoslav Symposium on Operations
  Research (Herceg--Novi, Yugoslavia, October 1985)}, pages 33--41, 1985.
\newblock (In Yugoslav).

\bibitem{ipm:Asic7}
M.~D. A\u{s}i{\'c}, V.~V. Kova\u{c}evi{\'c}-Vuj\u{c}i{\'c}, and M.~D.
  Radosavljevi{\'c}-Nikoli{\'c}.
\newblock Asimptotsko ponasanje {Karmarkarove} metode.
\newblock {\em Proceedings of the 13th Yugoslav Symposium on Operations
  Research (Herceg--Novi, Yugoslavia, October 1986)}, pages 81--88, 1986.
\newblock (In Yugoslav).

\bibitem{ipm:Asic3}
M.~D. A\u{s}i{\'c}, V.~V. Kova\u{c}evi{\'c}-Vuj\u{c}i{\'c}, and M.~D.
  Radosavljevi{\'c}-Nikoli{\'c}.
\newblock Asymptotic behavior and numerical stability of {Karmarkar's} method
  for linear programming.
\newblock {Technical Report}, University of Belgrade, Belgrade, Yugoslavia,
  1986.

\bibitem{ipm:Asic1}
M.~D. A\u{s}i{\'c}, V.~V. Kova\u{c}evi{\'c}-Vuj\u{c}i{\'c}, and M.~D.
  Radosavljevi{\'c}-Nikoli{\'c}.
\newblock Behavior of {Karmarkar's} method on degenerate problems.
\newblock {Technical Report}, Department of Mathematics, Michigan State
  University, East Lansing, MI~48824, USA, 1988.

\bibitem{ipm:Asic2}
M.~D. A\u{s}i{\'c}, V.~V. Kova\u{c}evi{\'c}-Vuj\u{c}i{\'c}, and M.~D.
  Radosavljevi{\'c}-Nikoli{\'c}.
\newblock Asymptotic behavior of {Karmarkar's} method for linear programming.
\newblock {\em Mathematical Programming}, 46:173--190, 1990.

\bibitem{ipm:Asic5}
M.~D. A\u{s}i{\'c}, V.~V. Kova\u{c}evi{\'c}-Vuj\u{c}i{\'c}, and M.~D.
  Radosavljevi{\'c}-Nikoli{\'c}.
\newblock A note on limiting behavior of the projective and the affine
  rescaling algorithms.
\newblock In J.~C. Lagarias and M.~J. Todd, editors, {\em Mathematical
  Developments Arising from Linear Programming\,: Proceedings of a Joint Summer
  Research Conference held at Bowdoin College, Brunswick, Maine, USA, June/July
  1988}, volume 114 of {\em Contemporary Mathematics}, pages 151--157. American
  Mathematical Society, Providence, Rhode Island, USA, 1990.

\bibitem{ipm:Auslender1}
A.~Auslender and M.~Haddou.
\newblock An interior--proximal method for convex linearly constrained problems
  and its extension to variational inequalities.
\newblock {\em Mathematical Programming}, 71:77--100, 1995.

\bibitem{ipm:Babrovnikova1}
E.~Babrovnikova and S.~Vavasis.
\newblock Accurate solution of weighted least squares by iterative methods.
\newblock {Preprint} ANL/MSC--P644--0297, Mathematics and Computer Science
  Division, Argonne National Laboratory, Argonne, IL~60439, USA, February 1997.

\bibitem{ipm:Bach1}
R.~Bach.
\newblock {{\"U}ber die Effizienz eines polynomialen Verfahrens zur L{\"o}sung
  von linearen Optimierungsproblemen. (About the efficiency of a polynomial
  method for solving linear programming problems)}.
\newblock Master's thesis, {Fachbereich Wirtschaftswissenschaften und
  Operations Research, FernUniversit{\"a}t Hagen}, P. O. Box 940, D--5800
  Hagen, Germany, December 1990.
\newblock (In German).

\bibitem{ipm:Bachem1}
A.~Bachem and M.~Strietzel.
\newblock {Eine parallele Implementierung des Karmarkar--Verfahrens (A parallel
  implementation of Karmarkar's method)}.
\newblock {Technical Report} 92--121, Department of Mathematics, University of
  Cologne, Cologne, Germany, 1992.
\newblock (In German).

\bibitem{ipm:Bachem2}
A.~Bachem and M.~Strietzel.
\newblock {Einbettung der parallelen Grundsoftware CARO in die primale--duale
  Barrierfunktionsmethode (Imbedding of the parallel basic software CARO into
  the primal--dual barrier function method)}.
\newblock {Technical Report} 93--129, Department of Mathematics, University of
  Cologne, Cologne, Germany, 1993.
\newblock (In German).

\bibitem{ipm:Bagchi1}
A.~Bagchi and B.~Kalantari.
\newblock A method for computing approximate solution of the trust region
  problem with application to projective methods for quadratic programming.
\newblock {Working Paper}, Department of Computer Science, Rutgers University,
  New Brunswick, NJ~08903, USA, 1988.

\bibitem{ipm:Bahn1}
O.~Bahn, J.-L. Goffin, J.-Ph. Vial, and O.~Du Merle.
\newblock Implementation and behavior of an interior point cutting plane
  algorithm for convex programming\,: {An} application to geometric
  programming.
\newblock {Working Paper}, University of Geneva, Geneva, Switzerland, 1991.
\newblock See also Bahn et al.\,\cite{ipm:Bahn3}.

\bibitem{ipm:Bahn3}
O.~Bahn, J.-L. Goffin, J.-Ph. Vial, and O.~Du Merle.
\newblock Experimental behavior of an interior point cutting plane algorithm
  for convex programming\,:\,{An} application to geometric programming.
\newblock {\em Discrete Applied Mathematics}, 49:3--23, 1994.
\newblock See also Bahn et al.\,\cite{ipm:Bahn1}.

\bibitem{ipm:Bahn2}
O.~Bahn, O.~Du Merle, J.-L. Goffin, and J.-Ph. Vial.
\newblock A cutting plane method from analytic centers for stochastic
  programming.
\newblock {\em Mathematical Programming}, 69:45--73, 1995.

\bibitem{ipm:Bai1}
E.~Bai, Y.~Ye, and R.~Tempo.
\newblock Bounded error parameter estimation\,: {A} sequential analytic center
  approach.
\newblock {Technical Report}, Department of Management Science, University of
  Iowa, Iowa City, IA~52242, USA, 1997.

\bibitem{ipm:Balakrishnan1}
V.~Balakrishnan, E.~Feron, S.~Boyd, and L.~{El Ghaoui}.
\newblock Computing bounds for the structured singular value via interior point
  algorithm.
\newblock {\em Proceedings of the American Control Conference (Chicago, IL,
  USA, June 1992)}, 3:2195--2196, 1994.

\bibitem{ipm:Ballintijn1}
C.~Ballintijn.
\newblock Implementation aspects and performance results of the dual--affine
  algorithm.
\newblock {Talk held at the 14th Conference on the Mathematics of Operations
  Research in Dalfsen, The Netherlands}, Koninklijke Shell Laboratorium
  Amsterdam (KSLA), Amsterdam, The Netherlands, January 1990.
\newblock See Marsten et al.\,\cite{ipm:Marsten5}.

\bibitem{ipm:Barle1}
J.~Barle and J.~Grad.
\newblock The implementation of {Karmarkar's} algorithm using electronic
  spreadsheet.
\newblock {Talk held at the DGOR--Jahrestagung in Berlin, Germany}, Ekonomska
  Fakulteta Borisa Kidrica, University of Ljubljana, YU--61109~Ljubljana,
  Yugoslavia, September 1988.

\bibitem{ipm:Barle2}
J.~Barle and J.~Grad.
\newblock The implementations of interior point methods for solving {LP on PC}.
\newblock {\em Operations Research Proceedings 1992}, pages 26--33, 1992.

\bibitem{ipm:Barnes2}
E.~R. Barnes.
\newblock A sparse matrix version of {Karmarkar's} algorithm.
\newblock {Technical Report}, Department of Mathematical Sciences,
  IBM~T.~J.~Watson Research Center, P.\,O.\,Box 218, Yorktown Heights,
  NY~10598, USA, 1986.

\bibitem{ipm:Barnes1}
E.~R. Barnes.
\newblock A variation on {Karmarkar's} algorithm for solving linear programming
  problems.
\newblock {\em Mathematical Programming}, 36:174--182, 1986.

\bibitem{ipm:Barnes3}
E.~R. Barnes.
\newblock A polynomial--time version of the affine scaling algorithm.
\newblock {Talk held at the ORSA/TIMS Joint National Meeting in St.~Louis,
  USA}, Department of Mathematical Sciences, IBM~T.~J.~Watson Research Center,
  P.~O.~Box~218, Yorktown Heights, NY~10598, USA, October 1987.

\bibitem{ipm:Barnes5}
E.~R. Barnes.
\newblock Phase--{I} procedures for interior point problems.
\newblock {Talk held at the ORSA/TIMS Joint National Meeting in Washington, DC,
  USA}, Department of Mathematical Sciences, IBM~T.~J.~Watson Research Center,
  P.~O.~Box~218, Yorktown Heights, NY~10598, USA, April 1988.

\bibitem{ipm:Barnes4}
E.~R. Barnes.
\newblock The role of centering in interior point methods.
\newblock {Technical Report}, Department of Mathematical Sciences,
  IBM~T.~J.~Watson Research Center, P.~O.~Box~218, Yorktown Heights, NY~10598,
  USA, 1988.

\bibitem{ipm:Barnes7}
E.~R. Barnes.
\newblock Computing centers and minimum covering ellipsoids for polytopes.
\newblock {Talk held at the ORSA/TIMS Joint National Meeting in New York, NY,
  USA}, School of Industrial and Systems Engineering, Georgia Institute of
  Technology, Atlanta, GA~30322--0205, USA, October 1989.

\bibitem{ipm:Barnes6}
E.~R. Barnes.
\newblock Numerical techniques for interior point methods.
\newblock {Technical Report}, School of Industrial and Systems Engineering,
  Georgia Institute of Technology, Atlanta, GA~30322--0205, USA, 1989.

\bibitem{ipm:Barnes13}
E.~R. Barnes.
\newblock Some results concerning convergence of the affine scaling algorithm.
\newblock In J.~C. Lagarias and M.~J. Todd, editors, {\em Mathematical
  Developments Arising from Linear Programming\,: Proceedings of a Joint Summer
  Research Conference held at Bowdoin College, Brunswick, Maine, USA, June/July
  1988}, volume 114 of {\em Contemporary Mathematics}, pages 131--139. American
  Mathematical Society, Providence, Rhode Island, USA, 1990.

\bibitem{ipm:Barnes14}
E.~R. Barnes.
\newblock Minimum containing ellipsoids and regular polyhedra.
\newblock {\em Mathematical Programming Society Committee on Algorithms (COAL)
  Newsletter}, 19:2--6, August 1991.

\bibitem{ipm:Barnes9}
E.~R. Barnes, S.~Chopra, and D.~J. Jensen.
\newblock Polynomial--time convergence of the affine scaling algorithm with
  centering.
\newblock {Talk held at the Conference on Progress in Mathematical Programming,
  Asimolar Conference Center, Pacific Grove, CA, USA}, Department of
  Mathematical Sciences, IBM~T.~J.~Watson Research Center, P.~O.~Box~218,
  Yorktown Heights, NY~10598, USA, March 1987.

\bibitem{ipm:Barnes10}
E.~R. Barnes, S.~Chopra, and D.~J. Jensen.
\newblock The affine scaling method with centering.
\newblock {Technical Report}, Department of Mathematical Sciences,
  IBM~T.~J.~Watson Research Center, P.~O.~Box~218, Yorktown Heights, NY~10598,
  USA, 1988.

\bibitem{ipm:Barnes11}
E.~R. Barnes, S.~Chopra, and D.~J. Jensen.
\newblock A polynomial--time version of the affine--scaling algorithm.
\newblock {Working Paper Series} 88--101, Graduate School of Business and
  Administration, New York University, New York, NY~10006, USA, 1988.

\bibitem{ipm:Barnes8}
E.~R. Barnes and D.~J. Jensen.
\newblock Affine--scaling algorithms for linear programming with centering
  steps.
\newblock {Technical Report}, Department of Mathematical Sciences,
  IBM~T.~J.~Watson Research Center, P.~O.~Box~218, Yorktown Heights, NY~10598,
  USA, 1987.

\bibitem{ipm:Barnes12}
E.~R. Barnes and A.~Moretti.
\newblock On the convergence of the affine scaling algorithm.
\newblock {Technical Report}, School of Industrial and Systems Engineering,
  Georgia Institute of Technology, Atlanta, GA~30332--0205, USA, 1991.

\bibitem{ipm:Barutt1}
J.~F. Barutt, J.~A. Ludvijsen, and E.~M. Olsen.
\newblock Using the interior point method for solving large scale crew
  scheduling problems.
\newblock {Talk held at the ORSA/TIMS Joint National Meeting in Las Vegas, NV,
  USA}, Northwest Airlines F--7140, MSP International Airport, St.~Paul,
  MN~55111, USA, May 1990.

\bibitem{ipm:Batterman1}
A.~Batterman and M.~Heinkenschloss.
\newblock Preconditioners for {Karush--Kuhn--Tucker} matrices arising in the
  optimal control of distributed systems.
\newblock {Technical Report} TR~96--34, Department of Computational and Applied
  Mathematics, Rice University, Houston, TX~77251, USA, 1996.

\bibitem{ipm:Bayer4}
D.~A. Bayer, N.~K. Karmarkar, and J.~C. Lagarias.
\newblock Methods and apparatus for optimization system operational parameters.
\newblock U.~S.~Patent No.~4.744.027, 1988.
\newblock AT~\&~T Bell Laboratories, Murray Hill, NJ~07974, USA.

\bibitem{ipm:Bayer2}
D.~A. Bayer and J.~C. Lagarias.
\newblock The nonlinear geometry of linear programming, {Part\,I\,: Affine} and
  projective scaling trajectories.
\newblock {\em Transactions of the American Mathematical Society},
  314(2):499--526, 1989.

\bibitem{ipm:Bayer3}
D.~A. Bayer and J.~C. Lagarias.
\newblock The nonlinear geometry of linear programming, {Part\,II\,: Legendre}
  transform coordinates.
\newblock {\em Transactions of the American Mathematical Society},
  314(2):527--581, 1989.

\bibitem{ipm:Bayer1}
D.~A. Bayer and J.~C. Lagarias.
\newblock Karmarkar's linear programming algorithm and {N}ewton's method.
\newblock {\em Mathematical Programming}, 50:291--330, 1991.

\bibitem{ipm:Bazaraa1}
M.~S. Bazaraa, J.~J. Jarvis, and H.~F. Sherali.
\newblock {\em Linear Programming and Network Flows}, chapter 8.4\,:
  {Karmarkar's} projective algorithm, pages 380--394, chapter 8.5~: {A}nalysis
  of {Karmarkar's} algorithm, pages 394--418.
\newblock John Wiley \& Sons, New York, second edition, 1990.

\bibitem{ipm:Beasley1}
J.~E. Beasley.
\newblock {\em {Advances in Linear and Integer Programming}}, volume~4 of {\em
  Oxford Lecture Series in Mathematics and its Applications}.
\newblock Oxford Science Publications, Oxford University Press, Oxford, Great
  Britain, 1996.

\bibitem{ipm:Beck1}
C.~Beck.
\newblock Computational issues in solving {LMIs} (linear matrix inequalities).
\newblock {\em Proceedings of the 30th IEEE Conference on Decision and Control
  (Brighton, United Kingdom, December 1991)}, 2:1259--1260, 1991.

\bibitem{ipm:Beisel2}
E.~P. Beisel.
\newblock {Affin--transformierende global konvergente Innere--Punkte--Verfahren
  der linearen Optimierung mit langen Schrittweiten (Affine--scaling globally
  convergent long step interior--point methods for linear programming)}.
\newblock {Habilitationthesis}, Fachbereich Mathematik, Bergische
  Universit{\"a}t-- Gesamthochschule Wuppertal, Gauss--str. 20,
  D--42097~Wuppertal, Germany, 1996.
\newblock (In German).

\bibitem{ipm:Beisel1}
E.~P. Beisel and M.~Mendel.
\newblock {\em {Optimierungsmethoden des Operations Research, Band\,1
  (Optimization Methods of Operations Research, Vol.\,1)}}, chapter 11\,: {Die
  Projektionsmethode von Karmarkar~(The projection method of Karmarkar)}, pages
  169--187.
\newblock Vieweg Verlag, Braunschweig, Germany, 1987.
\newblock (In German).

\bibitem{ipm:Belegundu1}
A.~D. Belegundu, L.~Berke, and S.~N. Patnaik.
\newblock An optimization algorithm based on the method of feasible directions.
\newblock {\em Structural Optimization}, 9:83--88, 1995.

\bibitem{ipm:Bellavia1}
S.~Bellavia.
\newblock Inexact interior--point method.
\newblock {\em Journal of Optimization Theory and Applications}, 96:109--121,
  1998.

\bibitem{ipm:BenDaya3}
M.~{Ben--Daya}.
\newblock Line search techniques for the logarithmic barrier function in
  quadratic programming.
\newblock {\em Journal of the Operational Research Society}, 46:322--328, 1995.

\bibitem{ipm:BenDaya1}
M.~{Ben--Daya} and C.~M. Shetty.
\newblock Polynomial barrier function algorithm for linear programming.
\newblock {Technical Report} J~88--4, School of Industrial and Systems
  Engineering, Georgia Institute of Technology, Atlanta, GA~30322--0205, USA,
  1988.

\bibitem{ipm:BenDaya2}
M.~{Ben--Daya} and C.~M. Shetty.
\newblock Polynomial barrier function algorithm for convex quadratic
  programming.
\newblock {\em Arabian Journal for Science and Engineering}, 15(4):657--670,
  1990.

\bibitem{ipm:BenTal1}
A.~{Ben--Tal} and A.~S. Nemirovsky.
\newblock Interior point polynomial time method for truss topology design.
\newblock {Technical Report} 3/92, Optimization Laboratory, Faculty of
  Industrial Engineering and Management at Technion, Technion City,
  Haifa~32000, Israel, June 1992.

\bibitem{ipm:BenTal3}
A.~{Ben--Tal} and A.~S. Nemirovsky.
\newblock An interior point algorithm for truss topology design.
\newblock In M.~P. Bendsoe and C.~A. Soares, editors, {\em Topology Design of
  Structures}, pages 55--69. Kluwer Academic Publishers, Dordrecht, The
  Netherlands, 1993.

\bibitem{ipm:BenTal2}
A.~{Ben--Tal} and A.~S. Nemirovsky.
\newblock Potential reduction polynomial time method for truss topology design.
\newblock {\em SIAM Journal on Optimization}, 4:596--612, 1994.

\bibitem{ipm:BenTal7}
A.~{Ben--Tal} and A.~S. Nemirovsky.
\newblock Structural design via semidefinite programming.
\newblock {Working Paper}, Optimization Laboratory, Faculty of Industrial
  Engineering and Management Technion -- Israel Institute of Technology,
  Technion City, Haifa~32000, Israel, August 1997.

\bibitem{ipm:BenTal8}
A.~{Ben--Tal} and A.~S. Nemirovsky.
\newblock On polyhedral approximations of the second--order cone.
\newblock {Research Report} 3/98, Optimization Laboratory, Faculty of
  Industrial Engineering and Management Technion -- Israel Institute of
  Technology, Technion City, Haifa~32000, Israel, 1998.

\bibitem{ipm:BenTal9}
A.~{Ben--Tal} and A.~S. Nemirovsky.
\newblock On the quality of {SDP} approximations of uncertain {SDP} programs.
\newblock {Research Report} 4/98, Optimization Laboratory, Faculty of
  Industrial Engineering and Management Technion -- Israel Institute of
  Technology, Technion City, Haifa~32000, Israel, 1998.

\bibitem{ipm:BenTal5}
A.~{Ben--Tal} and G.~Roth.
\newblock A truncated log barrier algorithm for large--scale convex programming
  and minimax problems\,: {Implementation} and computational results.
\newblock {\em Optimization Methods and Software}, 6:283--312, 1996.

\bibitem{ipm:BenTal6}
A.~{Ben--Tal} and M.~Zibulevsky.
\newblock Penalty/barrier multipliers methods\,: {A} new class of augmented
  {Lagrangian} algorithms for large--scale convex programming problems.
\newblock {Research Report} 4/93, Optimization Laboratory, Faculty of
  Industrial Engineering and Management, Technion, Israel Institute of
  Technology, Haifa~32000, Israel, 1993.

\bibitem{ipm:BenTal4}
A.~{Ben--Tal}, M.~Zibulevsky, and I.~Yusefovich.
\newblock Penalty/barriers multipliers methods for minimax and constrained
  smooth convex programs.
\newblock {Research Report} 9/92, Optimization Laboratory, Faculty of
  Industrial Engineering and Management, Technion, Israel Institute of
  Technology, Haifa, Israel, 1992.

\bibitem{ipm:Benchakroun1}
A.~Benchakroun, J.~P. Dussault, and A.~Mansouri.
\newblock Local convergence analysis of the method of centers.
\newblock {Talk held at the Fourth SIAM Conference on Optimization in Chicago,
  IL, USA}, Universite de Sherbrooke, Sherbrooke, Canada, May 1992.

\bibitem{ipm:Benchakroun2}
A.~Benchakroun, J.~P. Dussault, and A.~Mansouri.
\newblock Un algorithme de points interieurs pour un probleme de programmation
  non--lineaire.
\newblock {\em Information Systems and Operational Research (INFORS)},
  35:239--248, 1997.

\bibitem{ipm:Benjamin1}
J.~Benjamin and M.~Dialsy.
\newblock Some applications of the primal--dual interior point algorithm using
  {GAUSS} programming language.
\newblock {Talk held at the ORSA/TIMS Joint National Meeting in Philadelphia,
  PA, USA}, Economics Department, North Carolina A\,\&\,T State University,
  Greensboro, NC~27411, USA, October 1990.

\bibitem{ipm:Benson1}
S.~Benson, Y.~Ye, and X.~Zhang.
\newblock Solving large--scale sparse semidefinite programs for combinatorial
  optimization.
\newblock {Working Paper}, Department of Management Science, University of
  Iowa, Iowa City, IA~52242, USA, August 1997.

\bibitem{ipm:Benson2}
S.~Benson, Y.~Ye, and X.~Zhang.
\newblock Mixed linear and semidefinite programming for combinatorial and
  quadratic optimization.
\newblock {Working Paper}, Applied Mathematics and Computer SCiences,
  University of Iowa, Iowa City, IA~52242, USA, February 1998.

\bibitem{ipm:Bentham1}
{H. van} Bentham, A.~Hipolito, B.~Jansen, C.~Roos, T.~Terlaky, and J.~Warners.
\newblock Radio link frequency assignment project\,: {Potential} reduction
  methods.
\newblock {Technical Annex} T--2.3.2, Faculty of Technical Mathematics and
  Informatics, Delft University of Technology, Delft, The Netherlands, 1995.

\bibitem{ipm:Berger1}
A.~J. Berger, J.~M. Mulvey, and A.~Ruszczynski.
\newblock An extension of the {DQA} algorithm to convex stochastic programs.
\newblock {\em SIAM Journal on Optimization}, 4:735--753, 1994.

\bibitem{ipm:Berke1}
L.~Berke, N.~Khot, R.~Polyak, and R.~Schneur.
\newblock Application of the {Newton} modified barrier method in structural
  optimizations.
\newblock {\em Proceedings of the 33rd American Institute of Aeronautics and
  Astronautics (AIAA) Conference}, 1992.

\bibitem{ipm:Berkelaar3}
A.~Berkelaar, C.~Roos, and T.~Terlaky.
\newblock The optimal set and optimal partition approach for linear and
  quadratic programming.
\newblock In T.~Gal and H.~J. Greenberg, editors, {\em Advances in Sensitivity
  Analysis and Parametric Programming}, volume~6 of {\em International Series
  in Operations Research and Management Science}, pages 6.1--6.44. Kluwer
  Academic Press, Dordrecht, The Netherlands, 1997.

\bibitem{ipm:Berkelaar2}
A.~B. Berkelaar, B.~Jansen, C.~Roos, and T.~Terlaky.
\newblock Optimal basis and optimal tripartition identification algorithms for
  quadratic programming and linear complementarity problems -- from an interior
  solution to a basis solution and vice versa.
\newblock {Technical Report}, Faculty of Technical Mathematics and Informatics,
  TU Delft, NL--2600~GA~Delft, The Netherlands, March 1996.

\bibitem{ipm:Berkelaar1}
A.~B. Berkelaar, B.~Jansen, C.~Roos, and T.~Terlaky.
\newblock Sensitivity analysis for degenerate quadratic programming.
\newblock {Technical Report}, Faculty of Technical Mathematics and Informatics,
  TU Delft, NL--2600~GA~Delft, The Netherlands, February 1996.

\bibitem{ipm:Bertsekas1}
D.~P. Bertsekas.
\newblock Projected {N}ewton methods for optimization problems with simple
  constraints.
\newblock {\em SIAM Journal on Control and Optimization}, 20:221--246, 1982.

\bibitem{ipm:Bertsimas1}
D.~Bertsimas and X.~Luo.
\newblock On the worst case complexity of potential reduction algorithms for
  linear programming.
\newblock {\em Mathematical Programming}, 77:321--333, 1997.

\bibitem{ipm:Bertsimas3}
D.~Bertsimas and J.~B. Orlin.
\newblock A technique for speeding up the solution of the {Lagrangian} dual.
\newblock {\em Mathematical Programming}, 63:23--45, 1994.

\bibitem{ipm:Bertsimas2}
D.~Bertsimas and J.~Tsitsiklis.
\newblock {\em Introduction to Linear Optimization}.
\newblock Athena Scientific, 1997.

\bibitem{ipm:Betke1}
U.~Betke and P.~Gritzmann.
\newblock Projection algorithms for linear programming.
\newblock {\em European Journal of Operational Research}, 60:287--295, 1992.

\bibitem{ipm:Biegler1}
L.~Biegler, J.~Nocedal, C.~Schmitt, and D.~Ternet.
\newblock Numerical experience with a reduced {Hessian} method for large scale
  optimization.
\newblock {Technical Report} OTC\,97/06, Optimization Technology Center,
  Northwestern University, Evanston, IL~60208--3119, USA, July 1997.

\bibitem{ipm:Billups1}
S.~C. Billups and S.~C. Ferris.
\newblock Convergence of infeasible interior--point algorithms from arbitrary
  starting points.
\newblock {\em SIAM Journal on Optimization}, 6:316--325, 1996.

\bibitem{ipm:Birge3}
J.~R. Birge, R.~M. Freund, and R.~J. Vanderbei.
\newblock Prior reduced fill--in in solving equations in interior point
  algorithm.
\newblock {Working Paper} OR~3186--90--MS, Sloan School of Management,
  Massachusetts Institute of Technology, Cambridge, MA~02139, USA, 1990.
\newblock See also Birge, Freund and Vanderbei \cite{ipm:Birge7}.

\bibitem{ipm:Birge7}
J.~R. Birge, R.~M. Freund, and R.~J. Vanderbei.
\newblock Prior reduced fill--in in solving equations in interior point
  algorithms.
\newblock {\em Operations Research Letters}, 11:195--198, 1992.

\bibitem{ipm:Birge5}
J.~R. Birge and D.~Holmes.
\newblock Using interior point methods for stochastic linear programming.
\newblock {Talk held at the ORSA/TIMS Joint National Meeting in Anaheim, CA,
  USA}, Department of Industrial and Operations Engineering, University of
  Michigan, Ann Arbor, MI~48104, USA, November 1991.
\newblock See Birge and Holmes \cite{ipm:Birge6}.

\bibitem{ipm:Birge6}
J.~R. Birge and D.~F. Holmes.
\newblock Efficient solution of two stage stochastic linear programs using
  interior point methods.
\newblock {\em Computational Optimization and Applications}, 1:245--276, 1992.

\bibitem{ipm:Birge1}
J.~R. Birge and L.~Qi.
\newblock Solving stochastic linear programs via a variant of {Karmarkar's}
  algorithm.
\newblock {Technical Report} 85--12, Department of Industrial and Operations
  Engineering, University of Michigan, Ann Arbor, MI~48103, USA, 1985.

\bibitem{ipm:Birge2}
J.~R. Birge and L.~Qi.
\newblock Computing block--angular {Karmarkar} projections with applications to
  stochastic programming.
\newblock {\em Management Science}, 34:1472--1479, 1988.

\bibitem{ipm:Birge4}
J.~R. Birge and C.~Rosa.
\newblock A simplified proof of the general convergence of affine scaling.
\newblock {Technical Report} 91--7, Department of Industrial and Operations
  Engineering, University of Michigan, Ann Arbor, MI~48104, USA, 1991.

\bibitem{ipm:Birge8}
J.~R. Birge and H.~Tang.
\newblock Computing {Karmarkar's} projections quickly by using matrix
  factorization.
\newblock {\em Applied Mathematics, A Journal of the Chinese Universities
  (Series B)}, 11:227--248, 1996.

\bibitem{ipm:Bisseling1}
R.~H. Bisseling, T.~M. Doup, and {L. D. J. C.} Loyens.
\newblock A parallel interior point algorithm for linear programming on a
  network of transputers.
\newblock {\em Annals of Operations Research}, 43:51--86, 1993.

\bibitem{ipm:Bixby1}
R.~E. Bixby, J.~W. Gregory, I.~J. Lustig, R.~E. Marsten, and D.~F. Shanno.
\newblock Very large--scale linear programming\,: {A} case study in combining
  interior point and simplex methods.
\newblock {\em Operations Research}, 40:885--897, 1992.

\bibitem{ipm:Bixby2}
R.~E. Bixby and M.~J. Saltzman.
\newblock Recovering an optimal {LP} basis from an interior point solution.
\newblock {\em Operations Research Letters}, 15:169--178, 1994.

\bibitem{ipm:Blair1}
C.~E. Blair.
\newblock The iterative step in the linear programming algorithm of {N.
  Karmarkar}.
\newblock {\em Algorithmica}, 1(4):537--539, 1986.

\bibitem{ipm:Blair2}
C.~E. Blair.
\newblock {Karmarkar's} algorithm and the simplex algorithm.
\newblock {Technical Report}, College of Commerce and Business Administration,
  University of Illinois at Urbana--Champaign, Urbana, IL~61820, USA, 1989.

\bibitem{ipm:Blanchon1}
G.~Blanchon, J.-C. Dodu, A.~Renaud, and M.~Bouhtou.
\newblock Implementation of a primal--dual interior--point method applied to
  the planning of reactive power compensation devices.
\newblock {\em Proceedings of the Twelfth Power Systems Computation
  Conference}, 2:827--836, 1996.

\bibitem{ipm:Bloch1}
A.~M. Bloch.
\newblock Steepest descent, linear programming, and {Hamiltonian} flows.
\newblock In J.~C. Lagarias and M.~J. Todd, editors, {\em Mathematical
  Developments Arising from Linear Programming\,: Proceedings of a Joint Summer
  Research Conference held at Bowdoin College, Brunswick, Maine, USA, June/July
  1988}, volume 114 of {\em Contemporary Mathematics}, pages 77--88. American
  Mathematical Society, Providence, Rhode Island, USA, 1990.

\bibitem{ipm:Blum1}
L.~Blum.
\newblock Towards an asymptotic analysis of {Karmarkar's} algorithm.
\newblock {\em Information Processing Letters}, 23:189--194, 1986.

\bibitem{ipm:Blum2}
L.~Blum.
\newblock A new simple homotopy algorithm for linear programming {I}.
\newblock {\em Journal of Complexity}, 4:124--136, 1988.

\bibitem{ipm:Boggs4}
P.~T. Boggs.
\newblock Comparing algorithms is not an easy task.
\newblock {\em SIAM News}, 19(1):7, 1986.

\bibitem{ipm:Boggs3}
P.~T. Boggs.
\newblock Higher--order methods for large linear and quadratic programming
  problems.
\newblock {Talk held at the Second International Conference on Industrial and
  Applied Mathematics (ICIAM~'91), Washington, DC, USA}, United States
  Department of Commerce, National Institute of Standards and Technology,
  Center for Applied Mathematics, Gaithersburg, MD~20899, USA, July 1991.

\bibitem{ipm:Boggs6}
P.~T. Boggs.
\newblock Interior point methods.
\newblock {Technical Report}, United States Department of Commerce, National
  Institute of Standards and Technology, Center for Applied Mathematics,
  Gaithersburg, MD~20899, USA, 1995.
\newblock To appear in {\em Encyclopedia of Operations Research}.

\bibitem{ipm:Boggs2}
P.~T. Boggs, P.~D. Domich, J.~R. Donaldson, and C.~Witzgall.
\newblock Algorithmic enhancements to the method of center for linear
  programming.
\newblock {\em ORSA Journal on Computing}, 1:159--171, 1989.

\bibitem{ipm:Boggs5}
P.~T. Boggs, P.~D. Domich, J.~E. Rogers, and C.~Witzgall.
\newblock An interior--point method for linear and quadratic programming
  problems.
\newblock {\em Mathematical Programming Society Committee on Algorithms (COAL)
  Newsletter}, 19:32--40, August 1991.

\bibitem{ipm:Boggs7}
P.~T. Boggs, P.~D. Domich, J.~E. Rogers, and C.~Witzgall.
\newblock An interior--point method for general large scale quadratic
  programming problems.
\newblock {\em Annals of Operations Research}, 62:419--437, 1996.

\bibitem{ipm:Boggs1}
P.~T. Boggs, P.~D. Domich, and C.~Witzgall.
\newblock On center trajectories for linear programming.
\newblock {Technical Report}, United States Department of Commerce, National
  Institute of Standards and Technology, Center for Applied Mathematics,
  Gaithersburg, MD~20899, USA, 1988.

\bibitem{ipm:Bonnans1}
J.~F. Bonnans and M.~Bouhtou.
\newblock An interior point affine algorithm for convex programming based on a
  potential function.
\newblock {Talk held at the Fourth SIAM Conference on Optimization in Chicago,
  IL, USA}, Institute National de Recherche en Informatique et Automatique
  (INRIA), F--78153~Roquencourt, France, May 1992.

\bibitem{ipm:Bonnans2}
J.~F. Bonnans and M.~Bouhtou.
\newblock The trust region affine interior point algorithm for convex and
  nonconvex quadratic programming.
\newblock {\em R.A.I.R.O. Recherche Operationnelle/Operations Research},
  29:195--217, 1995.

\bibitem{ipm:Bonnans7}
J.~F. Bonnans, J.~C. Gilbert, C.~Lemar{\'e}chal, and C.~Sagastiz{\'a}bal.
\newblock {\em {Optimisation Num{\'e}rique\, : Aspects Th{\'e}oriques et
  Pratiques}}, volume 257 of {\em Math{\'e}matique \& Applications}, chapter
  {Part\,IV\,: Algorithmes de points int{\'e}rieurs pour l'optimisation
  lin{\'e}aire et quadratique (Interior point algorithms for linear and
  quadratic optimization)}, pages 203--310.
\newblock Springer Verlag, Paris, France, 1997.
\newblock (In French).

\bibitem{ipm:Bonnans3}
J.~F. Bonnans and C.~C. Gonzaga.
\newblock Convergence of interior--point algorithms for the monotone linear
  complementarity problem.
\newblock {\em Mathematics of Operations Research}, 21:1--25, 1996.

\bibitem{ipm:Bonnans4}
J.~F. Bonnans and C.~Pola.
\newblock A trust region interior point algorithm for linearly constrained
  optimization.
\newblock {\em SIAM Journal on Optimization}, 7:717--731, 1997.

\bibitem{ipm:Bonnans6}
J.~F. Bonnans and F.~A. Potra.
\newblock Infeasible path--following algorithms for linear complementarity
  problems.
\newblock {Reports on Computational Mathematics}~63, Department of Mathematics,
  The University of Iowa, Iowa City, IA~52242, USA, 1994.
\newblock To appear in {\em Mathematics of Operations Research}. See also Potra
  and Bonnans \cite{ipm:Potra12}.

\bibitem{ipm:Bonnans5}
J.~F. Bonnans and F.~A. Potra.
\newblock On the convergence of the iteration sequence of infeasible
  path--following algorithms for linear complementarity problems.
\newblock {\em Mathematics of Operations Research}, 22:378--407, 1997.

\bibitem{ipm:Borchers2}
B.~Borchers.
\newblock {\em Improved branch and bound algorithms for integer programming}.
\newblock PhD thesis, Department of Mathematical Sciences, Rensselaer
  Polytechnic Institute, Troy, NY~12180--3590, USA, June 1992.

\bibitem{ipm:Borchers3}
B.~Borchers.
\newblock {CSDP}\,: {A C} library for semidefinite programming.
\newblock {Technical Report}, Faculty of Mathematics, Institute of Mining and
  Technology, New Mexico Tech, Socorro, NM, USA, 1997.

\bibitem{ipm:Borchers5}
B.~Borchers.
\newblock {SDPLIB\,1.0}\,: {A} collection of semidefinite programming test
  problems.
\newblock {Technical Report}, Faculty of Mathematics, Institute of Mining and
  Technology, New Mexico Tech, Socorro, NM, USA, July 1998.

\bibitem{ipm:Borchers1}
B.~Borchers and J.~E. Mitchell.
\newblock Using an interior point method in a branch and bound algorithm for
  integer programming.
\newblock {RPI Mathematical Report} 195, Department of Mathematical Sciences,
  Rensselaer Polytechnic Institute, Troy, NY~12180--3590, USA, 1991.
\newblock Revised July 1992.

\bibitem{ipm:Borchers4}
B.~Borchers and J.~E. Mitchell.
\newblock A computational comparison of branch and bound and outer
  approximation algorithms for $0--1$ mixed integer nonlinear programs.
\newblock {\em Computers and Operations Research}, 24:699--701, 1997.

\bibitem{ipm:Bosch3}
R.~A. Bosch.
\newblock On {Mizuno's} rank one updating algorithm for linear programming.
\newblock {\em SIAM Journal on Optimization}, 3:861--867, 1993.

\bibitem{ipm:Bosch4}
R.~A. Bosch.
\newblock A new proof of a partial updating theorem.
\newblock {Technical Report}, Department of Mathematics, Oberlin College,
  Oberlin, OH~44074, USA, 1995.

\bibitem{ipm:Bosch2}
R.~A. Bosch and K.~M. Anstreicher.
\newblock On partial updating in a potential reduction linear programming
  algorithm of {Kojima, Mizuno and Yoshise}.
\newblock {\em Algorithmica}, 9(1):184--197, 1993.
\newblock Same as Anstreicher and Bosch \cite{ipm:Anstreicher21}.

\bibitem{ipm:Bosch1}
R.~A. Bosch and K.~M. Anstreicher.
\newblock A partial updating algorithm for linear programs with many more
  variables than constraints.
\newblock {\em Optimization Methods and Software}, 4:243--257, 1995.

\bibitem{ipm:Bosch5}
R.~A. Bosch and R.~V. Torenbeek.
\newblock A family of algorithms for approximating the smallest eigenvalue of a
  matrix with no complex eigenvalues.
\newblock {Technical Report}, Department of Mathematics, Oberlin College,
  Oberlin, OH~44074, USA, 1995.

\bibitem{ipm:Bouhtou1}
M.~Bouhtou.
\newblock {\em M{\'e}thodes de points int{\'e}rieurs pour l'optimisation des
  syst{\`e}mes de grande taille ({Interior point methods for large--scale
  optimization systems})}.
\newblock PhD thesis, Laboratoire de Analyse et Modelisation de Syst{\`e}mes
  pour l'Aide a la Decision (LAMSADE), Universit{\'e} de Paris Dauphine,
  F--75775~Paris~Cedex~16, France, 1993.
\newblock (In French).

\bibitem{ipm:Boukari1}
D.~Boukari and A.~V. Fiacco.
\newblock Survey of penalty, exact penalty and multiplier methods from 1968 to
  1993.
\newblock {\em Optimization}, 30:301--334, 1995.

\bibitem{ipm:Box1}
M.~J. Box, D.~Davies, and W.~H. Swann.
\newblock {\em Nonlinear Optimization Technique}, volume~5 of {\em ICI
  Monograph of Mathematics and Statistics}.
\newblock Oliver and Boyd Ltd., London, United Kingdom, 1969.

\bibitem{ipm:Boyd1}
S.~Boyd and L.~{El Ghaoui}.
\newblock Methods of centers for minimizing generalized eigenvalues.
\newblock {\em Linear Algebra and Its Applications}, 188/189:63--111, 1993.

\bibitem{ipm:Boyd3}
S.~Boyd, L.~{El Ghaoui}, 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 of Industrial and Applied Mathematics (SIAM), Philadelphia,
  PA~19101, USA, 1994.

\bibitem{ipm:Boyd4}
S.~Boyd and L.~Vandenberghe.
\newblock {CRCD} program\,: {Convex} optimization for engineering analysis and
  design.
\newblock {\em Proceedings of the 1995 American Control Conference}, Part
  2/6:1069--1071, 1995.

\bibitem{ipm:Boyd2}
S.~Boyd, L.~Vandenberghe, and M.~Grant.
\newblock Efficient convex optimization for engineering design.
\newblock {ISL--Report}, Department of Electrical Engineering, Information
  Systems Laboratory, Stanford University, Stanford, CA~94305, USA, 1994.
\newblock Submitted to {\em Automatica}.

\bibitem{ipm:Branch1}
M.~A. Branch, T.~F. Coleman, and Y.~Li.
\newblock A subspace, interior, and conjugate gradient method for large--scale
  bound--constrained minimization problems.
\newblock {Technical Report} TR~95--1525, Department of Computer Science,
  Cornell University, Ithaca, NY~14853, USA, 1995.

\bibitem{ipm:Bregman1}
L.~M. Bregman.
\newblock A polynomial--time simplex type method for solving linear systems of
  inequalities.
\newblock {\em Kibernetika (Kiev)}, 26(1):84--87, 1990.
\newblock Translated in\,: {\em Cybernetics (USA)}, 26(1):106--110, 1990.

\bibitem{ipm:Breitfeld3}
M.~G. Breitfeld and D.~F. Shanno.
\newblock A globally convergent penalty--barrier algorithm for nonlinear
  programming and its computational performance.
\newblock {Research Report} RRR~12--94, RUTCOR\,--\,Rutgers Center for
  Operations Research, Rutgers University, Busch Campus, New Brunswick,
  NJ~08903, USA, 1994.
\newblock Submitted to {\em Mathematical Programming}.

\bibitem{ipm:Breitfeld1}
M.~G. Breitfeld and D.~F. Shanno.
\newblock Preliminary computational experience with modified log--barrier
  functions for large--scale nonlinear programming.
\newblock In W.~W. Hager, D.~W. Hearn, and P.~M. Pardalos, editors, {\em
  Large--Scale Optimization\,: The State--of--the --Art}, pages 45--67. Kluwer
  Academic Publishers, Dordrecht, The Netherlands, 1994.

\bibitem{ipm:Breitfeld2}
M.~G. Breitfeld and D.~F. Shanno.
\newblock Computational experience with penalty--barrier methods for nonlinear
  programming.
\newblock {\em Annals of Operations Research}, 62:439--463, 1996.

\bibitem{ipm:Brophy1}
J.~F. Brophy and P.~W. Smith.
\newblock Prototyping {Karmarkar's} algorithm using {MATH/PROTRAN}.
\newblock {\em International Mathematical and Statistical Libraries (IMSL)
  Directions}, 5:2--3, 1988.

\bibitem{ipm:Brown2}
G.~G. Brown, R.~D. McBride, and K.~R. Wood.
\newblock Computational methods in the projective linear programming algorithm.
\newblock {Talk held at the ORSA/TIMS Joint National Meeting in Atlanta, GA,
  USA}, Department of Operations Research, Naval Postgraduate School, Monterey,
  CA~93943, USA, November 1985.

\bibitem{ipm:Brown1}
G.~W. Brown and T.~C. Koopmans.
\newblock Computational suggestions for maximizing a linear function subject to
  linear inequalities.
\newblock In T.~C. Koopmans, editor, {\em Activity Analysis of Production and
  Allocation}, pages 377--380. John Wiley \& Sons, New York, 1951.

\bibitem{ipm:Burer1}
S.~Burer and R.~D.~C. Monteiro.
\newblock An efficient algorithm for solving the {MAXCUT} {SDP} relaxation.
\newblock {Manuscript}, School of Industrial and Systems Engineering, Georgia
  Institute of Technology, Atlanta, GA~30332--0205, USA, December 1998.

\bibitem{ipm:Burke1}
J.~V. Burke, A.~A. Goldstein, P.~Tseng, and Y.~Ye.
\newblock Translational cuts for convex minimization.
\newblock In P.~M. Pardalos, editor, {\em Complexity in Numerical
  Optimization}, pages 57--73. World Scientific Publishing Co., London, United
  Kingdom, 1993.

\bibitem{ipm:Burke2}
J.~V. Burke and S.~R. Xu.
\newblock The global linear convergence of a non--interior path--following
  algorithm for linear complementarity problems.
\newblock {Technical Report}, Department of Mathematics, University of
  Washington, Seattle, WA~98195, USA, December 1996.

\bibitem{ipm:Byrd1}
R.~Byrd, J.~C. Gilbert, and J.~Nocedal.
\newblock A trust region method based on interior point technique for nonlinear
  programming.
\newblock {Technical Report} OTC\,96--02, Optimization Technology Center,
  Northwestern University, Evanston, IL~60208--3119, USA, 1996.

\bibitem{ipm:Byrd2}
R.~Byrd, M.~B. Hribar, and J.~Nocedal.
\newblock An interior point algorithm for large scale nonlinear programming.
\newblock {Technical Report} OTC\,97/05, Optimization Technology Center,
  Northwestern University, Evanston, IL~60208--3119, USA, July 1997.

\bibitem{ipm:Byrd3}
R.~Byrd, G.~Liu, and J.~Nocedal.
\newblock On the local behavior of an interior point method for nonlinear
  programming.
\newblock {Technical Report} OTC\,98/02, Optimization Technology Center,
  Northwestern University, Evanston, IL~60208--3119, USA, January 1998.
\newblock To appear in {\em Proceedings of the 1997 Dundee Conference on
  Numerical Analysis}.

\bibitem{ipm:Cao1}
M.~Cao and M.~C. Ferris.
\newblock Interior--point algorithms for monotone affine variational
  inequalities.
\newblock {\em Journal of Optimization Theory and Applications}, 83:269--283,
  1994.

\bibitem{ipm:Carmona1}
R.~A. Carmona and S.~Zhong.
\newblock Interior point methods for sea--bottom image enhancement.
\newblock {\em Proceedings of the Detection and Remediation Technologies for
  Mines and Minelike Targets}, pages 132--137, 1997.

\bibitem{ipm:Carolan1}
W.~Carolan, J.~Hill, J.~Kennington, S.~Niemi, and S.~Wichmann.
\newblock An empirical evaluation of the {KORBX} algorithms for military
  airlift applications.
\newblock {\em Operations Research}, 38:240--248, 1990.

\bibitem{ipm:Caroll1}
C.~W. Caroll.
\newblock The created response surface technique for optimizing nonlinear
  restrained systems.
\newblock {\em Operations Research}, 9(2):169--184, 1961.

\bibitem{ipm:Caron1}
R.~J. Caron and W.~T. Obuchowska.
\newblock Quadratically constrained convex quadratic programmes\,:\,{Faulty}
  feasible regions.
\newblock {Windsor Mathematics StatisticsReport} WMSR 92--05, Department of
  Mathematics, University of Windsor, Windsor, Ontario, Canada~N9B\,3P4, August
  1992.

\bibitem{ipm:Carpenter4}
T.~J. Carpenter.
\newblock {\em Practical interior--point methods for quadratic programming}.
\newblock PhD thesis, School of Engineering and Applied Science, Department of
  Civil Engineering and Operations Research, Princeton University, Princeton,
  NJ~08544, USA, 1992.

\bibitem{ipm:Carpenter1}
T.~J. Carpenter, I.~J. Lustig, J.~M. Mulvey, and D.~F. Shanno.
\newblock A primal--dual interior point method for convex separable nonlinear
  programs.
\newblock {RUTCOR Research Report} RRR~25--90, RUTCOR\,--\,Rutgers Center for
  Operations Research, Hill Center for Mathematical Sciences, New Brunswick,
  NJ~08903, USA, May 1990.
\newblock Technical Report SOR~90--02, School of Engineering and Applied
  Science, Department of Civil Engineering and Operations Research, Princeton
  University, Princeton, NJ~08544, USA, 1990.

\bibitem{ipm:Carpenter2}
T.~J. Carpenter, I.~J. Lustig, J.~M. Mulvey, and D.~F. Shanno.
\newblock Higher order predictor--corrector interior point methods with
  application to quadratic objectives.
\newblock {\em SIAM Journal on Optimization}, 3:696--725, 1993.

\bibitem{ipm:Carpenter3}
T.~J. Carpenter, I.~J. Lustig, J.~M. Mulvey, and D.~F. Shanno.
\newblock Separable quadratic programming via primal--dual interior point
  method and its use in a sequential procedure.
\newblock {\em ORSA Journal on Computing}, 5:182--191, 1993.

\bibitem{ipm:Carpenter5}
T.~J. Carpenter and D.~F. Shanno.
\newblock An interior point method for quadratic programs based on conjugate
  projected gradients.
\newblock {\em Computational Optimization and Applications}, 2:5--28, 1993.

\bibitem{ipm:Castillo1}
I.~Castillo and E.~R. Barnes.
\newblock On the convergence of the affine scaling linear programming
  algorithm.
\newblock {Technical Report}, School of Industrial and Systems Engineering,
  Georgia Institute of Technology, Atlanta, GA~30332--0205, USA, April 1995.

\bibitem{ipm:Castro4}
J.~Castro.
\newblock An implementation of a higher--order primal--dual interior point
  algorithm using a predictor--corrector method for linear programming.
\newblock {\em Q{\"u}estii{\'o}}, 22:103--116, 1998.
\newblock (In Spanish, English summary).

\bibitem{ipm:Castro5}
J.~Castro.
\newblock An interior--point algorithm for quadratic programming through
  separable equivalent problems.
\newblock {\em Q{\"u}estii{\'o}}, 22:117--142, 1998.
\newblock (In Spanish, English summary).

\bibitem{ipm:Castro3}
J.~Castro.
\newblock A specialized interior point algorithm for multicommodity flows.
\newblock {Manuscript}, Department of Statistics and Operations Research,
  Universitat Rovira i Virgili, E--43006\,Tarragona, Spain, July 1998.

\bibitem{ipm:Castro1}
J.~Castro and N.~Nabona.
\newblock An implementation of linear and nonlinear multicommodity network
  flows.
\newblock {\em European Journal of Operational Research}, 92:37--53, 1996.

\bibitem{ipm:Castro2}
J.~Castro and N.~Nabona.
\newblock Primal--dual interior point method for multicommodity network flows
  with side constraints and comparison with alternative methods.
\newblock In J.~Dolezal et~al., editor, {\em System Modelling and Optimization
  (Proceedings of the 17th IFIP Conference, Prague, Czech Republic, July
  1995)}, pages 451--458. Chapman \& Hall, London, Great Britain, 1996.

\bibitem{ipm:Cavalier1}
T.~M. Cavalier and T.~C. Schall.
\newblock Implementing a projective algorithm for solving inequality
  constrained linear programs.
\newblock {IMSE Working Paper} 86--128, Department of Industrial and Management
  Systems Engineering, Pennsylvania State University, University Park,
  PA~16802, USA, 1986.

\bibitem{ipm:Cavalier2}
T.~M. Cavalier and T.~C. Schall.
\newblock Implementing an affine scaling algorithm for linear programming.
\newblock {\em Computers and Operations Research}, 14:341--347, 1987.

\bibitem{ipm:Cavalier3}
T.~M. Cavalier and A.~L. Soyster.
\newblock Some computational experience and a modification of the {Karmarkar}
  algorithm.
\newblock {Working Paper} 85--105, Department of Industrial and Management
  Systems Engineering, Pennsylvania State University, University Park,
  PA~16802, USA, 1985.

\bibitem{ipm:Cazzol1}
M.~V. Cazzol, A.~Garzillo, M.~Innorta, N.~Losignore, and P.~Marannino.
\newblock The solution of the voltage/reactive security problems in {VAr}
  planning and in operation scheduling by the dual affine {Karmarkar}
  algorithm.
\newblock {\em Proceedings of the Eleventh Powr Systems Computation Conference
  (Zurich, Switzerland, 1993)}, 1:403--409, 1994.

\bibitem{ipm:Censor3}
Y.~Censor, A.~N. Iusem, and S.~A. Zenios.
\newblock An interior point method with {Bregman} functions for the variational
  inequality problem with paramonotone operators.
\newblock {\em Mathematical Programming}, 81:373--400, 1998.

\bibitem{ipm:Censor1}
Y.~Censor and A.~Lunt.
\newblock Optimization on '$log~x$' entropy over linear inequality constraints.
\newblock {\em SIAM Journal on Control and Optimization}, 25:921--933, 1987.

\bibitem{ipm:Censor2}
Y.~Censor and S.~A. Zenios.
\newblock {\em Parallel Optimization\,: Theory, Algorithms, and Applications}.
\newblock Oxford University Press, New York, NY, USA, 1997.

\bibitem{ipm:Chandru3}
V.~Chandru.
\newblock Notes on {Karmarkar's} new algorithm for linear programming.
\newblock {Unpublished Memorandum}, Department of Industrial Engineering,
  Purdue University, West Lafayette, IN~47907, USA, 1984.

\bibitem{ipm:Chandru1}
V.~Chandru and B.~Kochar.
\newblock A class of algorithms for linear programming.
\newblock {Research Memorandum} 85--14, Department of Industrial Engineering,
  Purdue University, West Lafayette, IN~47907, USA, 1985.
\newblock Revised 1986.

\bibitem{ipm:Chandru2}
V.~Chandru and B.~Kochar.
\newblock Exploiting special structures using a variant of {Karmarkar's}
  algorithm.
\newblock {Research Memorandum} 86--10, Department of Industrial Engineering,
  Purdue University, West Lafayette, IN~47907, USA, 1986.

\bibitem{ipm:Chang1}
S.~Y. Chang and K.~G. Murty.
\newblock The steepest descent gravitational method for linear programming.
\newblock {\em Discrete Applied Mathematics}, 25:211--239, 1989.

\bibitem{ipm:Charnes1}
A.~Charnes, T.~Song, and M.~Wolfe.
\newblock An explicit solution sequence and convergence of {Karmarkar's}
  algorithm.
\newblock {Research Report} CCS~501, Center for Cybernetic Studies, University
  of Texas, Austin, TX~78712--1177, USA, 1984.

\bibitem{ipm:Chen4}
B.~T. Chen.
\newblock {\em A continuation method for monotone variational inequality and
  complementarity problems\,: {With} application to linear and nonlinear
  programming}.
\newblock PhD thesis, Decision Sciences Department, The Wharton School,
  University of Pennsylvania, Philadelphia, PA, USA, 1990.

\bibitem{ipm:Chen3}
B.~T. Chen.
\newblock Finite convergence of nonsmooth equation based methods for affine
  {VIPs}.
\newblock {Talk held at the ORSA/TIMS Joint National Meeting in Orlando, FL,
  USA}, Department of Management and Systems, Washington State University,
  Pullman, WA~99104, USA, April 1992.

\bibitem{ipm:Chen5}
C.~Chen and O.~L. Mangasarian.
\newblock A class of smoothing functions for nonlinear and mixed
  complementarity problems.
\newblock {\em Computational Optimization and Applications}, 5:97--138, 1996.

\bibitem{ipm:Anstreicher43}
K.~M. Anstreicher~X. Chen, H.~Wolkowicz, and Y.-X. Yuan.
\newblock Strong duality for a trust--region type relaxation of the quadratic
  assignment problem.
\newblock {Research Report} CORR 98--31, Department of Combinatorics and
  Optimization, University of Waterloo, Waterloo, Ontario~N2L\,3G1, Canada,
  1998.

\bibitem{ipm:Chen1}
S.~Chen.
\newblock Computational experience with the {Karmarkar} algorithm.
\newblock {Talk held at the ORSA/TIMS Joint National Meeting in Los Angeles,
  CA, USA}, AT~\&~T Bell Laboratories, Holmdel, NJ~07733, USA, April 1986.

\bibitem{ipm:Chen2}
S.~Chen and D.~N. Lee.
\newblock Supercomputers and an efficient implementation of {Karmarkar's}
  algorithm.
\newblock {Talk held at the SIAM National Meeting on Numerical Analysis in
  Denver, CO, USA}, AT~\&~T Bell Laboratories, Holmdel, NJ~07733, USA, 1987.

\bibitem{ipm:Cheng3}
Y.~C. Cheng, D.~J. Houck, E.~Housos, C.~Huang, M.~S. Meketon, L.~Slutsman,
  R.~Vanderbei, and P.~Wang.
\newblock The {AT~\&~T~KORBX Linear Programming System}\,: {S}ystem
  architecture and performance.
\newblock {Talk held at the 13th International Symposium on Mathematical
  Programming in Tokyo, Japan}, AT~\&~T Bell Laboratories, Holmdel, NJ~07733,
  USA, August 1988.

\bibitem{ipm:Cheng4}
Y.~C. Cheng, D.~J. Houck, J.~M. Liu, M.~S. Meketon, L.~Slutsman, R.~J.
  Vanderbei, and P.~Wang.
\newblock The {AT~\&~T~KORBX System}.
\newblock {\em AT~\&~T Technical Journal}, 68:7--19, 1989.

\bibitem{ipm:Cheng2}
Y.~C. Cheng, J.~M. Liu, M.~Meketon, P.~Wang, R.~Vanderbei, and L.~Slutsman.
\newblock Linear programming algorithms implemented on the {AT~\&~T KORBX
  System}.
\newblock {Talk held at the ORSA/TIMS Joint National Meeting in Denver, CO,
  USA}, AT~\&~T Bell Laboratories, Holmdel, NJ~07733, USA, October 1988.

\bibitem{ipm:Cheng1}
Y.~C. Cheng and K.~T. Medhi.
\newblock The {AT\,\&\,T KORBX Linear Programming System}\,: {P}reconditioned
  conjugate gradient implementation.
\newblock {Talk held at the ORSA/TIMS Joint National Meeting in New York, NY,
  USA}, AT\,\&\,T Bell Laboratories, Holmdel, NJ~07733, USA, October 1989.

\bibitem{ipm:Cheng5}
Z.~Y. Cheng and J.~E. Mitchell.
\newblock An alternative derivation of the projective interior point method for
  linear programming through the least squares approach.
\newblock {\em Optimization}, 31:95--106, 1994.

\bibitem{ipm:Cheng6}
Z.~Y. Cheng and J.~E. Mitchell.
\newblock A primal--dual interior--point method for linear programming based on
  a weighted barrier function.
\newblock {\em Journal of Optimization THeory and Applications}, 87:301--321,
  1995.

\bibitem{ipm:Chifflet1}
M.~J. Chifflet, A.~Lisser, D.~Tachat, and P.~Tolla.
\newblock Computing block--angular {Karmarkar} projections with applications to
  multicommodity flow problems.
\newblock {Talk held at the 12th Triennial Conference on Operations Research in
  Athens, Greece}, Laboratoire de Analyse et Modelisation de Systemes pour
  l'Aide a la Decision (LAMSADE), Universite de Paris Dauphine,
  F--75775~Paris~Cedex~16, France, June 1990.

\bibitem{ipm:Chiment1}
J.~J. Chiment.
\newblock Complexity issues for numerical optimization.
\newblock {\em SIAM News}, 24(3):24--25, May 1991.

\bibitem{ipm:Chin1}
P.~Chin and A.~Vannelli.
\newblock Interior point methods for placement.
\newblock {\em IEEE International Symposium on Circuits and Systems},
  1:1.169--1.172, 1994.

\bibitem{ipm:Chin2}
P.~Chin and A.~Vannelli.
\newblock {PCG} techniques for interior point algorithms.
\newblock {\em Proceedings of the 36th Midwest Symposium on Circuits and
  Systems (Detroit, MI, USA, August 1993)}, 1:200--201, 1994.

\bibitem{ipm:Chiu1}
S.~S. Chiu and Y.~Ye.
\newblock Recovering the shadow price in projection methods for linear
  programming.
\newblock {Technical Report}, Engineering Economic Systems Department, Stanford
  University, Stanford, CA~94305, USA, 1985.

\bibitem{ipm:Chiu2}
S.~S. Chiu and Y.~Ye.
\newblock Simplex method and {Karmarkar's} algorithm\,: {A} unifying structure.
\newblock {Technical Report}, Engineering Economic Systems Department, Stanford
  University, Stanford, CA~94305, USA, 1985/86.

\bibitem{ipm:Choi8}
I.~C. Choi.
\newblock {\em Interior point methods for solving large structured linear
  programs}.
\newblock PhD thesis, Department of Industrial Engineering and Operations
  Research, Columbia University, New York, NY~10027, USA, 1990.

\bibitem{ipm:Choi6}
I.~C. Choi.
\newblock Partitioning methods in interior point algorithms.
\newblock {Talk held at the ORSA/TIMS Joint National Meeting in Orlando, FL,
  USA}, Department of Industrial Engineering, The Wichita State University,
  Wichita, KS~67206, USA, April 1992.

\bibitem{ipm:Choi1}
I.~C. Choi and D.~Goldfarb.
\newblock Interior point methods for solving structured linear programs using
  parallel computation.
\newblock {Talk held at the ORSA/TIMS Joint National Meeting in New York, NY,
  USA}, Department of Industrial Engineering and Operations Research, Columbia
  University, New York, NY~10027, USA, October 1989.

\bibitem{ipm:Choi2}
I.~C. Choi and D.~Goldfarb.
\newblock Detecting optimal basic and nonbasic variables prior to optimality in
  interior point methods.
\newblock {Talk held at the ORSA/TIMS Joint National Meeting in Las Vegas, NV,
  USA}, Department of Industrial Engineering and Operations Research, Columbia
  University, New York, NY~10027, USA, May 1990.

\bibitem{ipm:Choi5}
I.~C. Choi and D.~Goldfarb.
\newblock Solving multicommodity network flow problems by an interior point
  method.
\newblock In T.~F. Coleman and Y.~Li, editors, {\em Large--Scale Numerical
  Optimization, Papers from the Workshop held at Cornell University, Ithaca,
  NY, USA, October 1989}, volume~46 of {\em SIAM Proceedings in Applied
  Mathematics}, pages 58--69. Society of Industrial and Applied Mathematics
  (SIAM), Philadelphia, PA, USA, 1990.

\bibitem{ipm:Choi7}
I.~C. Choi and D.~Goldfarb.
\newblock Exploiting special structure in a primal--dual path--following
  algorithm.
\newblock {\em Mathematical Programming}, 58:33--52, 1993.

\bibitem{ipm:Choi9}
I.~C. Choi and D.~Goldfarb.
\newblock On solution--containing ellipsoids in linear programming.
\newblock {\em Journal of Optimization Theory and Applications}, 80:161--173,
  1994.

\bibitem{ipm:Choi3}
I.~C. Choi, C.~L. Monma, and D.~F. Shanno.
\newblock Computational experience with a primal--dual interior point method
  for linear programming.
\newblock {Technical Report}, RUTCOR Center of Operations Research, Rutgers
  University, New Brunswick, NJ~08903, USA, 1989.

\bibitem{ipm:Choi4}
I.~C. Choi, C.~L. Monma, and D.~F. Shanno.
\newblock Further development of a primal--dual interior point method.
\newblock {\em ORSA Journal on Computing}, 2:304--311, 1990.

\bibitem{ipm:Christensen1}
P.~W. Christensen, A.~Larbring, J.~S. Pang, and N.~Stromberg.
\newblock Formulationa nd comparison of algorithm for frictional contact
  problems.
\newblock {\em International Journal for Numerical Methods in Engineering},
  42:145--173, 1998.

\bibitem{ipm:Christiansen1}
E.~Christiansen and K.~O. Kortanek.
\newblock Computing material collapse displacement fields on a {Cray~X--MP/48}
  by the {LP} primal affine scaling algorithm.
\newblock {\em Annals of Operations Research}, 22:355--376, 1990.

\bibitem{ipm:Christiansen2}
E.~Christiansen and K.~O. Kortanek.
\newblock Computation of the collapse state in limit analysis using the {LP}
  primal affine scaling algorithm.
\newblock {\em Journal of Computational and Applied Mathematics}, 34:47--63,
  1991.

\bibitem{ipm:Christoforidis1}
M.~Christoforidis, M.~Aganagic, B.~Awobamise, and S.~Tong.
\newblock Long--term/midterm resource optimization of a hydro--dominant power
  system using interior point method.
\newblock {\em Power Industry Computer Application Conference}, pages 164--,
  1995.

\bibitem{ipm:Christoforidis2}
M.~Christoforidis, M.~Aganagic, B.~Awobamise, S.~Tong, and A.~F. Rahimi.
\newblock Long--term/midterm resource optimization of a hydro--dominant power
  system using interior point method.
\newblock {\em IEEE Transactions on Power Systems}, 11:287--294, 1996.

\bibitem{ipm:Chu1}
S.~C.~K. Chu.
\newblock On the existence of positive non--extreme point solutions of linear
  programming.
\newblock {\em International Journal of Mathematical Education in Science and
  Technology}, 21:99--103, 1990.

\bibitem{ipm:Clark1}
C.~E. Clark and J.~L. Strand.
\newblock Application of the {Karmarkar} algorithm and expert system technology
  to transmission network planning.
\newblock {\em GLOBECOM Tokyo~'87\,: Conference Record of the IEEE/IEICE Global
  Telecommunications Conference in Tokyo}, 2:270, 1987.

\bibitem{ipm:Clausen1}
J.~Clausen and F.~A. {Al--Khayyal}.
\newblock {\em Interior Point Methods}, volume~19 of {\em Mathematical
  Programming Society Committee on Algorithms (COAL) Newsletter}.
\newblock Mathematical Programming Society, Amsterdam, The Netherlands, August
  1991.

\bibitem{ipm:Clements1}
K.~A. Clements, P.~W. Davis, and K.~P. Frey.
\newblock An interior point algorithm for weighted least absolute value power
  system state estimation.
\newblock {\em IEEE Winter Power Meeting (New York 1991)}, pages
  Paper.91--WM225--2 PWRS, 1991.

\bibitem{ipm:Coleman1}
T.~Coleman and Y.~Li.
\newblock Quadratic interior point algorithms for piecewise linear problems.
\newblock {Talk held at the ORSA/TIMS Joint National Meeting in New York, NY,
  USA}, School of Operations Research and Industrial Engineering, Cornell
  University, Ithaca, NY~14853, USA, October 1989.

\bibitem{ipm:Coleman9}
T.~F. Coleman, J.~Czyzyk, C.~Sun, M.~Wagner, and S.~J. Wright.
\newblock {pPCx}\,: {Parallel} software for linear programming.
\newblock {Technical Report} TR\,96--14, Computer Science Department, Cornell
  University, Ithaca, NY~14853, USA, December 1996.
\newblock See also {\it{Proceedings of the Eighth SIAM Conference on Parallel
  Processing for Scientific Computing (Minneapolis, MN, 1997), 8pp.
  (electronic), SIAM, Philadelphia, PA, 1997}}.

\bibitem{ipm:Coleman7}
T.~F. Coleman and L.~A. Hulbert.
\newblock A globally and superlinearly convergent algorithm for convex
  quadratic programs with simple bounds.
\newblock {\em SIAM Journal on Optimization}, 3:298--321, 1993.

\bibitem{ipm:Coleman2}
T.~F. Coleman and Y.~Li.
\newblock {\em Large--Scale Optimization, Papers from the Workshop held at
  Cornell University, Ithaca, NY, USA, October 1989}, volume~46 of {\em SIAM
  Proceedings in Applied Mathematics}.
\newblock Society of Industrial and Applied Mathematics (SIAM), Philadelphia,
  PA, USA, 1990.

\bibitem{ipm:Coleman3}
T.~F. Coleman and Y.~Li.
\newblock A globally and quadratically convergent affine scaling method for
  linear {L$_{\mbox{1}}$} problems.
\newblock {\em Mathematical Programming}, 52:189--222, 1992.

\bibitem{ipm:Coleman4}
T.~F. Coleman and Y.~Li.
\newblock On the convergence of interior--reflective {Newton} methods for
  nonlinear minimization subject to bounds.
\newblock {\em Mathematical Programming}, 67:189--224, 1994.

\bibitem{ipm:Coleman5}
T.~F. Coleman and Y.~Li.
\newblock An interior trust region approach for nonlinear minimization subject
  to bounds.
\newblock {\em SIAM Journal on Optimization}, 6:418--445, 1996.

\bibitem{ipm:Coleman8}
T.~F. Coleman and Y.~Li.
\newblock A reflective {Newton} method for minimizing a quadratic function
  subject to bounds on some of the variables.
\newblock {\em SIAM Journal on Optimization}, 6:1040--1058, 1996.

\bibitem{ipm:Coleman6}
T.~F. Coleman and J.~Liu.
\newblock An interior {Newton} method for quadratic programming.
\newblock {Technical Report} TR\,93--1388, Computer Science Department, Cornell
  University, Ithaca, NY~14853, USA, October 1993.

\bibitem{ipm:Colmenares1}
O.~Colmenares.
\newblock Karmarkar's linear programming algorithm\,: {B}etter or worse than
  the classical method~?
\newblock {Technical Report}, Graduate School of Management, University of
  California at Los Angeles, Los Angeles, CA, USA, January 1985.

\bibitem{ipm:Cominetti1}
R.~Cominetti and J.~{San Martin}.
\newblock Asymptotic analysis of the exponential penalty trajectory in linear
  programming.
\newblock {\em Mathematical Programming}, 67:169--187, 1994.

\bibitem{ipm:Conn4}
A.~R. Conn, N.~I.~M. Gould, and P.~L. Toint.
\newblock A primal--dual algorithm fror minimizing a nonconvex function subject
  to bound and linear equality constraints.
\newblock {Technical Report} RC\,20639, IBM T.\,J.\,Watson Research Center,
  Yorktown Heights, New York, NY, USA, 1996.

\bibitem{ipm:Conn1}
A.~R. Conn, N.~I.~M. Gould, and Ph.~L. Toint.
\newblock A globally convergent {Lagrangian} barrier algorithm for optimization
  with general inequality constraints and simple bounds.
\newblock {Technical Report} 92/07, Department of Mathematics, FUNDP, Namur,
  Belgium, 1992.

\bibitem{ipm:Conn2}
A.~R. Conn, N.~I.~M. Gould, and Ph.~L. Toint.
\newblock A note on using alternative second--order models for the subproblems
  arising in barrier function methods for minimization.
\newblock {\em Numerische Mathematik}, 68:17--33, 1994.

\bibitem{ipm:Conn3}
A.~R. Conn and M.~L. Overton.
\newblock A primal--dual interior--point method for minimizing a sum of
  {Euclidean} distances.
\newblock {Technical Report}, Department of Mathematics, FUNDP, Namur, Belgium,
  1995.
\newblock (In preparation).

\bibitem{ipm:Conway1}
R.~Conway and M.~Magazine.
\newblock A case against software patents.
\newblock {\em OR/MS Today}, 18(1):14--15, February 1991.

\bibitem{ipm:Cook1}
T.~M. Cook and R.~A. Russell.
\newblock {\em Introduction to Management Science}, chapter 4\,: {A}n
  alternative to the simplex method --- {Karmarkar's} algorithm, pages
  137--139.
\newblock Prentice Hall, Englewood Cliffs, NJ~07632, USA, fourth edition, 1989.

\bibitem{ipm:Cottle1}
R.~Cottle, J.-S. Pang, and R.~E. Stone.
\newblock {\em {The Linear Complementarity Problem}}, chapter 5.9\,:
  Interior--point methods, pages 461--475.
\newblock Academic Press, 1992.

\bibitem{ipm:CPLEX1}
{\emph{CPLEX User's Guide}}.
\newblock Manual, CPLEX Optimization, Inc., Incline Village, NV, USA, 1993.

\bibitem{ipm:Cremonese1}
P.~Cremonese.
\newblock Programmazione lineare e algoritmo proiettivo. {Implementazione},
  experienze, relazione col simplesso {(Linear Programming and Projective
  Algorithm. Implementation, experiences, Simplex Relation)}.
\newblock {\em Ricerca Operativa (Italy)}, 18:73--102, 1988.
\newblock (In Italian).

\bibitem{ipm:Crouzeix1}
J.~P. Crouzeix and C.~Roos.
\newblock On the inverse target map of a linear programming problem.
\newblock {Working Paper}, University of Clermont, Clermont, France, 1994.

\bibitem{ipm:Cvetkovic1}
D.~Cvetkovi{\'c}, M.~Cangalovi{\'c}, and V.~V.
  {Kova\u{c}evi{\'c}--Vuj\u{c}i{\'c}}.
\newblock Semidefinite relaxations of traveling salesman problem.
\newblock {Technical Report} 902--98, Laboratory for Operations Research,
  Faculty of Organizational Sciences, University of Belgrade, Belgrade,
  Yugoslavia, November 1998.

\bibitem{ipm:Czyzyk2}
J.~Czyzyk, R.~Fourer, and S.~Mehrotra.
\newblock Using massively parallel processors to solve large sparse linear
  programs by an interior--point method.
\newblock {Technical Report}, Department of Industrial Engineering and
  Management Sciences, Northwestern University, Evanston, IL~60208--3119, USA,
  July 1994.
\newblock Revised May 1994.

\bibitem{ipm:Czyzyk1}
J.~Czyzyk, R.~Fourer, and S.~Mehrotra.
\newblock A study of the augmented system and column--splitting approaches for
  solving two--stage stochastic linear programs by interior--point methods.
\newblock {\em ORSA Journal on Computing}, 7:474--490, 1995.

\bibitem{ipm:Czyzyk4}
J.~Czyzyk, S.~Mehrotra, M.~Wagner, and S.~J. Wright.
\newblock {PCx User's Guide (Version 1.1)}.
\newblock {Technical Report} OTC\,96/01, Optimization Technology Center,
  Northwestern University, Evanston, IL~60208--3119, USA, November 1997.
\newblock (Revised version of Czyzyk, Fourer and Wright \cite{ipm:Czyzyk3}).

\bibitem{ipm:Czyzyk3}
J.~Czyzyk, S.~Mehrotra, and S.~J. Wright.
\newblock {PCx} user guide.
\newblock {Technical Report} OTC\,96/01, Optimization Technology Center,
  Northwestern University, Evanston, IL~60208--3119, USA, May 1996.
\newblock For a revised version see Czyzyk et al.\,\cite{ipm:Czyzyk4}.

\bibitem{ipm:Dantzig4}
G.~B. Dantzig.
\newblock Dikin's interior method for {LP}.
\newblock {Manuscript}, Systems Optimization Laboratory, Department of
  Operations Research, Stanford University, Stanford, CA~94305, USA, 1988.

\bibitem{ipm:Dantzig2}
G.~B. Dantzig, D.~Goldfarb, E.~Lawler, C.~Monma, and S.~M. Robinson.
\newblock Report of the {Committee on Algorithms and the Law}.
\newblock {\em Optima (The Mathematical Programming Society Newsletter)},
  33:2--19, June 1991.
\newblock Containing\,: B.~Kahin, The case against {''software patents''},
  Appendix~A, pages 5--13, and The League for Programming Freedom, Against
  software patents, Appendix~B, pages 14--19.

\bibitem{ipm:Dantzig5}
G.~B. Dantzig, D.~Goldfarb, E.~Lawler, C.~Monma, and S.~M. Robinson.
\newblock Report of the {MPS Committee on Algorithms and the Law}.
\newblock {\em SIAM News}, 24(6):3, 18, November 1991.

\bibitem{ipm:Dantzig6}
G.~B. Dantzig and M.~Thapa.
\newblock {\em Linear Programming\,: An Introduction}.
\newblock Springer Verlag, Berlin, Germany, 1997.

\bibitem{ipm:Dantzig1}
G.~B. Dantzig and Y.~Ye.
\newblock A build--up interior method for linear programming\,: {Affine}
  scaling form.
\newblock {Technical Report} SOL~90--4, Systems Optimization Laboratory,
  Department of Operations Research, Stanford University, Stanford, CA~94305,
  USA, February 1990.

\bibitem{ipm:Dantzig3}
G.~B. Dantzig and Y.~Ye.
\newblock A build--up interior method for linear programming\,: {Affine}
  scaling form.
\newblock {Technical Report}, Department of Management Science, University of
  Iowa, Iowa City, IA~52242, USA, July 1991.

\bibitem{ipm:Das1}
I.~Das.
\newblock An interior point algorithm for the general nonlinear programming
  problem with trust region globalization.
\newblock {Technical Report} TR~96--17, Department of Computational and Applied
  Mathematics, Rice University, Houston, TX~77251, USA, 1996.

\bibitem{ipm:David1}
{David~II}-Report.
\newblock Renewing {U.S.} mathematics --- {A} plan for the 1990s,
  {S}ection~24\,: {Interior} point methods for linear programming.
\newblock {\em Notices of the American Mathematical Society}, 37(8):984--1004,
  esp.\ 1001--1002, October 1990.

\bibitem{ipm:Dennis3}
J.~E. Dennis, M.~Heinkenschloss, and L.~N. Vicente.
\newblock Trust--region interior--point algorithms for a class of nonlinear
  programming problems.
\newblock {Technical Report} TR~94--45, Department of Computational and Applied
  Mathematics, Rice University, Houston, TX~77251, USA, 1994.
\newblock Revised May 1995.

\bibitem{ipm:Dennis4}
J.~E. Dennis, M.~Heinkenschloss, and L.~N. Vicente.
\newblock {TRICE}\,--\,{Trust--region} interior--point algorithms for optimal
  control and engineering design problems.
\newblock {Project}, Department of Computational and Applied Mathematics, Rice
  University, Houston, TX~77251, USA, 1997.
\newblock For further informations see {\tt http://www.caam.rice.edu/~trice}.

\bibitem{ipm:Dennis5}
J.~E. Dennis, M.~Heinkenschloss, and L.~N. Vicente.
\newblock Trust--region interior--point {SQP} algorithms for a class of
  nonlinear programming problems.
\newblock {\em SIAM Journal on Control and Optimization}, 36:1750--1794, 1998.

\bibitem{ipm:Dennis1}
J.~E. Dennis, A.~M. Morshedi, and K.~Turner.
\newblock A variable metric variant of the {Karmarkar} algorithm for linear
  programming.
\newblock {\em Mathematical Programming}, 39:1--20, 1987.

\bibitem{ipm:Dennis2}
J.~E. Dennis and L.~N. Vicente.
\newblock Trust--region interior--point algorithms for minimization problems
  with simple bounds.
\newblock {\em Applied Mathematics and Parallel Computing}, pages 97--107,
  1996.

\bibitem{ipm:Derigs1}
U.~Derigs.
\newblock {Neuere Ans{\"a}tze in der Linearen Optimierung---Motivation,
  Konzepte und Verfahren~(Recent results in linear programming---motivation,
  concepts and methods)}.
\newblock In L.~Streitfeldt, H.~Hauptmann, A.~W. Marusev, D.~Ohse, and U.~Pape,
  editors, {\em Operations Research Proceedings 1985}, pages 47--58, Springer
  Verlag, Berlin, Germany, 1986.
\newblock (In German).

\bibitem{ipm:Diao1}
Z.~Y. Diao.
\newblock Karmarkar's algorithm and its modification.
\newblock {\em Chinese Journal on Operations Research}, 7(1):73--75, 1988.

\bibitem{ipm:Diao2}
Z.~Y. Diao.
\newblock A remark on {Karmarkar's} algorithm.
\newblock {\em Chinese Journal on Operations Research}, 7(2):61--62, 1988.

\bibitem{ipm:Diao3}
Z.~Y. Diao.
\newblock Interior point algorithms and dynamic systems.
\newblock {Talk held at the Fourth SIAM Conference on Optimization in Chicago,
  IL, USA}, Shandong University, People's Republic of China, May 1992.

\bibitem{ipm:Didderich1}
G.~T. Didderich.
\newblock Some remarks on {Karmarkar's} potential function.
\newblock {\em Aequationes Mathematicae}, 36:57--75, 1988.

\bibitem{ipm:Dikin1}
I.~I. Dikin.
\newblock Iterative solution of problems of linear and quadratic programming.
\newblock {\em Doklady Akademii Nauk SSSR}, 174:747--748, 1967.
\newblock Translated in\,: {\em Soviet Mathematics Doklady 8:674--675, 1967}.

\bibitem{ipm:Dikin2}
I.~I. Dikin.
\newblock On the convergence of an iterative process.
\newblock {\em Upravlyaemye Sistemi}, 12:54--60, 1974.
\newblock (In Russian).

\bibitem{ipm:Dikin3}
I.~I. Dikin.
\newblock Letter to the editor.
\newblock {\em Mathematical Programming}, 41:393--394, 1988.

\bibitem{ipm:Dikin5}
I.~I. Dikin.
\newblock The convergence of dual variables.
\newblock {Technical Report}, Siberian Energy Institute, Irkutsk, Russia,
  December 1991.

\bibitem{ipm:Dikin6}
I.~I. Dikin.
\newblock Determination of the interior point of one system of linear
  inequalities.
\newblock {\em Kibernetika Sistemnyi Analiz}, 1:76--74, 188, 1992.
\newblock (In Russian). Translated in Cybernetic and Systems Analysis.

\bibitem{ipm:Dikin8}
I.~I. Dikin.
\newblock The method of interior points in linear programming.
\newblock In V.~P. Bulatov, editor, {\em {Optimizatsiya\,: Modeli, Metody,
  Resheniya}}, pages 54--69. Nauka, Novosibirsk, USSR, 1992.
\newblock (In Russian).

\bibitem{ipm:Dikin7}
I.~I. Dikin and C.~Roos.
\newblock Convergence of the dual variables for the primal affine scaling
  method with unit steps in the homogeneous case.
\newblock {\em Journal of Optimization Theory and Applications}, 95:305--321,
  1997.

\bibitem{ipm:Dikin4}
I.~I. Dikin and V.~I. Zorkaltsev.
\newblock {\em Iterative Solutions of Mathematical Programming Problems --
  Interior Point Methods}.
\newblock Nauka Publishers, Novosibirsk, USSR, 1980.
\newblock (In Russian).

\bibitem{ipm:Ding4}
J.~Ding.
\newblock A new polynomial--time algorithm for linear programming.
\newblock {Technical Report}, Department of Mathematics, Michigan State
  University, East Lansing, MI~48824, USA, 1988.

\bibitem{ipm:Ding3}
J.~Ding.
\newblock An interior point algorithm for linear complementarity problems.
\newblock {Technical Report}, University of Southern Mississippi, USA, 1992.
\newblock To appear in {\em Linear Algebra and Its Applications}.

\bibitem{ipm:Ding5}
J.~Ding.
\newblock A scaled gradient projection algorithm for linear complementarity
  problems.
\newblock In D.-Z. Du and J.~Sun, editors, {\em Advances in Optimization and
  Approximation}, volume~1 of {\em Nonconvex Optimization and Its
  Applications}, pages 58--67. Kluwer Academic Publishers, Dordrecht, The
  Netherlands, 1994.

\bibitem{ipm:Ding1}
J.~Ding and T.~Y. Li.
\newblock An algorithm based on weighted logarithmic barrier functions for
  linear complementarity problems.
\newblock {\em Arabian Journal for Science and Engineering}, 15(4):769--685,
  1990.

\bibitem{ipm:Ding2}
J.~Ding and T.~Y. Li.
\newblock A polynomial--time predictor--corrector algorithm for a class of
  linear complementarity problems.
\newblock {\em SIAM Journal on Computing}, 1(1):83--92, 1991.

\bibitem{ipm:Dinn1}
J.~Dinn.
\newblock A new polynomial--time algorithm for linear programming.
\newblock {Technical Report}, Department of Mathematics, Michigan State
  University, East Lansing, MI~48824, USA, 1988.
\newblock Incorrect author name, see Ding \cite{ipm:Ding4}.

\bibitem{ipm:Dinn2}
N.~F. Dinn, N.~K. Karmarkar, and L.~P. Sinha.
\newblock Karmarkar algorithm enables interactive planning of networks.
\newblock {\em Record AT~\&~T~Bell Laboratories}, 64(2):11--13, 1986.

\bibitem{ipm:Dodani1}
M.~H. Dodani and A.~J.~G. Babu.
\newblock Karmarkar's projective method for linear programming\,: {A}
  computational survey.
\newblock {\em Computers and Industrial Engineering}, 13:285--289, 1987.

\bibitem{ipm:Dodani2}
M.~H. Dodani and A.~J.~G. Babu.
\newblock Karmarkar's projective method for linear programming\,: {A}
  computational appraisal.
\newblock {\em Computers and Industrial Engineering}, 16:198--206, 1989.

\bibitem{ipm:Dodani3}
M.~H. Dodani and A.~J.~G. Babu.
\newblock Karmarkar's projective method for linear programming\,: {A}
  computational survey.
\newblock {\em International Journal of Mathematical Education in Science and
  Technology}, 21:191--212, 1990.

\bibitem{ipm:Dolecki1}
S.~Dolecki.
\newblock {\em Optimization\,: Proceedings of the 5th French--German Conference
  in Castel--Novel, Varetz, France, October 1988}, volume 1405 of {\em Lecture
  Notes in Mathematics}.
\newblock Springer Verlag, Berlin, Germany, 1989.

\bibitem{ipm:Doljansky1}
M.~Doljansky and M.~Teboulle.
\newblock An interior proximal algorithm and the exponetial multiplier method
  for semidefinite programming.
\newblock {\em SIAM Journal on Optimization}, 9:1--13, 1999.

\bibitem{ipm:Domich1}
P.~D. Domich, P.~T. Boggs, J.~R. Donaldson, and C.~Witzgall.
\newblock Optimal 3--dimensional methods for linear programming.
\newblock {Technical Report} NISTIR~89--4225, United States Department of
  Commerce, National Institute of Standards and Technology, Gaithersburg,
  MD~20899, USA, December 1989.

\bibitem{ipm:Domich3}
P.~D. Domich, P.~T. Boggs, J.~R. Donaldson, and C.~Witzgall.
\newblock Third order correction methods to the method of centers for linear
  programming problems.
\newblock {Talk held at the ORSA/TIMS Joint National Meeting in Las Vegas, NV,
  USA}, United States Department of Commerce, National Institute of Standards
  and Technology, Applied and Computational Mathematics Division, Boulder,
  CO~80303, USA, May 1990.

\bibitem{ipm:Domich4}
P.~D. Domich, P.~T. Boggs, J.~R. Donaldson, and C.~Witzgall.
\newblock An interior point approach for linear and quadratic programming.
\newblock {Talk held at the ORSA/TIMS Joint National Meeting in Anaheim, CA,
  USA}, United States Department of Commerce, National Institute of Standards
  and Technology, Applied and Computational Mathematics Division, Boulder,
  CO~80303, USA, November 1991.

\bibitem{ipm:Domich2}
P.~D. Domich, P.~T. Boggs, J.~E. Rogers, and C.~Witzgall.
\newblock Optimizing over 3--d subspaces in an interior point method.
\newblock {\em Linear Algebra and Its Applications}, 152:315--342, 1991.

\bibitem{ipm:Doup1}
T.~Doup, R.~Bisseling, and L.~Loyens.
\newblock A parallel interior point algorithm for linear programming on a
  network of 400 transputers.
\newblock {Talk held at the Symposium APMOD~'91---Applied Mathematical
  Programming and Modelling, Brunel University, London, United Kingdom}, Shell
  Research Center (KSLA), Amsterdam, The Netherlands, January 1991.
\newblock See also Bisseling, Doup and Loyens\,\cite{ipm:Bisseling1}.

\bibitem{ipm:Dowling1}
M.~L. Dowling.
\newblock Comparing the affine and projective vector fields associated with
  linear programming.
\newblock {Technical Report}, Department of Management, University of Georgia,
  Athens, GA~30602, USA, 1989.
\newblock Submitted to {\em Mathematical Programming}.

\bibitem{ipm:Dowling3}
M.~L. Dowling.
\newblock An affine scaling method for nonlinear programming.
\newblock {Habilitationthesis}, Institut f{\"u}r Angewandte Mathematik,
  Abteilung f{\"u}r Mathematische Optimierung, Technische Universit{\"a}t
  Braunschweig, P{\"o}ckelstr. 14, D--38106 Braunschweig, Germany, 1994.

\bibitem{ipm:Dowling2}
M.~L. Dowling.
\newblock An affine scaling algorithm for linear programming problems with
  inequality constraints.
\newblock {\em Mathematical Models of Operations Research}, 43:301--318, 1996.

\bibitem{ipm:Du1}
D.~Z. Du, F.~Wu, and X.~S. Zhang.
\newblock Why is the objective function nonlinearized in the interior point
  methods for nonlinear programming?
\newblock {\em Mathematics in Practice and Theory}, 2:63--68, 1990.
\newblock (In Chinese).

\bibitem{ipm:Duff1}
I.~S. Duff.
\newblock The solution of large--scale least--squares problems on
  supercomputers.
\newblock {\em Annals of Operations Research}, 22:241--252, 1990.

\bibitem{ipm:Zhang24}
D.Zhang and Y.~Zhang.
\newblock On constructing interior--point path--following methods for certain
  semimonotone complemntarity problems.
\newblock {Technical Report} TR~97--19, Department of Computational and Applied
  Mathematics, Rice University, Houston, TX~77251, USA, 1997.

\bibitem{ipm:Eckstein1}
J.~Eckstein, R.-J. Qi, V.~I. Ragulin, and S.~A. Zenios.
\newblock Data--parallel implementations of dense linear programming
  algorithms.
\newblock {Technical Report} TMC--230, Thinking Machines Corporation,
  Cambridge, MA~02142, USA, May 1992.
\newblock Also available as Decision Sciences Department Report~92--05--06, The
  Wharton School, University of Pennsylvania, Philadelphia, PA~19101, USA.

\bibitem{ipm:Economist1}
Not so simplex.
\newblock {\em The Economist}, December 1, 1984.

\bibitem{ipm:Edirisinghe1}
C.~Edirisinghe and W.~Ziemba.
\newblock A boundary point algorithm for linear programming.
\newblock {Talk held at the ORSA/TIMS Joint National Meeting in Anaheim, CA,
  USA}, Department of Commerce and Business Administration, University of
  British Columbia, Vancouver, BC~V6T~1Y8, Canada, November 1991.

\bibitem{ipm:Edwards1}
J.~J. Edwards and J.~A. Tomlin.
\newblock Towards a highly parallel mathematical programming system.
\newblock {Talk held at the 14th International Mathematical Programming
  Symposium in Amsterdam, The Netherlands}, IBM Almaden Research Center, San
  Jose, CA~95120, USA, August 1991.
\newblock {Technical Report in preparation}.

\bibitem{ipm:ElBakry4}
A.~S. {El--Bakry}.
\newblock {\em On the role of indicators in identifying zero variables in
  linear programming}.
\newblock PhD thesis, Department of Mathematical Sciences, Rice University,
  Houston, TX~77251, USA, 1991.

\bibitem{ipm:ElBakry8}
A.~S. {El--Bakry}.
\newblock Convergence rate of primal--dual reciprocal barrier {Newton}
  interior--point methods.
\newblock {\em Optimization Methods and Software}, 9:37--44, 1998.

\bibitem{ipm:ElBakry6}
A.~S. {El--Bakry}, R.~A. Tapia, T.~Tsuchiya, and Y.~Zhang.
\newblock On the formulation and theory of the {Newton} interior--point method
  for nonlinear programming.
\newblock {\em Journal of Optimization Theory and Applications}, 89:507--541,
  1996.

\bibitem{ipm:ElBakry2}
A.~S. {El--Bakry}, R.~A. Tapia, and Y.~Zhang.
\newblock Numerical comparisons of local convergence strategies for
  interior--point methods in linear programming.
\newblock {Technical Report} TR~91--18, Department of Mathematical Sciences,
  Rice University, Houston, TX~77251, USA, 1991.

\bibitem{ipm:ElBakry3}
A.~S. {El--Bakry}, R.~A. Tapia, and Y.~Zhang.
\newblock On obtaining highly accurate or basic solutions using interior--point
  methods in linear programming.
\newblock {Talk held at the Fourth SIAM Conference on Optimization in Chicago,
  IL, USA}, Department of Mathematical Sciences, Rice University, Houston,
  TX~77251, USA, May 1992.

\bibitem{ipm:ElBakry7}
A.~S. {El--Bakry}, R.~A. Tapia, and Y.~Zhang.
\newblock Logarithmic indicators and the identification of subgroups of
  variables in interior--point methods.
\newblock {Technical Report} TR~93--35, Department of Computational and Applied
  Mathematics, Rice University, Houston, TX~77251, USA, September 1993.

\bibitem{ipm:ElBakry1}
A.~S. {El--Bakry}, R.~A. Tapia, and Y.~Zhang.
\newblock A study of indicators for identifying zero variables in
  interior--point methods.
\newblock {\em SIAM Review}, 36:45--72, 1994.

\bibitem{ipm:ElBakry5}
A.~S. {El--Bakry}, R.~A. Tapia, and Y.~Zhang.
\newblock On the convergence rate of {Newton} interior--point methods in the
  absence of strict complementarity.
\newblock {\em Computational Optimization and Applications}, 6:157--167, 1996.

\bibitem{ipm:Emmett1}
A.~Emmett.
\newblock Karmarkar's algorithm\,: {A} threat to simplex~?
\newblock {\em IEEE Spectrum}, 22(12):54--55, December 1985.

\bibitem{ipm:Encheva1}
T.~J. Encheva.
\newblock Computational comparisons for the method of centers of gravity of
  vertices.
\newblock {\em Serdica (Bulgaricae Mathematicae Publicationes)},
  16(3):188--193, 1990.

\bibitem{ipm:Epelman1}
M.~Epelman and R.~M. Freund.
\newblock Condition number complexity of an elementary algorithm for resolving
  a conic linear system.
\newblock {Technical Report}, Sloan School of Management, Massachusetts
  Institute of Technology, Cambridge, MA~02139, USA, February 1997.

\bibitem{ipm:Epelman2}
M.~Epelman and R.~M. Freund.
\newblock Condition number complexity of an elementary algorithm for computing
  a reliable solution of a conic linear system.
\newblock {Technical Report}, Sloan School of Management, Massachusetts
  Institute of Technology, Cambridge, MA~02139, USA, December 1998.

\bibitem{ipm:Eriksson1}
J.~R. Eriksson.
\newblock Algorithms for entropy and mathematical programming.
\newblock {Link{\"o}ping Studies in Science and Technology Dissertations}~63,
  Department of Mathematics, Link{\"o}ping University, S--58183~Link{\"o}ping,
  Sweden, 1981.

\bibitem{ipm:Eriksson2}
J.~R. Eriksson.
\newblock An iterative primal--dual algorithm for linear programming.
\newblock {Technical Report} LiTH--MAT--R--1985--10, Department of Mathematics,
  Link{\"o}ping University, S--58183~Link{\"o}ping, Sweden, 1985.

\bibitem{ipm:Eriksson3}
J.~R. Eriksson.
\newblock Using the entropy function to get an interior point method for linear
  programming.
\newblock {Technical Report} LiTH--MAT--R--1990--02, Department of Mathematics,
  Link{\"o}ping University, S--58183~Link{\"o}ping, Sweden, 1990.

\bibitem{ipm:Evtushenko3}
Yu.~G. Evtushenko and V.~G. Zhadan.
\newblock {Barrier--Newton} methods in linear programming.
\newblock In J.~Henry and J.~P. Yvon, editors, {\em System Modelling and
  Optimization (Proceedings of the 16th IFIP--TC7 Conference, Compiegne,
  France, July 1993)}, volume 197 of {\em Lecture Notes in Control and
  Information Sciences}, pages 215--224. Springer Verlag, Berlin, Germany,
  1994.

\bibitem{ipm:Evtushenko4}
Yu.~G. Evtushenko and V.~G. Zhadan.
\newblock Stable barrier--projection and barrier--{Newton} methods for linear
  and nonlinear programming.
\newblock In E.~Spedicato, editor, {\em Algorithms for Continuous
  Optimization\,: The State--of--the--Art (Il Ciocco, Barga, Italy, September
  1993)}, volume 434 of {\em NATO Adavanced Science Institute Series C\,:
  Mathematical and Physical Sciences}, pages 255--285. Kluwer Academic
  Publishers, Dordrecht, The Netherlands, 1994.
\newblock See also Evtushenko and Zhadan
  \cite{ipm:Evtushenko1,ipm:Evtushenko2}.

\bibitem{ipm:Evtushenko1}
Yu.~G. Evtushenko and V.~G. Zhadan.
\newblock Stable barrier--projection and barrier--{Newton} methods in linear
  programming.
\newblock {\em Computational Optimization and Applications}, 3:289--303, 1994.
\newblock See also Evtushenko and Zhadan \cite{ipm:Evtushenko4}.

\bibitem{ipm:Evtushenko2}
Yu.~G. Evtushenko and V.~G. Zhadan.
\newblock Stable barrier--projection and barrier--{Newton} methods in nonlinear
  programming.
\newblock {\em Optimization Methods and Software}, 3:237--256, 1994.
\newblock See also Evtushenko and Zhadan \cite{ipm:Evtushenko4}.

\bibitem{ipm:Evtushenko5}
Yu.~G. Evtushenko and V.~G. Zhadan.
\newblock Dual barrier--projection methods in linear programming.
\newblock In R.~P. Agarwal, editor, {\em Recent Trends in Optimization Theory
  and Applications}, volume~5 of {\em World Science Series in Applied
  Analysis}, pages 51--66. World Science Publishing, River Edge, NJ, USA, 1995.

\bibitem{ipm:Evtushenko7}
Yu.~G. Evtushenko and V.~G. Zhadan.
\newblock Dual barrier--projection and {barrier--Newton} methods for linear
  programming problems.
\newblock {\em Zhurnal Vychislitel'noi Matematiki~i~ Matematicheskoi Fiziki
  (Moscow)}, 36(7):30--45, 1996.
\newblock (In Russian).

\bibitem{ipm:Evtushenko8}
Yu.~G. Evtushenko and V.~G. Zhadan.
\newblock On some papers on interior point methods.
\newblock {\em Zhurnal Vychislitel'noi Matematiki~i~ Matematicheskoi Fiziki
  (Moscow)}, 36(12):161--162, 1996.
\newblock (In Russian).

\bibitem{ipm:Evtushenko6}
Yu.~G. Evtushenko, V.~G. Zhadan, and A.~P. Cherenkov.
\newblock Application of {Newton's} method to the solution of linear
  programming problems.
\newblock {\em Zhurnal Vychislitel'noi Matematiki~i~ Matematicheskoi Fiziki
  (Moscow)}, 35:850--866, 1995.
\newblock Translated in\,: {\em USSR Computational Mathematics and Mathematical
  Physics}, 35:673--686, 1995.

\bibitem{ipm:Ezzine1}
J.~Ezzine and M.~Ben-Daya.
\newblock Singular pertubed nonlinear {ODE}s and interior point optimization
  algorithms.
\newblock {\em Proceedings of the 1995 American Control Conference (Seattle,
  WA, USA, June 1995)}, 3:1816--1820, 1995.

\bibitem{ipm:Fan2}
M.~K.~H. Fan.
\newblock A second--order interior point method for solving linear matrix
  inequality problems.
\newblock {\em SIAM Journal on Control and Optimization}, 19\,?
\newblock (To appear).

\bibitem{ipm:Fan1}
M.~K.~H. Fan and B.~Nekooie.
\newblock A second--order interior point method for solving linear matrix
  inequality problems.
\newblock {\em Proceedings of the 1994 American Control Conference (Baltimore,
  MD, USA, June/July 1994)}, 1:831--835, 1994.
\newblock A different title found\,: {\em An algorithm on minimizing
  generalized eigenvalues with linear matrix inequality constraints}.

\bibitem{ipm:Fang10}
S.-C. Fang.
\newblock Dynamic facility network planning -- {A} solution architecture with
  block {Cholesky} factorization.
\newblock {Technical Memorandum} 54112--860305--01~TM, AT~\&~T Bell
  Laboratories, Holmdel, NJ~07733, USA, March 1986.

\bibitem{ipm:Fang9}
S.-C. Fang.
\newblock Dynamic facility network planning -- {An LP} loader.
\newblock {Technical Memorandum} 54112--860610--01~TM, AT~\&~T Bell
  Laboratories,