ISSN:
1436-4646
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
,
Mathematics
Notes:
Abstract In minimizing interior penalty functions, most of the computational time is spent on the one-dimensional search. This paper presents a method for performing this search on barrier functions which is significantly faster than current techniques. The method exploits the special structure of barrier functions. Comparative computational results are given for a set of six test problems.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01584671