Approximation methods for non-convex curves

Y. Liu; K. L. Teo; Xiaoqi Yang

doi:10.1016/S0377-2217(98)90203-X

Approximation methods for non-convex curves

Y. Liu, K. L. Teo, Xiaoqi Yang

Research output: Journal article publication › Journal article › Academic research › peer-review

4 Citations (Scopus)

Abstract

Based on the triangle sandwich and block sandwich methods, two approximation methods for non-convex curves are considered in this paper. Numerical algorithms corresponding to these methods are developed and quadratic convergence properties of two methods in the original space are established. Application is given to the approximation of an efficient frontier of a bi-criteria optimization problem.

Original language	English
Pages (from-to)	125-135
Number of pages	11
Journal	European Journal of Operational Research
Volume	117
Issue number	1
DOIs	https://doi.org/10.1016/S0377-2217(98)90203-X
Publication status	Published - 16 Aug 1999
Externally published	Yes

ASJC Scopus subject areas

Modelling and Simulation
Management Science and Operations Research
Information Systems and Management

More information

10.1016/S0377-2217(98)90203-X

Cite this

@article{18c86038d81c48cfb9d8b75568611bc4,

title = "Approximation methods for non-convex curves",

abstract = "Based on the triangle sandwich and block sandwich methods, two approximation methods for non-convex curves are considered in this paper. Numerical algorithms corresponding to these methods are developed and quadratic convergence properties of two methods in the original space are established. Application is given to the approximation of an efficient frontier of a bi-criteria optimization problem.",

author = "Y. Liu and Teo, {K. L.} and Xiaoqi Yang",

year = "1999",

month = aug,

day = "16",

doi = "10.1016/S0377-2217(98)90203-X",

language = "English",

volume = "117",

pages = "125--135",

journal = "European Journal of Operational Research",

issn = "0377-2217",

publisher = "Elsevier",

number = "1",

}

TY - JOUR

T1 - Approximation methods for non-convex curves

AU - Liu, Y.

AU - Teo, K. L.

AU - Yang, Xiaoqi

PY - 1999/8/16

Y1 - 1999/8/16

N2 - Based on the triangle sandwich and block sandwich methods, two approximation methods for non-convex curves are considered in this paper. Numerical algorithms corresponding to these methods are developed and quadratic convergence properties of two methods in the original space are established. Application is given to the approximation of an efficient frontier of a bi-criteria optimization problem.

AB - Based on the triangle sandwich and block sandwich methods, two approximation methods for non-convex curves are considered in this paper. Numerical algorithms corresponding to these methods are developed and quadratic convergence properties of two methods in the original space are established. Application is given to the approximation of an efficient frontier of a bi-criteria optimization problem.

UR - http://www.scopus.com/inward/record.url?scp=0344339138&partnerID=8YFLogxK

U2 - 10.1016/S0377-2217(98)90203-X

DO - 10.1016/S0377-2217(98)90203-X

M3 - Journal article

SN - 0377-2217

VL - 117

SP - 125

EP - 135

JO - European Journal of Operational Research

JF - European Journal of Operational Research

IS - 1

ER -

Approximation methods for non-convex curves

Abstract

ASJC Scopus subject areas

More information

Other files and links

Fingerprint

Cite this