American Mathematical Society

My Account · My Cart · Customer Services · FAQ  

AMS Sectional Meeting Program by Special Session

Current as of Tuesday, April 12, 2005 15:08:52


Program  |  Deadlines  |  Inquiries:  meet@ams.org

1991 Central Section Meeting
Fargo, ND, October 25-26, 1991
Meeting #869

Associate secretaries:
Andy R Magid, AMS amagid@ou.edu

Special Session on Constrained Approximation, Theory and Algorithms

  • Friday October 25, 1991, 2:30 p.m.-5:20 p.m.
    Special Session on Constrained Approximation, Theory and Algorithms, I

    Family Life Center, Room 124, Memorial Union

    • 2:30 p.m.
      Constrained best approximation.
      Frank Deutsch*, Pennsylvania State University, University Park
      (869-41-106)
    • 3:00 p.m.
      Recent progress in constrained approximation.
      Joseph Ward*, Texas A\thsp\&\thsp M University, College Station
      (869-41-110)
    • 3:30 p.m.
      A family of natural best L_1-approximants by nondecreasing functions.
      David A. Legg, Indiana University-Purdue University, Ft.\ Wayne
      Douglas W. Townsend*, Indiana University-Purdue University, Ft.\ Wayne
      (869-41-109)
    • 4:00 p.m.
      Strong uniqueness and simultaneous approximation.
      Alan Egger, Idaho State University
      Robert Huotari*, Idaho State University
      Salem M. Sahab, King Abdulaziz University, Saudi Arabia
      (869-41-112)
    • 4:30 p.m.
      Constrained L_p-approximation by generalized convex functions.
      Vasant A. Ubhaya, North Dakota State University, Fargo
      Yuesheng Xu*, North Dakota State University, Fargo
      (869-41-111)
    • 5:00 p.m.
      Best interpolation in a strip.
      A. L. Dontchev*, Mathematical Reviews, Ann Arbor, Michigan
      (869-41-105)
  • Saturday October 26, 1991, 2:00 p.m.-4:50 p.m.
    Special Session on Constrained Approximation, Theory and Algorithms, II

    Family Life Center, Room 319, Memorial Union

    • 2:00 p.m.
      Constrained approximation at IMSL.
      Philip Smith*, International Mathematical Statistics Library Incorporated, Houston, Texas
      (869-41-107)
    • 2:30 p.m.
      The Newton method for convex regression, data smoothing, and quadratic programming with bounded constraints.
      Wu Li, Old Dominion University
      John Swetits*, Old Dominion University
      (869-41-108)
    • 3:00 p.m.
      Estimation and approximation using infinite dimensional convex programs with entropy type objectives.
      Jonathan M. Borwein*, University of Waterloo
      (869-90-32)
    • 3:30 p.m.
      A convex programming approach to constrained approximation.
      Jon Borwein, University of Waterloo
      Adrian Lewis*, University of Waterloo
      (869-49-45)
    • 4:00 p.m.
      Active set algorithms for isotonic regression.
      Michael J. Best*, University of Waterloo
      (869-49-104)
    • 4:30 p.m.
      Generalized convex functions and best L_p approximation.
      Ronald M. Mathsen, North Dakota State University, Fargo
      Vasant A. Ubhaya*, North Dakota State University, Fargo
      (869-41-103)
Inquiries:  meet@ams.org