| 区间上最佳一致逼近解的割平面算法 |
| |
| 引用本文： | 唐恒永.区间上最佳一致逼近解的割平面算法[J].辽宁大学学报(自然科学版),1990,17(2):7-12. |
| |
| 作者姓名： | 唐恒永 |
| |
| 作者单位： | 辽宁大学数学系 |
| |
| 摘 要： | 本文给出了一个求区间上最佳一致逼近解的新方法,该方法用一系列线性规划问题的最优解逼近最佳逼近解,每次迭代充分利用了前次迭代的信息,使计算量大大减少,算法具有一些良好的性质。
|
| 关 键 词： | 最佳一致逼近 线性规划 割平面法 |
Cutting Plane Method for Solution of Best Uniform Approximation on An Interval |
| |
| Tang Hengyong.Cutting Plane Method for Solution of Best Uniform Approximation on An Interval[J].Journal of Liaoning University(Natural Sciences Edition),1990,17(2):7-12. |
| |
| Authors: | Tang Hengyong |
| |
| Institution: | Tang Hengyong Department of Mathematics,Liaoning University |
| |
| Abstract: | In this paper a new method for the solution of the best uniform approximation on an interval is suggested.It approximates the solution of the best approximation with optimal solutions of a sequence of linear programming. Every iteration makes full use of the information of the preceding iteration,so the amount of calculation can be reduced enormously.The algorithm has some other good properties. |
| |
| Keywords: | Best uniform approximation on a discrete point set Best uniform approximation on an interval Linear programming Dual simplex algorithm Cutting plane methods |
| 本文献已被 CNKI 维普 等数据库收录！ |
