http:^^www.cs.wisc.edu^~ferris^papers.html

This data set contains WWW-pages collected from computer science departments of various universities

</DD>

<DT><!WA20><A NAME="ferris.mangasarian:parallel*1"
  HREF="ftp://ftp.cs.wisc.edu/tech-reports/reports/93/tr1175.ps.Z">
  [FM94]</A></DT>
<DD>
M. C. Ferris and O. L. Mangasarian.
<STRONG>Parallel variable distribution</STRONG>.
<EM>SIAM Journal on Optimization</EM>, 4:815-832, 1994.
</DD>

<DT> <A NAME="ferris.lucidi:nonmonotone"> [FL94] </DT>
<DD>
M. C. Ferris and S. Lucidi.
<STRONG>Nonmonotone stabilization methods for nonlinear equations</STRONG>.
<EM>Journal of Optimization Theory and Applications</EM>, 81:53-71, 1994.
</DD>

<DT><!WA21><A NAME="cao.ferris:pivotal"
  HREF="ftp://ftp.cs.wisc.edu/tech-reports/reports/92/tr1114.ps.Z">
  [CF96]</A></DT>
<DD>
M. Cao and M. C. Ferris.
<STRONG>A pivotal method for affine variational inequalities</STRONG>.
<EM>Mathematics of Operations Research</EM>, 21:44-64, 1996.
</DD>

<DT><!WA22><A NAME="cao.ferris:interior"
  HREF="ftp://ftp.cs.wisc.edu/tech-reports/reports/92/tr1101.ps.Z">
  [CF94]</A></DT>
<DD>
M. Cao and M. C. Ferris.
<STRONG>An interior point algorithm for monotone affine variational
  inequalities</STRONG>.
<EM>Journal of Optimization Theory and Applications</EM>, 83:269-283, 1994.
</DD>

<DT> <A NAME="ferris:linear"> [Fer93] </DT>
<DD>
M. C. Ferris.
<STRONG>The linear complementarity problem</STRONG>.
<EM>Bulletin of the American Mathematical Society</EM>, 28:169-175, 1993.
</DD>

<DT> <A NAME="eckstein.ferris:operator"> [EF92] </DT>
<DD>
J. Eckstein and M. C. Ferris.
<STRONG>Operator splitting methods for monotone linear complementarity
  problems</STRONG>.
TMC 239, Thinking Machines Corporation, Cambridge, MA 02142, 1992.
</DD>

<DT><!WA23><A NAME="dirkse.ferris.ea:gams"
  HREF="ftp://ftp.cs.wisc.edu/math-prog/tech-reports/94-07.ps.Z">
  [DFPR94]</A></DT>
<DD>
S. P. Dirkse, M. C. Ferris, P. V. Preckel, and T. Rutherford.
<STRONG>The GAMS callable program library for variational and complementarity
  solvers</STRONG>.
Mathematical Programming Technical Report 94-07, Computer Sciences Department,
  University of Wisconsin, Madison, Wisconsin, 1994.
</DD>

<DT><!WA24><A NAME="ferris.mangasarian:error"
  HREF="ftp://ftp.cs.wisc.edu/tech-reports/reports/91/tr1056a.ps.Z">
  [FM93]</A></DT>
<DD>
M. C. Ferris and O. L. Mangasarian.
<STRONG>Error bounds and strong upper semicontinuity for monotone affine
  variational inequalities</STRONG>.
<EM>Annals of Operations Research</EM>, 47:293-305, 1993.
</DD>

<DT><!WA25><A NAME="burke.ferris:weak"
  HREF="ftp://ftp.cs.wisc.edu/tech-reports/reports/91/tr1050a.ps.Z">
  [BF93]</A></DT>
<DD>
J. V. Burke and M. C. Ferris.
<STRONG>Weak sharp minima in mathematical programming</STRONG>.
<EM>SIAM Journal on Control and Optimization</EM>, 31:1340-1359, 1993.
</DD>

<DT> <A NAME="anderson.ferris:genetic*1"> [AF94] </DT>
<DD>
E. J. Anderson and M. C. Ferris.
<STRONG>Genetic algorithms for combinatorial optimization: The assembly line
  balancing problem</STRONG>.
<EM>ORSA Journal on Computing</EM>, 6:161-173, 1994.
</DD>

<DT><!WA26><A NAME="ferris.lucidi:globally"
  HREF="ftp://ftp.cs.wisc.edu/tech-reports/reports/91/tr1030.ps.Z">
  [FL91]</A></DT>
<DD>
M. C. Ferris and S. Lucidi.
<STRONG>Globally convergent methods for nonlinear equations</STRONG>.
Technical Report 1030, Computer Sciences Department, University of Wisconsin,
  Madison, Wisconsin, 1991.
</DD>

<DT><!WA27><A NAME="ferris:parallel"
  HREF="ftp://ftp.cs.wisc.edu/tech-reports/reports/91/tr1009a.ps.Z">
  [Fer94]</A></DT>
<DD>
M. C. Ferris.
<STRONG>Parallel constraint distribution for convex quadratic
  programs</STRONG>.
<EM>Mathematics of Operations Research</EM>, 19:645-658, 1994.
</DD>

<DT><!WA28><A NAME="bennett.ferris.ea:genetic"
  HREF="ftp://ftp.cs.wisc.edu/tech-reports/reports/91/tr1004.ps.Z">
  [BFI91]</A></DT>
<DD>
K. Bennett, M. C. Ferris, and Y. E. Ioannidis.
<STRONG>A genetic algorithm for database query optimization</STRONG>.
In R.~K. Belew and L.~B. Booker, editors, <EM>Proceedings of the Fourth
  International Conference on Genetic Algorithms</EM>, pages 400-407, San
  Mateo, California, 1991. Morgan Kaufmann Publishers, Inc.
</DD>

<DT><!WA29><A NAME="ferris.mangasarian:parallel"
  HREF="ftp://ftp.cs.wisc.edu/tech-reports/reports/90/tr971a.ps.Z">
  [FM91]</A></DT>
<DD>
M. C. Ferris and O. L. Mangasarian.
<STRONG>Parallel constraint distribution</STRONG>.
<EM>SIAM Journal on Optimization</EM>, 1:487-500, 1991.
</DD>

<DT> <A NAME="cao.ferris:genetic"> [CF91] </DT>
<DD>
M. Cao and M. C. Ferris.
<STRONG>Genetic algorithms in optimization</STRONG>.
<EM>Journal of Undergraduate Mathematics and its Applications</EM>, 12:81-90,
  1991.
</DD>

<DT> <A NAME="burke.ferris.ea:clarke"> [BFQ92] </DT>
<DD>
J. V. Burke, M. C. Ferris, and M. Qian.
<STRONG>On the Clarke subdifferential of the distance function to a closed
  set</STRONG>.
<EM>Journal of Mathematical Analysis and its Applications</EM>, 166:199-213,
  1992.
</DD>

<DT> <A NAME="ferris.philpott:affine"> [FP92] </DT>
<DD>
M. C. Ferris and A. B. Philpott.
<STRONG>On affine scaling and semi-infinite programming</STRONG>.
<EM>Mathematical Programming</EM>, 56:361-364, 1992.
</DD>

<DT> <A NAME="anderson.ferris:genetic"> [AF90] </DT>
<DD>
E. J. Anderson and M. C. Ferris.
<STRONG>A genetic algorithm for the assembly line balancing problem</STRONG>.
In <EM>Proceedings of the Integer Programming / Combinatorial Optimization
  Conference, Waterloo, Ontario, Canada, May 28-30</EM>. University of
  Waterloo Press, 1990.
</DD>

<DT> <A NAME="ferris.vlach:scheduling"> [FV92] </DT>
<DD>
M. C. Ferris and M. Vlach.
<STRONG>Scheduling with earliness and tardiness penalties</STRONG>.
<EM>Naval Research Logistics Quarterly</EM>, 39:229-245, 1992.
</DD>

<DT> <A NAME="anderson.ferris:parallel"> [AF89] </DT>
<DD>
E. J. Anderson and M. C. Ferris.
<STRONG>Parallel genetic algorithms in optimization</STRONG>.
In <EM>Proceedings of the Fourth SIAM conference on Parallel Processing for
  Scientific Computing, Chicago, Illinois, December 11-13</EM>, 1989.
</DD>

<DT> <A NAME="ferris.mangasarian:minimum"> [FM92] </DT>
<DD>
M. C. Ferris and O. L. Mangasarian.
<STRONG>Minimum principle sufficiency</STRONG>.
<EM>Mathematical Programming</EM>, 57:1-14, 1992.
</DD>

<DT> <A NAME="burke.ferris:characterization"> [BF91] </DT>
<DD>
J. V. Burke and M. C. Ferris.
<STRONG>Characterization of solution sets of convex programs</STRONG>.
<EM>Operations Research Letters</EM>, 10:57-60, 1991.
</DD>

<DT> <A NAME="ferris:parallel*1"> [Fer89] </DT>
<DD>
M. C. Ferris.
<STRONG>Parallel solution of extremely large knapsack problems</STRONG>.
Technical Report 842, Computer Sciences Department, University of Wisconsin,
  Madison, Wisconsin, 1989.
</DD>

<DT> <A NAME="ferris.mangasarian:finite"> [FM91] </DT>
<DD>
M. C. Ferris and O. L. Mangasarian.
<STRONG>Finite perturbation of convex programs</STRONG>.
<EM>Applied Mathematics and Optimization</EM>, 23:263-273, 1991.
</DD>

<DT> <A NAME="ferris:iterative"> [Fer90] </DT>
<DD>
M. C. Ferris.
<STRONG>Iterative linear programming solution of convex programs</STRONG>.
<EM>Journal of Optimization Theory and Applications</EM>, 65:53-65, 1990.
</DD>

<DT> <A NAME="ferris:finite"> [Fer91] </DT>
<DD>
M. C. Ferris.
<STRONG>Finite termination of the proximal point algorithm</STRONG>.
<EM>Mathematical Programming</EM>, 50:359-366, 1991.
</DD>

<DT> <A NAME="ferris:weak*1"> [Fer88] </DT>
<DD>
M. C. Ferris.
<STRONG>Weak sharp minima and penalty functions in mathematical
  programming</STRONG>.
Technical Report 779, Computer Sciences Department, University of Wisconsin,
  Madison, Wisconsin, 1988.
</DD>

<DT> <A NAME="ferris.philpott:interior"> [FP89] </DT>
<DD>
M. C. Ferris and A. B. Philpott.
<STRONG>An interior point algorithm for semi-infinite linear
  programming</STRONG>.
<EM>Mathematical Programming</EM>, 43:257-276, 1989.
</DD>

<DT> <A NAME="ferris.philpott:performance"> [FP88] </DT>
<DD>
M. C. Ferris and A. B. Philpott.
<STRONG>On the performance of Karmarkar's algorithm</STRONG>.
<EM>Journal of the Operational Research Society</EM>, 39:257-270, 1988.
</DD>

<DT> <A NAME="ferris:weak"> [Fer88] </DT>
<DD>
M. C. Ferris.
<STRONG>Weak Sharp Minima and Penalty Functions in Mathematical
  Programming</STRONG>.
PhD thesis, University of Cambridge, England, 1988.
</DD>

<DT> <A NAME="ferris:linear*1"> [Fer85] </DT>
<DD>
M. C. Ferris.
<STRONG>Linear programming and minimum weight design - A comparison of methods
  for solving a class of structural optimization problems</STRONG>.
Master's thesis, University of Cambridge, England, 1985.
</DD>

</DL>
</BODY>
</HTML>