vavasis@afi.cs.cornell.edu (Stephen Vavasis) (01/24/91)
Workshop on COMPLEXITY ISSUES FOR NUMERICAL OPTIMIZATION Ithaca, New York March 22--23, 1991 Supported by the United States Air Force Office of Scientific Research; the United States Army Research Office through the Mathematical Sciences Institute of Cornell; and Pennsylvania State University. Organized by Panos M. Pardalos (Pennsylvania State University) and Stephen A. Vavasis (Cornell University). Held in cooperation with SIAM. Powerful algorithms have been developed for numerical optimization problems since the 1940's, but these problems remain among the most computationally intensive tasks in existence. In recent years the need has grown to solve problems with large numbers of unknowns. This demands an understanding of the asymptotic behavior of algorithms for these problems. Our understanding of the asymptotic complexity issues has grown immensely in the past 15 years. At this workshop, invited speakers will present state-of-the-art research on new algorithms for optimization problems and their complexity. The workshop will feature approximately 15 invited speakers during a two-day period. There will be no contributed papers. Scheduled speakers include: I. Adler (Berkeley) N. Shor (Kiev) D. Du (Princeton) E. Tardos (Cornell) N. Karmarkar (AT&T Bell Labs) M. Todd (Cornell) V. Klee (Washington) C. Tovey (Georgia Tech) N. Megiddo (IBM and Tel Aviv) P. Vaidya (Illinois) K. Murty (Michigan) G. Wasilkowski (Kentucky) J. Renegar (Cornell) Y. Ye (Iowa) as well as the organizers. Hotel and conference registration is limited. The registration fee is $80. For registration forms and more information, contact: Cindy Robinson-Hubbell Department of Computer Science Upson Hall Cornell University Ithaca, NY 14853 U.S.A. 607-255-9215 cindy@cs.cornell.edu
vavasis@afi.cs.cornell.edu (Stephen Vavasis) (03/01/91)
* * * Second Announcement * * * Workshop on COMPLEXITY ISSUES FOR NUMERICAL OPTIMIZATION Ithaca, New York March 22--23, 1991 Supported by the United States Air Force Office of Scientific Research; the United States Army Research Office through the Mathematical Sciences Institute of Cornell; and Pennsylvania State University. Organized by Panos M. Pardalos (Pennsylvania State University) and Stephen A. Vavasis (Cornell University). Held in cooperation with SIAM. Powerful algorithms have been developed for numerical optimization problems since the 1940's, but these problems remain among the most computationally intensive tasks in existence. In recent years the need has grown to solve problems with large numbers of unknowns. This demands an understanding of the asymptotic behavior of algorithms for these problems. Our understanding of the asymptotic complexity issues has grown immensely in the past 15 years. At this workshop, invited speakers will present state-of-the-art research on new algorithms for optimization problems and their complexity. The workshop will feature approximately 15 invited speakers during a two-day period. There will be no contributed papers. Scheduled speakers include: I. Adler (Berkeley) N. Shor (Kiev) D. Du (Princeton) E. Tardos (Cornell) R. Freund (MIT) M. Todd (Cornell) N. Karmarkar (AT&T Bell Labs) C. Tovey (Georgia Tech) V. Klee (Washington) P. Vaidya (Illinois) N. Megiddo (IBM and Tel Aviv) G. Wasilkowski (Kentucky) K. Murty (Michigan) Y. Ye (Iowa) J. Renegar (Cornell) as well as the organizers. Hotel and conference registration is limited. The registration fee is $80. For registration forms and more information, contact: Cindy Robinson-Hubbell Department of Computer Science Upson Hall Cornell University Ithaca, NY 14853 U.S.A. 607-255-9215 cindy@cs.cornell.edu FAX: 607-255-4428 Note: A special block of hotel rooms is being held for this meeting until MARCH 8. After that, hotel space may be unavailable.
vavasis@CS.CORNELL.EDU (Stephen Vavasis) (03/05/91)
* * * Second Announcement * * * Workshop on COMPLEXITY ISSUES FOR NUMERICAL OPTIMIZATION Ithaca, New York March 22--23, 1991 Supported by the United States Air Force Office of Scientific Research; the United States Army Research Office through the Mathematical Sciences Institute of Cornell; and Pennsylvania State University. Organized by Panos M. Pardalos (Pennsylvania State University) and Stephen A. Vavasis (Cornell University). Held in cooperation with SIAM. Powerful algorithms have been developed for numerical optimization problems since the 1940's, but these problems remain among the most computationally intensive tasks in existence. In recent years the need has grown to solve problems with large numbers of unknowns. This demands an understanding of the asymptotic behavior of algorithms for these problems. Our understanding of the asymptotic complexity issues has grown immensely in the past 15 years. At this workshop, invited speakers will present state-of-the-art research on new algorithms for optimization problems and their complexity. The workshop will feature approximately 15 invited speakers during a two-day period. There will be no contributed papers. Scheduled speakers include: I. Adler (Berkeley) N. Shor (Kiev) D. Du (Princeton) E. Tardos (Cornell) R. Freund (MIT) M. Todd (Cornell) N. Karmarkar (AT&T Bell Labs) C. Tovey (Georgia Tech) V. Klee (Washington) P. Vaidya (Illinois) N. Megiddo (IBM and Tel Aviv) G. Wasilkowski (Kentucky) K. Murty (Michigan) Y. Ye (Iowa) J. Renegar (Cornell) as well as the organizers. Hotel and conference registration is limited. The registration fee is $80. For registration forms and more information, contact: Cindy Robinson-Hubbell Department of Computer Science Upson Hall Cornell University Ithaca, NY 14853 U.S.A. 607-255-9215 cindy@cs.cornell.edu FAX: 607-255-4428 Note: A special block of hotel rooms is being held for this meeting until MARCH 8. After that, hotel space may be unavailable.