.png){kind=icon}
返回
A method for convex curve approximation
.png){kind=icon}
PRE
AI
DOI：10.1016/0377-2217(95)00368-1.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, a new sandwich method is introduced to approximate a convex curve in R(2). This method requires only function evaluation and the solution of a number of scalar optimization problems. A quadratic convergence property of the method is established, that is, the total number of optimization problems solved is bounded by a constant multiple of the square root of the inverse of the given error. An application to approximation of the efficient frontier of a bi-criteria convex quadratic network program is given.
Keyword:
convex curve
approximation method
quadratic convergence
bi-criteria network program
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
分享收藏Bagged Ensemble of Gaussian Process Classifiers for Assessing Rockburst Damage Potential with an Imbalanced Dataset.png)
Mathematics
OAAI
MathematicsIF0
OAAI分享收藏分享收藏 没有更多内容
没有更多内容