作者: Y. Liu , K.L. Teo , X.Q. Yang
DOI: 10.1016/S0377-2217(98)90203-X
关键词: Regular polygon 、 Rate of convergence 、 Mathematics 、 Efficient frontier 、 Space (mathematics) 、 Applied mathematics 、 Mathematical optimization 、 Optimization problem 、 Block (data storage)
摘要: Based on the triangle sandwich and block methods, two approximation methods for non-convex curves are considered in this paper. Numerical algorithms corresponding to these developed quadratic convergence properties of original space established. Application is given an efficient frontier a bi-criteria optimization problem.