.png){kind=icon}
Return
A method for convex curve approximation
.png){kind=icon}
PRE
AI
DOI：10.1016/0377-2217(95)00368-1.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
convex curve
approximation method
quadratic convergence
bi-criteria network program
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
No organization information available
Cited Papers
ShareSaveBagged Ensemble of Gaussian Process Classifiers for Assessing Rockburst Damage Potential with an Imbalanced Dataset.png)
Mathematics
OAAI
MathematicsIF0
OAAIShareSaveShareSave no more
no more