From: couchot <jf.couchot@gmail.com>
Date: Tue, 3 Dec 2013 14:08:22 +0000 (+0100)
Subject: ajout d'une ref
X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/bibliographie.git/commitdiff_plain/9aadb3604ef52f836ecadc9d6241da6909553e8c

ajout d'une ref
---

diff --git a/bib/biblioand.bib b/bib/biblioand.bib
index 4da6eec..1dc7a4b 100644
--- a/bib/biblioand.bib
+++ b/bib/biblioand.bib
@@ -483,15 +483,6 @@ c% This file was created with JabRef 2.3.1.
 
 
 
-@CONFERENCE{wang2009,
-  author = {Q Wang and C Guyeux and J M. Bahi},
-  title = {A novel pseudo-random generator based on discrete chaotic
-iterations for cryptographic applications},
-  booktitle = {First International Conference on Evolving Internet},
-  year = {2009},
-  owner = {qianxue},
-  timestamp = {2009.10.29}
-}
 
 
 @BOOK{Dev89,
@@ -505,17 +496,38 @@ iterations for cryptographic applications},
 }
 
 
+@article{byrd1995limited,
+  abstract = {An algorithm for solving large nonlinear optimization problems with simple bounds is described. It is based on the gradient projection method and uses a limited memory BFGS matrix to approximate the Hessian of the objective function. It is shown how to take advantage of the form of the limited memory approximation to implement the algorithm efficiently. The results of numerical tests on a set of large problems are reported.},
+  added-at = {2012-09-21T02:02:46.000+0200},
+  author = {Byrd, R. and Lu, P. and Nocedal, J. and Zhu, C.},
+  biburl = {http://www.bibsonomy.org/bibtex/2c7605a5d75473a64f24fb02d2a0a8281/peter.ralph},
+  doi = {10.1137/0916069},
+  eprint = {http://epubs.siam.org/doi/pdf/10.1137/0916069},
+  interhash = {5b3e191b77610d28f48a64125fbd050b},
+  intrahash = {c7605a5d75473a64f24fb02d2a0a8281},
+  journal = {SIAM Journal on Scientific Computing},
+  keywords = {methods optimization original},
+  number = 5,
+  pages = {1190-1208},
+  timestamp = {2012-09-21T02:02:46.000+0200},
+  title = {A Limited Memory Algorithm for Bound}
+}
+
+@article{ANU:1770520,
+author = {Powell,M. J. D.},
+title = {Direct search algorithms for optimization calculations},
+journal = {Acta Numerica},
+volume = {7},
+month = {1},
+year = {1998},
+issn = {1474-0508},
+pages = {287--336},
+numpages = {50},
+doi = {10.1017/S0962492900002841},
+URL = {http://journals.cambridge.org/article_S0962492900002841},
+}
 
 
 
-@ARTICLE{guyeux09-b,
-  author = {Guyeux, Christophe and Bahi, J. M.},
-  title = {Hash functions using chaotic iterations},
-  journal = {Journal of Algorithms \& Computational Technology},
-  year = {2009},
-  note = {To appear},
-  owner = {guyeux},
-  timestamp = {2009.07.12}
-}