Optimizing radial basis functions by d.c. programming and its use in direct search for global derivative-free optimization
No abstract is available for this item.
Volume (Year): 20 (2012)
Issue (Month): 1 (April)
|Contact details of provider:|| Web page: http://www.springer.com|
Web page: http://www.seio.es/
|Order Information:||Web: http://link.springer.de/orders.htm|
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Le An & Pham Tao, 2005. "The DC (Difference of Convex Functions) Programming and DCA Revisited with DC Models of Real World Nonconvex Optimization Problems," Annals of Operations Research, Springer, vol. 133(1), pages 23-46, January.
- L. Ingber & B. Rosen, 1992.
"Genetic algorithms and very fast simulated reannealing: A comparison,"
Lester Ingber Papers
92ga, Lester Ingber.
- L. Ingber & B. Rosen, 1993. "Genetic algorithms and very fast simulated reannealing: A comparison," Lester Ingber Papers 93ga, Lester Ingber.
- Robert Fourer & David M. Gay & Brian W. Kernighan, 1990. "A Modeling Language for Mathematical Programming," Management Science, INFORMS, vol. 36(5), pages 519-554, May. Full references (including those not matched with items on IDEAS)
When requesting a correction, please mention this item's handle: RePEc:spr:topjnl:v:20:y:2012:i:1:p:190-214. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Sonal Shukla)or (Rebekah McClure)
If references are entirely missing, you can add them using this form.