Hits:

Indexed by:期刊论文

Date of Publication:2011-10-01

Journal:7th International Conference on Scientific Computing and Applications

Included Journals:SCIE、EI、CPCI-S、Scopus

Volume:236

Issue:5,SI

Page Number:699-703

ISSN No.:0377-0427

Key Words:Minimax; Spline; Uniform approximation; Morgan-Scott partition

Abstract:In some optimization problems, min(f(1), ... ,f(n)) usually appears as the objective or in the constraint. These optimization problems are typically non-smooth, and so are beyond the domain of smooth optimization algorithms. In this paper, we construct smooth splines to approximate min(f(1), ... ,f(n)) uniformly so that such optimization problems can be dealt with as smooth ones. (C) 2011 Elsevier B.V. All rights reserved.