首页 › 资源下载 › 其他 › This data set contai › 源码查看

http:^^www.cs.wisc.edu^~olvi^olvi.html

来自「This data set contains WWW-pages collect」· HTML 代码 · 共 390 行 · 第 1/2 页

HTML

390 行

Date: Thu, 07 Nov 1996 19:07:27 GMTServer: NCSA/1.5Content-type: text/htmlLast-modified: Wed, 30 Oct 1996 21:44:44 GMTContent-length: 10103<HTML><HEAD><TITLE> Olvi L. Mangasarian's Home Page </TITLE></HEAD><BODY><H1> <!WA0><!WA0><!WA0><!WA0><!WA0><!WA0><!WA0><!WA0><!WA0><!WA0><!WA0><!WA0><!WA0><!WA0><!WA0><!WA0><!WA0><!WA0><!WA0><!WA0><!WA0><!WA0><!WA0><!WA0><!WA0><!WA0><!WA0><!WA0><!WA0><!WA0><!WA0><!WA0><!WA0><!WA0><!WA0><!WA0><!WA0><!WA0><!WA0><!WA0><!WA0><!WA0><!WA0><!WA0><!WA0><!WA0><IMG ALIGN=MIDDLE SRC="http://www.cs.wisc.edu/~pubs/faculty-info/mangasarian.gif">Olvi L. Mangasarian </H1><BLOCKQUOTE> John von Neumann Professor of Mathematics and Computer Sciences,and member of the Center for the Mathematical Sciences <BR> <BR> Computer Sciences Department <BR> University of Wisconsin <BR> 1210 W. Dayton St. <BR> Madison, WI 53706-1685 <BR> <BR> Telephone: (608) 262-1204 <BR> Fax: (608) 262-9777 <BR> Email: olvi@cs.wisc.edu <BR></BLOCKQUOTE><EM>Ph.D., Harvard University, 1959</EM> <BR><EM>Interests:</EM>Mathematical programming, machine learning, and parallel computing<P><HR><H2> Research Summary </H2>Optimization theory is rich mathematically while being very effectivecomputationally in solving many real-life problems. My interestsin this topic have ranged over a broad spectrum that encompassestheoretical aspects, such as error bounds for mathematical programsand variational inequalities, convergence proofs for parallelgradient and variable distribution algorithms for optimization,smoothing techniques for solving constrained optimization problemsas differentiable nonlinear equations, as well as applicationsto machine learning, both in general and specific contexts. Animportant aspect of my research is the use of mathematical programmingtechniques in diagnosing breast cancer, that has resulted in ahighly accurate computerized diagnostic system in current useat University of Wisconsin Hospitals. <P><P> <HR><H2> Current PhD Students </H2> <MENU>   <li>  <!WA1><!WA1><!WA1><!WA1><!WA1><!WA1><!WA1><!WA1><!WA1><!WA1><!WA1><!WA1><!WA1><!WA1><!WA1><!WA1><!WA1><!WA1><!WA1><!WA1><!WA1><!WA1><!WA1><!WA1><!WA1><!WA1><!WA1><!WA1><!WA1><!WA1><!WA1><!WA1><!WA1><!WA1><!WA1><!WA1><!WA1><!WA1><!WA1><!WA1><!WA1><!WA1><!WA1><!WA1><!WA1><!WA1><A HREF="http://www.cs.wisc.edu/~paulb/paulb.html">	   Paul Bradley </A> </MENU><HR><H2> Recent Publications </H2><!-- Technical Report 96-07 !--><DL><DT> <B> O. L. Mangasarian and M. V. Solodov</B></DT><DD><!WA2><!WA2><!WA2><!WA2><!WA2><!WA2><!WA2><!WA2><!WA2><!WA2><!WA2><!WA2><!WA2><!WA2><!WA2><!WA2><!WA2><!WA2><!WA2><!WA2><!WA2><!WA2><!WA2><!WA2><!WA2><!WA2><!WA2><!WA2><!WA2><!WA2><!WA2><!WA2><!WA2><!WA2><!WA2><!WA2><!WA2><!WA2><!WA2><!WA2><!WA2><!WA2><!WA2><!WA2><!WA2><!WA2><A HREF="ftp://ftp.cs.wisc.edu/math-prog/tech-reports/96-07.ps">A Linearly Convergent Descent Method for Strongly MonotoneComplementarity Problems.</A><BR>Mathematical Programming Technical Report 96-07, October 1996.</DD></DL><!-- Technical Report 96-06 !--><DL><DT> <B> O. L. Mangasarian and Jong-Shi Pang</B></DT><DD><!WA3><!WA3><!WA3><!WA3><!WA3><!WA3><!WA3><!WA3><!WA3><!WA3><!WA3><!WA3><!WA3><!WA3><!WA3><!WA3><!WA3><!WA3><!WA3><!WA3><!WA3><!WA3><!WA3><!WA3><!WA3><!WA3><!WA3><!WA3><!WA3><!WA3><!WA3><!WA3><!WA3><!WA3><!WA3><!WA3><!WA3><!WA3><!WA3><!WA3><!WA3><!WA3><!WA3><!WA3><!WA3><!WA3><A HREF="ftp://ftp.cs.wisc.edu/math-prog/tech-reports/96-06.ps">Exact Penalty Functions for Mathematical Programswith Linear Complementarity Constraints.</A><BR>Mathematical Programming Technical Report 96-06, August 1996.</DD></DL><!-- Technical Report 96-05 !--><DL><DT> <B> O. L. Mangasarian</B></DT><DD><!WA4><!WA4><!WA4><!WA4><!WA4><!WA4><!WA4><!WA4><!WA4><!WA4><!WA4><!WA4><!WA4><!WA4><!WA4><!WA4><!WA4><!WA4><!WA4><!WA4><!WA4><!WA4><!WA4><!WA4><!WA4><!WA4><!WA4><!WA4><!WA4><!WA4><!WA4><!WA4><!WA4><!WA4><!WA4><!WA4><!WA4><!WA4><!WA4><!WA4><!WA4><!WA4><!WA4><!WA4><!WA4><!WA4><A HREF="ftp://ftp.cs.wisc.edu/math-prog/tech-reports/96-05.ps">Mathematical Programming in Data Mining</A><BR>Mathematical Programming Technical Report 96-05, August 1996.</DD></DL><!-- Techincal Report 96-04 !--><DL><DT> <B> O. L. Mangasarian</B></DT><DD><!WA5><!WA5><!WA5><!WA5><!WA5><!WA5><!WA5><!WA5><!WA5><!WA5><!WA5><!WA5><!WA5><!WA5><!WA5><!WA5><!WA5><!WA5><!WA5><!WA5><!WA5><!WA5><!WA5><!WA5><!WA5><!WA5><!WA5><!WA5><!WA5><!WA5><!WA5><!WA5><!WA5><!WA5><!WA5><!WA5><!WA5><!WA5><!WA5><!WA5><!WA5><!WA5><!WA5><!WA5><!WA5><!WA5><A HREF="ftp://ftp.cs.wisc.edu/math-prog/tech-reports/96-04.ps">Error Bounds for Nondifferentiable Convex Inequalities under a Strong Slater Constraint Qualification.</A><BR>Mathematical Programming Technical Report 96-04, July 1996.</DD></DL><!-- Technical Report 96-03 !--><DL><DT> <B> P. S. Bradley, O. L. Mangasarian and W. N. Street</B></DT><DD> <!WA6><!WA6><!WA6><!WA6><!WA6><!WA6><!WA6><!WA6><!WA6><!WA6><!WA6><!WA6><!WA6><!WA6><!WA6><!WA6><!WA6><!WA6><!WA6><!WA6><!WA6><!WA6><!WA6><!WA6><!WA6><!WA6><!WA6><!WA6><!WA6><!WA6><!WA6><!WA6><!WA6><!WA6><!WA6><!WA6><!WA6><!WA6><!WA6><!WA6><!WA6><!WA6><!WA6><!WA6><!WA6><!WA6><A HREF="http://www.cs.wisc.edu/Dienst/UI/2.0/Describe/ncstrl.uwmadison%2fMP-TR-96-03">Clustering via Concave Minimization.</A><BR>Mathematical Programming Technical Report 96-03, May 1996.Submitted to Neural Information Processing Systems 1996.</DD></DL><!-- Technical Report 96-01 !--><DL><DT> <B> W. N. Street, O. L. Mangasarian and W. H. Wolberg</B></DT><DD> <!WA7><!WA7><!WA7><!WA7><!WA7><!WA7><!WA7><!WA7><!WA7><!WA7><!WA7><!WA7><!WA7><!WA7><!WA7><!WA7><!WA7><!WA7><!WA7><!WA7><!WA7><!WA7><!WA7><!WA7><!WA7><!WA7><!WA7><!WA7><!WA7><!WA7><!WA7><!WA7><!WA7><!WA7><!WA7><!WA7><!WA7><!WA7><!WA7><!WA7><!WA7><!WA7><!WA7><!WA7><!WA7><!WA7><A HREF="http://www.cs.wisc.edu/Dienst/UI/2.0/Describe/ncstrl.uwmadison%2fMP-TR-96-01">Individual and Collective Prognostic Prediction.</A><BR>Mathematical Programming Technical Report 96-01, January 1996.</DD></DL><!-- Technical Report 95-21 !--><DL><DT> <B>  P. S. Bradley, O. L. Mangasarian and W. N. Street</B></DT><DD> <!WA8><!WA8><!WA8><!WA8><!WA8><!WA8><!WA8><!WA8><!WA8><!WA8><!WA8><!WA8><!WA8><!WA8><!WA8><!WA8><!WA8><!WA8><!WA8><!WA8><!WA8><!WA8><!WA8><!WA8><!WA8><!WA8><!WA8><!WA8><!WA8><!WA8><!WA8><!WA8><!WA8><!WA8><!WA8><!WA8><!WA8><!WA8><!WA8><!WA8><!WA8><!WA8><!WA8><!WA8><!WA8><!WA8><A HREF="http://www.cs.wisc.edu/Dienst/UI/2.0/Describe/ncstrl.uwmadison%2fMP-TR-95-21">Feature Selection via Mathematical Programming.</A><BR>Mathematical Programming Technical Report 95-21, December 1995.Submitted to INFORMS Journal on Computing.</DD></DL><!-- Technical Report 95-20 !--><DL><DT> <B> O. L. Mangasarian</B></DT><DD> <!WA9><!WA9><!WA9><!WA9><!WA9><!WA9><!WA9><!WA9><!WA9><!WA9><!WA9><!WA9><!WA9><!WA9><!WA9><!WA9><!WA9><!WA9><!WA9><!WA9><!WA9><!WA9><!WA9><!WA9><!WA9><!WA9><!WA9><!WA9><!WA9><!WA9><!WA9><!WA9><!WA9><!WA9><!WA9><!WA9><!WA9><!WA9><!WA9><!WA9><!WA9><!WA9><!WA9><!WA9><!WA9><!WA9><A HREF="http://www.cs.wisc.edu/Dienst/UI/2.0/Describe/ncstrl.uwmadison%2fMP-TR-95-20">Machine Learning via Polyhedral Concave Minimization.</A><BR>Mathematical Programming Technical Report 95-20, November 1995."Applied Mathematics and Parallel Computing -- Festschrift for Klaus Ritter", H. Fischer, B. Riedmueller, S. Schaeffler, editors, Physica-Verlag, Germany 1996, 175-188.</DD></DL><!-- Technical Report 95-15 !--><DL><DT> <B>  O. L. Mangasarian</B></DT><DD> <!WA10><!WA10><!WA10><!WA10><!WA10><!WA10><!WA10><!WA10><!WA10><!WA10><!WA10><!WA10><!WA10><!WA10><!WA10><!WA10><!WA10><!WA10><!WA10><!WA10><!WA10><!WA10><!WA10><!WA10><!WA10><!WA10><!WA10><!WA10><!WA10><!WA10><!WA10><!WA10><!WA10><!WA10><!WA10><!WA10><!WA10><!WA10><!WA10><!WA10><!WA10><!WA10><!WA10><!WA10><!WA10><!WA10><A HREF="http://www.cs.wisc.edu/Dienst/UI/2.0/Describe/ncstrl.uwmadison%2fMP-TR-95-15">The Ill-Posed Linear Complementarity Problem.</A><BR>Mathematical Programming Technical Report 95-15, August 1995.Submitted to SIAM Proceedings of the InternationalSymposium on Complementarity Problems, Baltimore, MD,

http:^^www.cs.wisc.edu^~olvi^olvi.html - 源码说明

本页面展示了「This data set contains WWW-pages collected from computer science departments of various universities」中的 http:^^www.cs.wisc.edu^~olvi^olvi.html 源码文件，采用 HTML 编程语言编写，共 390 行代码。您可以在线阅读完整代码内容，也可以返回资源详情页下载完整源码包进行本地学习和开发。

虫虫下载站收录了大量与universities相关的技术资源，包括源代码、技术文档、电路图等，是电子工程师和嵌入式开发者的专业学习平台。

⌨️ 快捷键说明

复制代码Ctrl + C

搜索代码Ctrl + F

全屏模式F11

增大字号Ctrl + =

减小字号Ctrl + -

显示快捷键?