In this paper, a new sandwich method is introduced to approximate a co
nvex 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 multip
le of the square root of the inverse of the given error. An applicatio
n to approximation of the efficient frontier of a bi-criteria convex q
uadratic network program is given.