Implicit Filtering and Optimal Design Problems
Implicit filtering is a form of the gradient projection method of Bertsekas in which the stepsize in a difference approximation of the gradient is changed as the iteration progresses. In this way the algorithm is able to avoid certain types of local minima and in some cases find accurate approximations to the global minimum. The algorithm is particularly effective in avoiding local minima that are caused by high-frequency low-amplitude terms in the objective function. In this report we will discuss the algorithm and its theoretical properties. We will also present applications for modeling of subsurface contaminant transport and high-field magnet design.
KeywordsMicrowave GaAs Copper Silver
Unable to display preview. Download preview PDF.
- Y. Eyssa; Electro-magnetic and temperature analysis of pulsed magnets, to appear in Proc. 14th International Conference on Magnet Technology, 1995.Google Scholar
- P. Gilmore; An Algorithm for Optimizing Functions with Multiple Minima, PhD thesis, North Carolina State University, Raleigh, 1993.Google Scholar
- P. Gilmore; IFFCO: implicit filtering for constrained optimization, Tech. Report CRSC-TR93-7, Center for Research in Scientific Computation, North Carolina State University, Raleigh, 1993. (Available by anonymous ftp from math.ncsu.edu in pub/kelley/iffco/ug.ps.)Google Scholar
- P. Gilmore and C. Kelley; An implicit filtering algorithm for optimization of functions with many local minima, SIAM J. Optim., to appear.Google Scholar
- W. Markiewicz, M. Vaghar, I. Dixon, H. Garmestani, and J. Jimeian, Generalized plane strain analysis of solenoid magnets: Formulation and examples, Tech. Report NHMFLIR 93–788, National High Magnetic Field Laboratory, 1993.Google Scholar
- C. Miller and F. Cornew; A Petrov-Galerkin method for resolving advective-dominated transport, in Proceedings of Computational Methods in Water Resources IX, Denver, Colorado, Vol. 1 Numerical Methods in Water Resources, Ed. by T. Russell, R. Ewing, C. Brebbia, W. Gray, and G. Pinder, Computational Mechanics Publications, Southhampton and Boston and Elsevier Applied Science, London and New York, 1992, 157–164.Google Scholar
- D. Montgomery, Solenoid Magnet Design, Krieger, Malabar, 1980.Google Scholar
- J. Neider and R. Mead; A simplex method for function minimization, Comput. J. 7, 1965, 308–313.Google Scholar
- D. Stoneking, G.. Bilbro, R. Trew, P. Gilmore, and C. Kelley; Yield optimization using a GaAs process simulator coupled to a physical device model, in Proc. IEEE/Cornell Conference on Advanced Concepts in High Speed Devices and Circuits, IEEE, 1991, 374–383.Google Scholar
- V. Torczon; On the convergence of pattern search methods, Tech. Report TR93-10, Department of Computational and Applied Mathematics, Rice University, Houston, 1993.Google Scholar
- T. Winslow, R. Trew, P. Gilmore, and C. Kelley; Doping profiles for optimum class B performance of GaAs mesfet amplifiers, in Proc. IEEE/Cornell Conference on Advanced Concepts in High Speed Devices and Circuits, IEEE, 1991, 188–197.Google Scholar
- T. Winslow, R. Trew, P. Gilmore, and C. Kelley; Simulated performance optimization of GaAs MESFET amplifiers, in Proc. IEEE/Cornell Conference on Advanced Concepts in High Speed Devices and Circuits, [EEE, 1991, 393–402.Google Scholar