From: Jean-François Couchot <couchot@bilbo.iut-bm.univ-fcomte.fr>
Date: Tue, 10 Dec 2013 15:03:57 +0000 (+0100)
Subject: init
X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/bibliographie.git/commitdiff_plain/42feb8bd70d22c12363b6260596d893c2ed56ffe?ds=inline;hp=-c

init
---

42feb8bd70d22c12363b6260596d893c2ed56ffe
diff --git a/bib/biblioand.bib b/bib/biblioand.bib
index 1dc7a4b..64ae71d 100644
--- a/bib/biblioand.bib
+++ b/bib/biblioand.bib
@@ -496,22 +496,26 @@ c% This file was created with JabRef 2.3.1.
 }
 
 
+
 @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}
-}
+ author = {Byrd, Richard H. and Lu, Peihuang and Nocedal, Jorge and Zhu, Ciyou},
+ title = {A Limited Memory Algorithm for Bound Constrained Optimization},
+ journal = {SIAM J. Sci. Comput.},
+ issue_date = {Sept. 1995},
+ volume = {16},
+ number = {5},
+ month = sep,
+ year = {1995},
+ issn = {1064-8275},
+ pages = {1190--1208},
+ numpages = {19},
+ url = {http://dx.doi.org/10.1137/0916069},
+ doi = {10.1137/0916069},
+ acmid = {210980},
+ publisher = {Society for Industrial and Applied Mathematics},
+ address = {Philadelphia, PA, USA},
+ keywords = {bound constrained optimization, large-scale optimization, limited memory method, nonlinear optimization, quasi-Newton method},
+} 
 
 @article{ANU:1770520,
 author = {Powell,M. J. D.},
@@ -529,5 +533,26 @@ URL = {http://journals.cambridge.org/article_S0962492900002841},
 
 
 
-
-
+@ARTICLE{HLG09, 
+author={Yifeng He and Lee, I. and Ling Guan}, 
+journal={Circuits and Systems for Video Technology, IEEE Transactions on}, 
+title={Distributed Algorithms for Network Lifetime Maximization in Wireless Visual Sensor Networks}, 
+year={2009}, 
+volume={19}, 
+number={5}, 
+pages={704-718}, 
+keywords={distributed algorithms;video communication;wireless sensor networks;Lagrangian duality;distributed algorithms;network lifetime maximization;numerical simulations;routing scheme;video quality;video sensor nodes;wireless visual sensor networks;Convex optimization;distributed algorithms;network lifetime maximization;power consumption;wireless visual sensor network}, 
+doi={10.1109/TCSVT.2009.2017411}, 
+ISSN={1051-8215},}
+
+@ARTICLE{PM06, 
+author={Palomar, D.P. and Mung Chiang}, 
+journal={Selected Areas in Communications, IEEE Journal on}, 
+title={A tutorial on decomposition methods for network utility maximization}, 
+year={2006}, 
+volume={24}, 
+number={8}, 
+pages={1439-1451}, 
+keywords={distributed algorithms;gradient methods;radio networks;resource allocation;Gauss-Seidel iteration;Jacobi method;Lagrange duality;decomposition method;decoupling technique;distributed algorithm;modular network;network utility maximization;resource allocation;subgradient method;Congestion control;cross-layer design;decomposition;distributed algorithm;network architecture;network control by pricing;network utility maximization;optimization;power control;resource allocation}, 
+doi={10.1109/JSAC.2006.879350}, 
+ISSN={0733-8716},}
\ No newline at end of file