Mathematical Sciences: Algorithms for Constrained Approximation and Optimization

讲习班 约束逼近与优化的算法 一九九三年五月二十三日至二十六日 斯托 主办单位： D.佛蒙特大学Zwick R.A. Zalik，奥本大学 约束近似算法研讨会 和优化”将汇集领先的研究人员， 数值分析和近似理论，讨论新的和 创新方法解决该领域的难题 有约束的近似和优化。 与会者， 他们将来自学术界、私人和政府的研究机构， 研究所和工业界大多是这方面的专家， 约束近似或约束优化。 而 问题和技术之间存在非空交集 这两个群体都很熟悉， 和它们之间的杂交。 的目的 拟议的工作坊是提供一个愉快和富有成效的环境 让参与者进行思想交流， 参与者之间的合作研究，并揭露 年轻的研究人员和研究生， 数学在这些领域的前沿。

Workshop on Algorithims for Constrained Approximation and Optimization May 23--26, 1993 Stowe, Vermont The Organizers: D. Zwick, University of Vermont R.A. Zalik, Auburn University The "Workshop on Algorithms for Constrained Approximation and Optimization" will bring together leading researchers in numerical analysis and approximation theory to discuss new and innovative approaches to solving difficult problems in the area of constrained approximation and optimization. The participants, who will come from a academia, private and government research institutes, and industry, are mostly experts in either constrained approximation or constrained optimization. While there is a nonempty intersection in the problems and techniques familiar to these two groups, there has not been much interaction and cross-fertilization between them. The purpose of the proposed workshop is to provide a pleasant and productive setting for participants to engage in an interchange of ideas, to foster collaborative research among the participants, and to expose young researchers and graduate students to the exciting mathematics being done at the forefront of these fields.