From aa54e7d2e1b595a8c835b124208805b7996ba5d5 Mon Sep 17 00:00:00 2001 From: jlnav Date: Fri, 13 Sep 2024 08:56:55 -0500 Subject: [PATCH] tentatively remove tex directory and its contents --- tex/.gitignore | 5 - tex/bibs/masterbib.bib | 627 ------------------------------ tex/images/.gitignore | 0 tex/images/diagram.tex | 87 ----- tex/planning_doc/Makefile | 24 -- tex/planning_doc/planning_doc.tex | 483 ----------------------- 6 files changed, 1226 deletions(-) delete mode 100644 tex/.gitignore delete mode 100644 tex/bibs/masterbib.bib delete mode 100644 tex/images/.gitignore delete mode 100644 tex/images/diagram.tex delete mode 100644 tex/planning_doc/Makefile delete mode 100644 tex/planning_doc/planning_doc.tex diff --git a/tex/.gitignore b/tex/.gitignore deleted file mode 100644 index e85b5d569..000000000 --- a/tex/.gitignore +++ /dev/null @@ -1,5 +0,0 @@ -*/*.pdf -*.aux -*.log -*.bbl -*.blg diff --git a/tex/bibs/masterbib.bib b/tex/bibs/masterbib.bib deleted file mode 100644 index b33e48348..000000000 --- a/tex/bibs/masterbib.bib +++ /dev/null @@ -1,627 +0,0 @@ -@article{Hudson2022, - author = {Hudson, Stephen and Larson, Jeffrey and Navarro, John-Luke and Wild, Stefan M.}, - title = {{libEnsemble: A} Library to Coordinate the Concurrent Evaluation of Dynamic Ensembles of Calculations}, - journal = {IEEE Transactions on Parallel and Distributed Systems}, - volume = {33}, - number = {4}, - pages = {977--988}, - year = {2022}, - doi = {10.1109/TPDS.2021.3082815}, -} - -@PHDTHESIS{condor2004, - author={{Vanden Berghen}, Frank}, - title = {{CONDOR: A} constrained, non-linear, derivative-free parallel - optimizer for continuous, high computing load, noisy objective functions}, - school = {Universit{\'e} Libre de Bruxelles}, - year = {2004}, - type = {{Ph.D.}~Thesis}, - url = {http://www.applied-mathematics.net/optimization/thesis\_optimization.pdf} -} - - -@PHDTHESIS{olsson2014, - author = {Per-Magnus Olsson}, - title = {Methods for Network Optimization - and Parallel Derivative-free - Optimization}, - school = {Link\"{o}ping University}, - year = {2014}, - type = {{Ph.D.}~Thesis}, - url = {http://liu.diva-portal.org/smash/get/diva2:695431/FULLTEXT02.pdf} -} - -@TECHREPORT{dakota2013, - author = {Brian M. Adams and Lara E. Bauman and William J. Bohnhoff and Keith R. - Dalbey and John P. Eddy and Mohamed S. Ebeida and Michael S. Eldred and Patricia D. - Hough and Kenneth T. Hu and John D. Jakeman and Laura P. Swiler and Dena M. Vigil}, - title = {{DAKOTA, A} Multilevel Parallel Object-Oriented Framework for - Design Optimization, Parameter Estimation, Uncertainty - Quantification, and Sensitivity Analysis}, - institution = {Sandia National Laboratories}, - year = {2013}, - type = {Version 5.3.1 Developers Manual}, - url = {https://dakota.sandia.gov/sites/default/files/docs/5.3.1/Developers-5.3.1.pdf} -} - -@article{garcia2013sequential, - title={On sequential and parallel non-monotone derivative-free algorithms - for box constrained optimization}, - author={Garc{\'\i}a-Palomares, Ubaldo M and Garc{\'\i}a-Urrea, Ildemaro J - and Rodr{\'\i}guez-Hern{\'a}ndez, Pedro S}, - journal={Optimization Methods and Software}, - volume={28}, - number={6}, - pages={1233--1261}, - year={2013}, - publisher={Taylor \& Francis} -} - -@article{gray2007algorithm, - title={Algorithm 856: {APPSPACK} 4.0: Asynchronous parallel pattern search for - derivative-free optimization}, - author={Gray, Genetha A and Kolda, Tamara G}, - journal={ACM Transactions on Mathematical Software}, - volume={32}, - number={3}, - pages={485--507}, - year={2006}, - publisher={ACM}, - doi = {10.1145/1163641.1163647}, -} - -@article{garcia2002, - title={New sequential and parallel derivative-free algorithms for - unconstrained minimization}, - author={Garc{\'\i}a-Palomares, Ubaldo M and Rodr{\'\i}guez, Jos{\'e} F}, - journal={SIAM Journal on Optimization}, - volume={13}, - number={1}, - pages={79--96}, - year={2002}, - publisher={SIAM}, - doi = {10.1137/S1052623400370606} -} - -@techreport{LarsonWild2014, - author = {Larson, Jeffrey and Wild, Stefan}, - Institution = {Argonne National Laboratory, Mathematics and Computer Science Division}, - Type = {Preprint}, - Month = {November}, - Number = {ANL/MCS-P5228-1114}, - title = {A Batch, Derivative-free Algorithm for Finding Multiple Local Minima}, - Year = {2014}, - url = {http://www.mcs.anl.gov/publication/batch-derivative-free-algorithm-finding-multiple-local-minima}, -} - -@article{LarsonWild2016, - author = {Jeffrey Larson and Stefan M. Wild}, - title = {A Batch, Derivative-Free Algorithm for Finding Multiple Local Minima}, - journal = {Optimization and Engineering}, - volume = {17}, - number = {1}, - year = {2016}, - pages = {205--228}, - mnote = {ANL/MCS-P5228-1114}, - doi = {10.1007/s11081-015-9289-7}, -} - -@incollection{Marti2010, - year = {2010}, - booktitle = {Handbook of Metaheuristics}, - volume = {146}, - series = {International Series in Operations Research \& Management Science}, - editor = {Gendreau, Michel and Potvin, Jean-Yves}, - doi = {10.1007/978-1-4419-1665-5\_9}, - title = {Advanced Multi-start Methods}, - publisher = {Springer US}, - author = {Mart\'{\i}, R and Moreno-Vega, JM and Duarte, A}, - pages = {265--281}, - language = {English} -} - -@article{He2007, -author = {He, Jian and Verstak, Alex and Watson, Layne T. and Sosonkina, Masha}, -doi = {10.1007/s10589-007-9092-2}, -file = {:home/jlarson/research/articles/art\%3A10.1007\%2Fs10589-007-9092-2.pdf:pdf}, -journal = {Computational Optimization and Applications}, -keywords = {data structures,direct,global search,load balancing,task}, -month = oct, -number = {2}, -pages = {217--245}, -title = {Design and implementation of a massively parallel version of {DIRECT}}, -volume = {40}, -year = {2007} -} - -@article{Huyer1999a, -author = {Huyer, Waltraud and Neumaier, Arnold}, -file = {:home/jlarson/research/articles/Huyer, Neumaier - 1999 - Global optimization by multilevel coordinate search.pdf:pdf}, -journal = {Journal of Global Optimization}, -keywords = {bound constraints,coordinate,global optimization,local optimization}, -number = {1995}, -pages = {1--28}, -publisher = {Springer}, -title = {Global optimization by multilevel coordinate search}, - doi = {10.1023/A:1008382309369}, -volume = {14}, -year = {1999} -} - -@article{Csendes2007, -author = {Csendes, Tibor and P\'{a}l, L\'{a}szl\'{o} and Send\'{\i}n, J. Oscar H. and Banga, Julio R.}, -doi = {10.1007/s11590-007-0072-3}, -file = {:home/jlarson/research/articles/art\%3A10.1007\%2Fs11590-007-0072-3.pdf:pdf}, -journal = {Optimization Letters}, -keywords = {clustering,direct methods,global optimization,numerical tests}, -month = nov, -number = {4}, -pages = {445--454}, -title = {The {GLOBAL} optimization method revisited}, -volume = {2}, -year = {2007} -} - -@article{He2009a, -author = {He, Jian and Verstak, A. and Watson, L.T. and Sosonkina, M.}, -doi = {10.1177/1094342008098462}, -file = {:home/jlarson/research/articles/International Journal of High Performance Computing Applications-2009-Jian He-14-28.pdf:pdf}, -journal = {International Journal of High Performance Computing Applications}, -month = feb, -number = {1}, -pages = {14--28}, -title = {Performance Modeling and Analysis of a Massively Parallel {DIRECT--P}art 1}, -volume = {23}, -year = {2009} -} - -@article{He2009b, -author = {He, Jian and Verstak, A. and Sosonkina, M. and Watson, L.T.}, -doi = {10.1177/1094342008098463}, -file = {:home/jlarson/research/articles/International Journal of High Performance Computing Applications-2009-Jian He-29-41.pdf:pdf}, -journal = {International Journal of High Performance Computing Applications}, -month = feb, -number = {1}, -pages = {29--41}, -title = {Performance Modeling and Analysis of a Massively Parallel {DIRECT--P}art 2}, -volume = {23}, -year = {2009} -} - -@article{Wild2008a, -author = {Wild, Stefan M. and Regis, Rommel G. and Shoemaker, Christine A.}, -doi = {10.1137/070691814}, -file = {:home/jlarson/research/articles/070691814.pdf:pdf}, -journal = {SIAM Journal on Scientific Computing}, -keywords = {derivative-free optimization,nonlinear,radial basis functions,trust-region methods}, -month = jan, -number = {6}, -pages = {3197--3219}, -title = {{ORBIT: Optimization} by Radial Basis Function Interpolation in Trust-Regions}, -volume = {30}, -year = {2008} -} - -@article{Jones1993, -author = {Jones, D. R. and Perttunen, C. D. and Stuckman, B. E.}, -doi = {10.1007/BF00941892}, -file = {:home/jlarson/research/articles/Jones, Perttunen, Stuckman - 1993 - Lipschitzian optimization without the Lipschitz constant.pdf:pdf}, -journal = {Journal of Optimization Theory and Applications}, -keywords = {global optimization,lipschitzian optimization,space,space partitioning}, -month = oct, -number = {1}, -pages = {157--181}, -title = {Lipschitzian optimization without the {Lipschitz} constant}, -volume = {79}, -year = {1993} -} - -@TECHREPORT{Powell2009, - author = {M. J. D. Powell}, - title = {The {BOBYQA} algorithm for bound constrained optimization without derivatives}, - institution = {Department of Applied Mathematics and Theoretical Physics, University of Cambridge}, - year = {2009}, - type = {Technical report}, - number = {DAMTP 2009/NA06}, - month = {aug}, -} - -@techreport{Adelmann2014, - author = {Adelmann, Andreas and Gsell, Achim and Kaman, Tulin and (PSI), Christof Kraus and (IBM), Yves Ineichen and (LANL), Steve Russell and Bi, Yuanjie and Wang, Chuan and (CIAE), Jianjun Yang and {(Thinghua University)}, Hao Zha and Sheehy, Suzanne and (RAL), Chris Rogers and (Cornell), Christopher Mayes}, - institution = {Paul Scherrer Institut}, - title = {The OPAL (Object Oriented Parallel Accelerator Library) Framework}, - url = {http://amas.web.psi.ch/docs/opal/opal\_user\_guide.pdf} -} - -@article{Amundson, - author = {Amundson, James and Lu, Qiming and Stern, Eric}, - journal = {dlr.de}, - title = {Synergia: Driving Massively Parallel Particle Accelerator Simulations with Python}, - url = {http://www.dlr.de/sc/en/Portaldata/15/Resources/dokumente/PyHPC2013/submissions/pyhpc2013\_submission\_12.pdf} -} - -@article{Boender1982, - author = {Boender, C. G. E. and {Rinnooy Kan}, A. H. G. and Timmer, G. T. and Stougie, L.}, - doi = {10.1007/BF01581033}, - journal = {Mathematical Programming}, - keywords = {clustering,confidence interval,global optimization,stochastic methods}, - month = dec, - number = {1}, - pages = {125--140}, - title = {A stochastic method for global optimization}, - volume = {22}, - year = {1982} -} - -@article{Wang, - author = {Wang, Yusong and Borland, Michael and Soliday, Robert}, - journal = {aps.anl.gov}, - pages = {1--7}, - title = {User's Manual for latest Pelegant}, - url = {http://www.aps.anl.gov/Accelerator\_Systems\_Division/Accelerator\_Operations\_Physics/publish/Pelegant\_manual/Pelegant.pdf} -} - -@article{RinnooyKan1987, - author = {{Rinnooy Kan}, A. H. G. and Timmer, G. T.}, - doi = {10.1007/BF02592070}, - journal = {Mathematical Programming}, - keywords = {clustering,global optimization,sampling methods}, - month = sep, - number = {1}, - pages = {27--56}, - title = {Stochastic global optimization methods, part {I: Clustering} methods}, - volume = {39}, - year = {1987} -} - -@article{RinnooyKan1987a, - author = {{Rinnooy Kan}, A. H. G. and Timmer, G. T.}, - doi = {10.1007/BF02592071}, - journal = {Mathematical Programming}, - keywords = {computational experiments,global optimisation}, - month = sep, - number = {1}, - pages = {57--78}, - title = {Stochastic global optimization methods, part {II: Multi} level methods}, - volume = {39}, - year = {1987} -} - -@article{Amundson2006, - author = {Amundson, J. and Spentzouris, P. and Qiang, J. and Ryne, R.}, - doi = {10.1016/j.jcp.2005.05.024}, - journal = {Journal of Computational Physics}, - keywords = {accelerator physics,framework,halo,parallel computing,space charge}, - month = jan, - number = {1}, - pages = {229--248}, - title = {Synergia: An accelerator modeling tool with 3-D space charge}, - volume = {211}, - year = {2006} -} - -@misc{Lusk, - author = {Lusk, Ewing L. and Pieper, Steven C. and Butler, Ralph M.}, - title = {ADLB4 User's Guide}, - url = {https://www.cs.mtsu.edu/~rbutler/adlb/ADLB4.doc} -} - -@article{Gaviano2003, -author = {Gaviano, Marco and Kvasov, Dmitri E. and Lera, Daniela and Sergeyev, Yaroslav D.}, -doi = {10.1145/962437.962444}, -file = {:home/jlarson/research/articles/p469-gaviano.pdf:pdf}, -journal = {ACM Transactions on Mathematical Software}, -month = dec, -number = {4}, -pages = {469--480}, -title = {Algorithm 829: {Software} for Generation of Classes of Test Functions with Known Local and Global Minima for Global Optimization}, -volume = {29}, -year = {2003} -} - -@article{hansen2004reducing, - title={Reducing the time complexity of the derandomized evolution strategy - with covariance matrix adaptation ({CMA-ES})}, - author={Hansen, Nikolaus and M{\"u}ller, Sibylle D and Koumoutsakos, - Petros}, - journal={Evolutionary Computation}, - volume={11}, - number={1}, - pages={1--18}, - year={2003}, - publisher={MIT Press}, - doi = {10.1162/106365603321828970} -} - -@misc{pswarm, - author = {A. Ismael F. Vaz}, - title = {{PS}warm}, - url = {http://www.norg.uminho.pt/aivaz/pswarm/}, - urldate = {Oct.~9, 2015} -} - -@misc{cmaesmatlab, - author = {Nikolaus Hansen}, - title = {{CMA-ES}}, - url = {https://www.lri.fr/~hansen/cmaes_inmatlab.html#matlab}, - urldate = {Oct.~9, 2015} -} - -@article{vaz2007particle, - title={A particle swarm pattern search method for bound constrained global - optimization}, - author={Vaz, A Ismael F and Vicente, Lu{\'\i}s N}, - journal={Journal of Global Optimization}, - volume={39}, - number={2}, - pages={197--219}, - year={2007}, - publisher={Springer}, - doi = {10.1007/s10898-007-9133-5}, -} - -@misc{Finkel, -author = {Finkel, Dan}, -title = {{DIRECT}}, -url = {http://www4.ncsu.edu/$\sim$ctk/Finkel\_Direct/Direct.m}, -urldate = {Oct. 22, 2014} -} - -@article{Custodio2011b, -author = {Cust\'{o}dio, A. L. and Madeira, J. F. A.}, -doi = {10.1007/s10898-014-0224-9}, -file = {:home/jlarson/research/articles/art\%3A10.1007\%2Fs10898-014-0224-9.pdf:pdf;:home/jlarson/research/articles/Cust\'{o}dio, Madeira - 2011 - GLODS Global and Local Optimization using Direct Search.pdf:pdf}, -journal = {Journal of Global Optimization}, -pages = {1--28}, -volume = {62}, -number = {1}, -title = {{GLODS: Global} and Local Optimization using Direct Search}, -year = {2015} -} - -@article{He2009, -author = {He, Jian and Watson, Layne T. and Sosonkina, Masha}, -doi = {10.1145/1527286.1527291}, -file = {:home/jlarson/research/articles/He, Watson, Sosonkina - 2009 - Algorithm 897.pdf:pdf}, -journal = {ACM Transactions on Mathematical Software}, -month = jul, -number = {3}, -pages = {1--24}, -title = {Algorithm 897: {VTDIRECT95: Serial} and parallel codes for the global optimization algorithm {DIRECT}}, -volume = {36}, -year = {2009} -} - -@article{Amundson2009, - author = {Amundson, J F and Macridin, A and Spentzouris, P and Stern, E G}, - doi = {10.1088/1742-6596/180/1/012002}, - journal = {Journal of Physics: Conference Series}, - month = jul, - pages = {012002}, - title = {Advanced computations of multi-physics, multi-scale effects in beam dynamics}, - volume = {180}, - year = {2009} -} - -@phdthesis{Wild2009, - author = {Wild, S. M.}, - number = {January}, - school = {Cornell University}, - title = {Derivative-free optimization algorithms for computationally expensive functions}, - type = {Ph.{D}.~Thesis}, - url = {http://ecommons.cornell.edu/handle/1813/11248}, - year = {2009} -} - -@article{Ineichen2013, - archivePrefix = {arXiv}, - arxivId = {arXiv:1302.2889v1}, - author = {Ineichen, Y and Adelmann, A and Kolano, A and Bekas, C and Curioni, A}, - eprint = {arXiv:1302.2889v1}, - journal = {arXiv:1302.2889}, - keywords = {1,aspects of science and,beam dynamics,biosciences,chemistry,depend on reliable and,fields,high performance computing,introduction,multi-objective optimization,nuclear physics and medicine,particle accelerators play a,particle physics,significant role in many,such as material science,technology,the}, - pages = {1--20}, - title = {A Parallel General Purpose Multi-Objective Optimization Framework, with Application to Beam Dynamics}, - url = {http://arxiv.org/abs/1302.2889}, - year = {2013} -} - -@techreport{Plantenga2009a, - author = {Plantenga, Todd D.}, - institution = {Sandia National Laboratories, Albuquerque, NM and Livermore, CA}, - month = oct, - number = {October}, - title = {{HOPSPACK} 3.0 User Manual}, - year = {2009} -} - -@article{Rudnaya2011, -author = {Rudnaya, M E and {Van den Broek}, W and Doornbos, R M P and Mattheij, R M M and Maubach, J M L}, -doi = {10.1016/j.ultramic.2011.01.034}, -file = {:home/jlarson/research/articles/Rudnaya et al. - 2011 - Defocus and twofold astigmatism correction in HAADF-STEM.pdf:pdf}, -journal = {Ultramicroscopy}, -keywords = {Astigmatism,Autofocus,Automatic focusing,Derivative-free optimization,HAADF-STEM,Nelder–Mead simplex method,Scanning transmission electron microscopy,Variance}, -month = jul, -number = {8}, -pages = {1043--54}, -publisher = {Elsevier}, -title = {Defocus and twofold astigmatism correction in {HAADF-STEM}}, -volume = {111}, -year = {2011} -} - -@inproceedings{Rudnaya2010, -address = {Lisbon, Portugal}, -author = {Rudnaya, M. E. and Kho, S. C. and Mattheij, R. M. M. and Maubach, J. M. L.}, -booktitle = {Proceedings of the 2nd International Conference on Engineering Optimization}, -file = {:home/jlarson/research/articles/Rudnaya et al. - 2010 - Derivative-free optimization for autofocus and astigmatism correction in electron microscopy.pdf:pdf}, -keywords = {astigmatism correction,autofocus,derivative-free optimization,electron microscopy,image}, -pages = {1--10}, -title = {Derivative-free optimization for autofocus and astigmatism correction in electron microscopy}, -url = {http://www.dem.ist.utl.pt/engopt2010/Book\_and\_CD/Papers\_CD\_Final\_Version/pdf/06/01059-01.pdf}, -year = {2010} -} - -@article{More2009, -author = {Mor\'{e}, Jorge J. and Wild, Stefan M.}, -doi = {10.1137/080724083}, -file = {:home/jlarson/research/articles/Mor\'{e}, Wild - 2009 - Benchmarking Derivative-Free Optimization Algorithms.pdf:pdf}, -journal = {SIAM Journal on Optimization}, -keywords = {080724083,10,1137,65k10,65y20,90c56,ams subject classifications,benchmarking,computational budget,derivative-free optimization,deterministic,doi,performance evaluation,simulations}, -month = jan, -number = {1}, -pages = {172--191}, -title = {Benchmarking Derivative-Free Optimization Algorithms}, -volume = {20}, -year = {2009} -} - -@article{Easterling2014a, -author = {Easterling, David R. and Watson, Layne T. and Madigan, Michael L. and Castle, Brent S. and Trosset, Michael W.}, -doi = {10.1007/s10589-013-9592-1}, -file = {:home/jlarson/research/articles/Easterling et al. - 2014 - Parallel deterministic and stochastic global minimization of functions with very many minima.pdf:pdf}, -journal = {Computational Optimization and Applications}, -keywords = {10,1007,annealing,article,authorized,biomechanics,contains supplementary material,deterministic optimization,direct,doi,electronic supplementary material the,knitro,online version of this,qnstop,quadratic optimization,s10589-013-9592-1,simulated,simulated annealing,stochastic optimization,which is available to}, -number = {2}, -pages = {469--492}, -title = {Parallel deterministic and stochastic global minimization of functions with very many minima}, -volume = {57}, -year = {2014} -} - -@article{Hough2001, - author = {Patricia D. Hough and Tamara G. Kolda and Virginia J. Torczon}, - title = {Asynchronous parallel pattern search for nonlinear optimization}, - journal = {SIAM Journal on Scientific Computing}, - year = {2001}, - volume = {23}, - pages = {134--156}, - number = {1}, - doi = {10.1137/S1064827599365823}, -} - -@BOOK{ATAZ89, - title = {Global optimization}, - publisher = {Springer-Verlag}, - year = {1989}, - author = {Aimo T{\"o}rn and Antanas Zilinskas}, - address = {New York}, - isbn = {0-387-50871-6}, - doi = {10.1007/3-540-50871-6}, -} - -@article{Gheribi20111323, - title = "Calculating all local minima on liquidus surfaces using the {FactSage} software and databases and the {Mesh Adaptive Direct Search} algorithm ", - journal = "The Journal of Chemical Thermodynamics", - volume = "43", - number = "9", - pages = "1323--1330", - year = "2011", - doi = "10.1016/j.jct.2011.03.021", - author = "Aimen E. Gheribi and Christian Robelin and S\'ebastien {Le Digabel} and Charles Audet and Arthur D. Pelton", -} - -@article{doi:10.1137/070707518, - author = {Charles Audet and J. E. {Dennis, Jr.} and S\'ebastien {Le Digabel}}, - title = {Parallel Space Decomposition of the Mesh Adaptive Direct Search Algorithm}, - journal = {SIAM Journal on Optimization}, - volume = {19}, - number = {3}, - pages = {1150--1170}, - year = {2008}, - doi = {10.1137/070707518}, -} - -@article{McKay1979, - title = {A Comparison of Three Methods for Selecting Values of Input Variables in the Analysis of Output from a Computer Code}, - author = {McKay, M. D. and Beckman, R. J. and Conover, W. J.}, - journal = {Technometrics}, - volume = {21}, - number = {2}, - pages = {239--245}, - doi = {10.2307/1268522}, - abstract = {Two types of sampling plans are examined as alternatives to simple random sampling in Monte Carlo studies. These plans are shown to be improvements over simple random sampling with respect to variance for a class of estimators which includes the sample mean and the empirical distribution function.}, - year = {1979}, - publisher = {Taylor \& Francis, Ltd. on behalf of American Statistical Association and American Society for Quality}, -} - -@TECHREPORT{LiuzziTruemper, - author = {Giampaolo Liuzzi and Klaus Truemper}, - title = {Parallelized hybrid optimization methods for nonsmooth problems - using {NOMAD} and linesearch}, - institution = {University of Texas at Dallas}, - url = {http://www.utdallas.edu/~klaus/Wpapers/hybrid.pdf}, -} - -@inproceedings{lin2011parallel, - title={Parallel exploitation in estimated basins of attraction: a new derivative-free optimization algorithm}, - author={Lin, Ying and Zhong, Jing-Hui and Zhang, Jun}, - booktitle={Proceedings of the 13th Annual Conference on Genetic and Evolutionary Computation}, - pages={133--138}, - year={2011}, - urlout={https://www.lri.fr/~hansen/proceedings/2011/GECCO/proceedings/p133.pdf}, - organization={ACM}, - doi ={10.1145/2001576.2001595} -} - -@article{Dalcin2008, - title = "{MPI} for {Python}: Performance improvements and {MPI-2} extensions ", - journal = "Journal of Parallel and Distributed Computing ", - volume = "68", - number = "5", - pages = "655--662", - year = "2008", - note = "", - issn = "0743-7315", - doi = "10.1016/j.jpdc.2007.09.005", - author = "Lisandro Dalc\'{i}n and Rodrigo Paz and Mario Storti and Jorge D'El\'{i}a", -} - -@Misc{petsc-web-page, - author = {Satish Balay and Shrirang Abhyankar and Mark~F. Adams and Jed Brown and Peter Brune - and Kris Buschelman and Lisandro Dalcin and Victor Eijkhout and William~D. Gropp - and Dinesh Kaushik and Matthew~G. Knepley - and Lois Curfman McInnes and Karl Rupp and Barry~F. Smith - and Stefano Zampini and Hong Zhang}, - title = {{PETS}c {W}eb page}, - url = {http://www.mcs.anl.gov/petsc}, - uncommenthowpublished = {\url{http://www.mcs.anl.gov/petsc}}, - year = {2017} -} - -@Misc{nlopt, - author = {Steven G. Johnson}, - title = {The {NLopt} nonlinear-optimization package}, - url = {http://ab-initio.mit.edu/nlopt}, - uncommenthowpublished = {\url{http://ab-initio.mit.edu/nlopt}}, - year = {2017} -} - -@article{Caveetal2002, -author = {Robert J. Cave and Kieron Burke and Edward W. {Castner, Jr.}}, -title = {Theoretical Investigation of the Ground and Excited States of {Coumarin} 151 and {Coumarin} 120}, -journal = {Journal of Physical Chemistry A}, -volume = {106}, -number = {40}, -pages = {9294--9305}, -year = {2002}, -doi = {10.1021/jp026071x}, -} - -@book{RossProb8, - address = {Upper Saddle River, NJ}, - author = {Ross, Sheldon M.}, - edition = {8}, - isbn = {0131218026}, - publisher = {Prentice Hall}, - title = {A First course in probability}, - year = 2009 -} - -@inproceedings{besserud2008architectural, - title={Architectural Genomics, Silicon + Skin: Biological Processes and Computation}, - author={Besserud, Keith and Cotten, Joshua}, - booktitle={Proceedings of the 28th Annual Conference of the Association for Computer Aided Design in Architecture}, - pages={978--989}, - year={2008} -} diff --git a/tex/images/.gitignore b/tex/images/.gitignore deleted file mode 100644 index e69de29bb..000000000 diff --git a/tex/images/diagram.tex b/tex/images/diagram.tex deleted file mode 100644 index eeeb3c11a..000000000 --- a/tex/images/diagram.tex +++ /dev/null @@ -1,87 +0,0 @@ -\documentclass[tikz,border=1pt,convert={density=300,size=1080x800,outext=.png}]{standalone} -\usepackage{pgfplots,tikz} -\usetikzlibrary{shapes,arrows,decorations.markings,shadows,positioning} -\begin{document} -\boldmath -\everymath{\mathsf{\xdef\mysf{\mathgroup\the\mathgroup\relax}}\mysf} - -% \definecolor{doegreen}{RGB} {16,102,54} -\definecolor{ArgonneLogoBlue}{RGB}{4,146,210} -\definecolor{ArgonneLogoRed}{RGB}{228,32,41} -\definecolor{ArgonneLogoGreen}{RGB}{120,202,42} - -% Define the layers to draw the diagram -\pgfdeclarelayer{background} -\pgfdeclarelayer{foreground} -\pgfsetlayers{background,main,foreground} - -% Define block styles used later -\tikzstyle{box}=[draw, fill=blue!30, text width=6em, text centered, rounded corners, minimum height=2.5em] - -\tikzstyle{textbox} = [above, text width=6em, text centered] - -\tikzstyle{redshape}=[draw, fill=ArgonneLogoRed!10, text width=8em, text centered, dashed, rounded corners, minimum height=2.5em, ] - -\tikzstyle{activesimbox} = [box, fill=ArgonneLogoGreen!50] -\tikzstyle{activegenbox} = [box, fill=ArgonneLogoBlue!50] -\tikzstyle{completedgenbox} = [box, very thick, fill=ArgonneLogoBlue!50] -\tikzstyle{completedsimbox} = [box, very thick, fill=ArgonneLogoGreen!50] - -\tikzstyle{linea} = [draw, thick, shorten >=1pt, shorten <=1pt, >=latex] - -% Define distances -\def\spaceinmanager{0.6} -\def\spaceinworkers{0.8} - -\begin{tikzpicture}[scale=1.0, every node/.style={scale=1.0},font=\bfseries\sffamily, text=black] -% \begin{tikzpicture}[scale=1.0, every node/.style={scale=1.0}] - - % Title the two groups. Distances will be anchored on these titles - \node (mantitle) [textbox] {libEnsemble Manager}; - \path (mantitle.east)+(4.0,-0.2) node (workertitle) [textbox] {Workers}; - - % Make the manager contents - \node [redshape,below=0.2 of mantitle] (recv) {Receive}; - \node [draw, below=\spaceinmanager of recv, redshape] (update) {Update active and queue}; - \node [draw, below=\spaceinmanager of update, redshape] (decide) {Decide work\\and resources}; - \node (give) [redshape, below=\spaceinmanager of decide] {Give work}; - - % Make worker boxes - \path (workertitle.south)+(0,-\spaceinworkers) node (worker1) [activesimbox] {active simulation}; - \path (worker1.south)+(0,-\spaceinworkers) node (worker2) [completedgenbox] {completed generation}; - \path (worker2.south)+(0,-\spaceinworkers) node (worker3) [activesimbox] {active simulation}; - \path (worker3.south)+(0,-\spaceinworkers) node (dots2) [textbox] {$\vdots$}; - \path (dots2.south)+(0,-\spaceinworkers) node (worker4) [completedsimbox] {completed simulation}; - - % Make lines in manager - \path [linea, ->] (recv.south) to (update.north); - \path [linea, ->] (update.south) to (decide.north) ; - \path [linea, ->] (decide.south) to (give.north); - - \path [linea, <-, color=black!40] (recv.east) to (worker2.west); - \path [linea, <-, color=black!40] (recv.east) to (worker4.west); - \path [linea, ->, color=black] (give.east) to node [above=-2.5pt,sloped] {simulation} node [below=-2.5pt,sloped] {work} (worker2.west); - \path [linea, ->, color=black] (give.east) to node [above=-2.5pt,sloped] {simulation} node [below=-2.5pt,sloped] {work} (worker4.west); - - % Bottom title - % \path (give.south) + (0,-1) node (bottomlabel) {(A)POSMM Diagram}; - - % Manager background - \begin{pgfonlayer}{background} - \path (recv.west |- recv.north)+(-0.2,0.2) node (a) {}; - \path (give.east |- give.south)+(0.2,-0.2) node (c) {}; - - \path[fill=ArgonneLogoRed!20, rounded corners, draw=black, very thick] - (a) rectangle (c); - \end{pgfonlayer} - - % Worker's background - \begin{pgfonlayer}{background} - \path (worker1.west |- mantitle.north)+(-0.2,0.0) node (a2) {}; - \path (worker4.east |- c)+(0.2,0.0) node (c2) {}; - - \path[fill=black!10] - (a2) rectangle (c2); - \end{pgfonlayer} -\end{tikzpicture} -\end{document} diff --git a/tex/planning_doc/Makefile b/tex/planning_doc/Makefile deleted file mode 100644 index 5175b5157..000000000 --- a/tex/planning_doc/Makefile +++ /dev/null @@ -1,24 +0,0 @@ -SOURCE = planning_doc -TEXFILES = *.tex -PICS = ../images -BIBFILES = ../bibs/*.bib - -all: $(SOURCE).pdf - -$(SOURCE).pdf: $(TEXFILES) $(BIBFILES) $(PICS) - pdflatex $(SOURCE).tex - bibtex $(SOURCE) - pdflatex $(SOURCE).tex - pdflatex $(SOURCE).tex - -#$(preprint).pdf: $(TEXFILES) -# pdflatex $(preprint).tex - -#$(response).pdf: $(TEXFILES) -# pdflatex $(response).tex - -view: $(SOURCE).pdf - open $(SOURCE).pdf -clean: - -rm -f $(SOURCE).log $(SOURCE).aux $(SOURCE).bbl $(SOURCE).blg \ - $(SOURCE).pdf $(SOURCE).out *.backup *.tex~ *.log diff --git a/tex/planning_doc/planning_doc.tex b/tex/planning_doc/planning_doc.tex deleted file mode 100644 index e04f773d5..000000000 --- a/tex/planning_doc/planning_doc.tex +++ /dev/null @@ -1,483 +0,0 @@ -\documentclass{article} - -\usepackage{listings} -\usepackage{amsmath, amsfonts, amssymb, setspace, color, graphicx}%psfrag}%,pstool} -\usepackage[american]{babel} -\usepackage[normalem]{ulem} % For \sout -\usepackage{fullpage} -\everymath{\displaystyle} -\usepackage[ruled,vlined]{algorithm2e} - -\newenvironment{allintypewriter}{\ttfamily}{\par} -\newcommand{\jlnote}[1]{\textsf{{\color{blue}{ JL note:} #1.} }\marginpar{{\textbf{Comment}}}} -\newcommand{\ps}[1]{\ensuremath{\mathtt{#1}}} -\newcommand{\libE}{\texttt{libEnsemble}\xspace} - -\newcommand{\algref}[1]{{\rm Algorithm}~\ref{alg:#1}} - -\title{\libE planning document} - -\begin{document} -\maketitle -\begin{abstract} - This document will be an explicit plan of what will be developed in - \libE. Proper planning should help ensure that the code will be flexible - and easy to adjust in the future. - - Current development considers a manager and worker framework. -\end{abstract} - -In order to ensure applicability to a variety of use cases, -\libE will coordinate many different types of calculations. Examples of -such calculations include: -\begin{itemize} - \item Simulation evaluations - \item Generation of point(s) to be evaluated by the simulation(s) - \item Updating points in the active queue - \item Updating active simulations - \item Monitoring intermediate output from simulations -\end{itemize} -Users will only need to provide scripts for simulation evaluation and point -generation. We will provide default scripts for the other types of calculations, -which can be templates for the interested user. As a default the Manager will -perform many calculations itself (essentially blocking the manager), but we can -monitor this in the future and adjust as needed if manager-calculations are -expensive. - -We outline the behavior of the manager and worker within \libE: - -\noindent \textbf{Manager} -\begin{itemize} - \item Generates inputs for calculations. - \begin{itemize} - \item If the calculation is a simulation, determine parameters to be - evaluated. - \item If the calculation is a local optimization run, give state - information for determining the next point in a run. - \item If the calculation is deciding where to start a run, then give all - evaluated (and about-to-be-evaluated) points. - \end{itemize} - \item Launches calculations - \begin{itemize} - \item Possibly resume previously paused calculations - \end{itemize} - \item Received output from calculations - \begin{itemize} - \item Possibly receive intermediate output - \end{itemize} - \item Coordinates concurrent calculations - \begin{itemize} - \item Dynamic queue of pending calculations - \item Possibly monitor sims - \end{itemize} - \item Tracks history of calculations - \item Allocated resource to calculations - \begin{itemize} - \item Possibly changes resources during calculations (or just simulations) - \end{itemize} - \item Tolerates failed calculations (or just simulations) - \begin{itemize} - \item Possibly without losing the resource when possible - \end{itemize} - \item Can exploit persistent data - \begin{itemize} - \item For example: checkpointing, meshes, iterative solvers - \end{itemize} - \item Can gracefully terminate calculations - \begin{itemize} - \item Possibly pause - \end{itemize} -\end{itemize} - -\noindent \textbf{Worker} -\begin{itemize} - \item Performs the calculations given to it. - \item An undivisible unit (though many workers may combine to perform one task). Examples: - \begin{itemize} - \item If the simulation is an MPI executable, one worker may call - \begin{center} - \texttt{mpiexec -np 32 -machinefile two\_nodes a.out} - \end{center} - \item If the simulation accepts an MPI subcommunicator, many workers may - form a subcommunicator, and all are involved in the simulation - evaluation (and one worker will report back to the manager). - \end{itemize} -\end{itemize} - -\section{Pseudocode} - -We outline the logic of the the manager and the workers in \algref{manager} and \algref{worker}, respectively. - -\LinesNumbered -\begin{algorithm}[H] - \SetKwComment{Comment}{$\triangleright$\ }{} - \SetAlgoNlRelativeSize{-5} - \SetKwInOut{Input}{input} - \SetKwInOut{Optional}{optional} - \SetKwInOut{Output}{output} - \SetKw{true}{true} - \SetKw{false}{false} - \Input{Simulations $\mathtt{sim}_1,\ldots,\mathtt{sim}_{n_s}$, \newline - Point generating function $\mathtt{gen}$, \newline - $c$ workers - } - \Optional{Termination test $\mathtt{term\_test}$ \newline - Active simulation and queue update function $\mathtt{update\_active\_and\_queue}$ \newline - Function to decide calculations and resources $\mathtt{decide\_work\_and\_resources}$ - } - Initialize history $H$ (information about past and current and possible future calculations)\\ - - \While{$\mathtt{term\_test}(H)$} - { - \While{Any worker is waiting to return $\mathtt{sim}$ or $\mathtt{gen}$ results} - { - Receive from all workers with $\mathtt{sim}$ and $\mathtt{gen}$ work\\ - } - - $(H) = \mathtt{update\_active\_and\_queue}(H)$\Comment*[r]{blocks manager} - $(W_s, W_g) = \mathtt{decide\_work\_and\_resources}(H)$\Comment*[r]{blocks manager} - - \For{Each idle worker $i$} - { - \eIf{ worker $i \in W_s$} - { - Tell worker $i$ to evaluate $\mathtt{sim}_j$ at point(s) from $H$ with appropriate resources - }{ - Begin worker $i$ on $\mathtt{gen}(H)$\\ - } - } - } - Receive from active workers\\ - Terminate all workers - \caption{\libE manager logic \label{alg:manager}} -\end{algorithm} - -\LinesNumbered -\begin{algorithm}[H] - \SetKwComment{Comment}{$\triangleright$\ }{} - \SetAlgoNlRelativeSize{-5} - \SetKwInOut{Input}{input} - \SetKw{true}{true} - \SetKw{false}{false} - \SetKw{none}{none} - \Input{\none} - - \SetKw{break}{break} - \While{\true} - { - $D =$ Receive from manager \\ - \If{$D.tag == \mathtt{stop\_tag}$ }{\break} - - \If{$D.form\_subcomm$ is nonempty}{Form subcommunicator $sc$ with other workers} - - \If{Necessary parts of calculation are not initialized}{(Collectively) initialize} - - $O = D.calc\_f(sc, D.calc\_params)$ - - \If{First element in subcommunicator $sc$}{Report $O$ to manager} - - } - \caption{Each \libE worker's logic \label{alg:worker}} -\end{algorithm} - -\section{API} -We now outline the API for \libE and the two functions expected by \libE: the -simulation and the generating functions. - -\begin{allintypewriter} - libE(c, allocation\_specs, sim\_specs, failure\_processing, exit\_criteria)\\ - % history, - - \begin{description} - \item[c]: [dict] - \begin{description} - \item['comm']: [mpi4py communicator] to be used by libE - \item['color']: [int] communicator color - \end{description} - - \item[allocation\_specs]: [dict] - \begin{description} - \item[manager\_ranks]: [set of ints] - \item[worker\_ranks]: [set of ints] - \item[machinefile]: - \end{description} - - \item[sim\_specs]: [dict] - \begin{description} - \item[f]: [list of funcs] that calls each sim(s) - \item[in]: [list] string keys that sim wants from history (assumed common to all sims) - \item[out]: [list of tuples] (string keys, type, [size>1]) sim outputs (assumed common to all sims) - \item[params]: [list of dicts] parameters for each f - \end{description} - - \item[gen\_specs]: [dict] - \begin{description} - \item[f]: [func] generates points to be evaluated by a sim - \item[in]: [list] string keys that gen wants from history - \item[out]: [list of tuples] (string keys, type, [size>1]) of gen outputs - \item[params]: [dict] additional parameters for gen\_f. - % E.g.: - % \begin{itemize} - % \item[lb]: [n-by-1 array] lower bound on sim parameters - % \item[ub]: [n-by-1 array] upper bound on sim parameters - % \end{itemize} - \end{description} - - \item[failure\_processing]: [dict] - - \item[exit\_criteria]: [dict] with possible fields: - \begin{description} - \item[sim\_eval\_max]: [int] Stop after this many evaluations. - \item[min\_sim\_f\_val]: [dbl] Stop when a value below this has been found. - \end{description} - - % \item[history]: [numpy structured array] - % \begin{description} - % \item[x]: parameters given to simulation(s) - % \item[f]: simulation value(s) at each x - % \item[...]: - % \item[...]: - % \end{description} - - \end{description} -\end{allintypewriter} - -\subsection{\texttt{sim} API} -The \texttt{sim} calculations will be called by \libE with the following API:\\ - -\begin{allintypewriter} - out = sim\_f(H[sim\_specs['in']][max\_priority\_inds], sim\_specs['out'], - params)\\ -\end{allintypewriter} - -where \texttt{out} is a numpy structured array with keys/value-sizes matching -those in \texttt{sim\_specs[out]}. Note that if \texttt{gen\_f} produces points -with equal priorities, they will given in a batch to a worker. - -\subsection{\texttt{gen} API} -The \texttt{gen} calculations will be called by \libE with the following API:\\ - -\begin{allintypewriter} - out = gen\_f(H[gen\_spec['in']][:H\_ind], gen\_specs['out'], params)\\ -\end{allintypewriter} - -One of the fields in \texttt{out} must be \texttt{'priority'}. Note that all -points with the same priority are given to \texttt{sim\_f} at a time. - -Note that \texttt{sim\_f} receives only a subset of generated points, but -\texttt{gen\_f} receives information from all points (if \texttt{gen\_f['in']} -is nonempty). - -\subsection{Notes:} -The following strings cannot be used in \texttt{gen\_specs['out']} or -\texttt{sim\_specs['out']} because they are reserved for \libE use: -\begin{itemize} - \item \texttt{'priority'} - \item \texttt{'given'} - \item \texttt{'given\_time'} - \item \texttt{'lead\_rank'} - \item \texttt{'returned'} - \item \texttt{'sim\_id'} : The generator can assign this, but users should be - careful doing so. -\end{itemize} - -All values in \texttt{gen\_specs['out']} or \texttt{sim\_specs['out']} are -initialized to 0 (or FALSE for booleans). Just know this, for example, when -assigning 'run\_id' within scripts like \texttt{gen\_specs['f']}. - -Internally, \libE currently maintains a single data structure \texttt{H} which -contains the all history information (from \texttt{sim\_specs['out'] + -gen\_specs['out']}). - -We have considered splitting the history \texttt{H} into multiple data structures. One possible split: - -\begin{allintypewriter} - \begin{itemize} - \item[H\_in]: [numpy structured array] History of all input given to - sim\_f. Rows correspond to each ``simulation evaluation''. Contains fields - in sim\_specs['in']. - - \item[H\_out]: [numpy structured array] History of all simulation output - and derived quantities. Contains fields in sim\_specs['out']+gen\_specs['out'] \ sim\_specs['in'] - \end{itemize} -\end{allintypewriter} - -Reasons for making some type of split from \texttt{H} to \texttt{H\_in} and \texttt{H\_out}: -\begin{description} - \item[When there are repeated evaluations:]\ - \begin{itemize} - \item Deterministic simulations: - \begin{itemize} - \item[+] It is possible to remove a redundant entries from \texttt{H}. E.g., - \begin{allintypewriter} - \begin{itemize} - \item H['x'] - \item H['f'] - \item H['dist\_to\_unit\_bounds'] - \item H['ind\_of\_better\_s'] - \item H['ind\_of\_better\_l'] - \item H['dist\_to\_better\_s'] - \item H['dist\_to\_better\_l'] - \end{itemize} - \end{allintypewriter} - \item[-] Who decides what is put in different ``history parts''? - \end{itemize} - \item Stochastic simulations: - \begin{itemize} - \item[+] It is possible to remove redundant entries from \texttt{H} - (though fewer than in the deterministic case). - \item[-] Now \texttt{H\_in} entries will need to be duplicated and - cross referencing output in \texttt{H\_out} becomes harder. E.g., - if \texttt{'replications'} is an entry in \texttt{sim\_specs['in']} - then there will still be many rows in \texttt{H\_out}. - \end{itemize} - \end{itemize} -\end{description} - -At this time, it seems as if strongest case for splitting is if the simulation -input is very large and stored within \texttt{H} instead of pointers to -existing structures/files/meshes. And even in the case of stochastic -simulations with replications, calling \texttt{sim\_f(x=$x_0$, reps=4)} and -\texttt{sim\_f(x=$x_0$, reps=3)} will require two entries in \texttt{H\_in} and -7 entries in \texttt{H\_out}. - -We'll keep everything in \texttt{H} for now, and consider splitting if we -encounter many such use cases. - -\clearpage -\subsection{Example of calling functions} -% \lstinputlisting[basicstyle=\footnotesize,frame=single,language=Python,title=\lstname,numberstyle=\tiny,numbers=left,firstline=43]{../../code/examples/GKLS_and_uniform_random_sample/call_libE_on_GKLS.py} - -\clearpage -\lstinputlisting[basicstyle=\footnotesize,frame=single,language=Python,title=\lstname,numberstyle=\tiny,numbers=left,firstline=23]{../../code/examples/chwirut_and_aposmm/call_libE_on_chwirut.py} - -\clearpage -\section{Target problems} -There are many types of simulations that we can consider being run in \libE. - -\begin{enumerate} - \item A Python function - \begin{itemize} - \item We assume this is thread-safe. - \item Use cases: - \begin{itemize} - \item 6-hump camel - \item chwirut1.py - \end{itemize} - \end{itemize} - \item An executable - \begin{itemize} - \item May use MPI - \item Must perform evaluations in a manner that won't conflict with other evaluations. - \begin{itemize} - \item Performs read/writes in the directory where it is run (or in a given directory) - \end{itemize} - \item Must be able to tell executable which resources to use. - \begin{itemize} - \item MCS compute node: Can specify CPU - \item Blues: Can specify machinefile - \item Mira: Not going to be addressed by \libE. - \item Theta/Aurora: Unsure how to accomplish this at this time. - \item Cray system: Unsure how to accomplish this at this time. - \end{itemize} - \item Use case: - \begin{itemize} - \item OPAL accelerator simulation [John Power and Nicole Neveu] - \item LAMMPS simulation [Simon Phillpot and Eugene Ragasa] - \end{itemize} - \end{itemize} - \item An MPI simulation with a subcommunicator - \begin{itemize} - \item Possibly stops regularly to communicate with manager - \item Use cases: - \begin{itemize} - \item Possibly the HFBTHO simulation - \end{itemize} - \end{itemize} - \item PETSc simulation - \begin{itemize} - \item Access to complete memory stack - \item Easier to kill/monitor? - \item Use cases: - \begin{itemize} - \item Still considering different possibilities. - \end{itemize} - \end{itemize} -\end{enumerate} - -\clearpage -\section{Initial test cases} -In order to guide the initial development of \libE, we will focus on supporting the following use cases. (Objectives are intentionally selected to be easy to evaluate.) -\begin{enumerate} - \item - \begin{description} - \item[Objective:] 6-hump camel - \item[Generating function:] Uniform sampling on $[0,1]^n$ with different batch sizes - \item[Functionality tested:] \ - \begin{itemize} - \item Handling of different numbers of points given/returned from workers - \end{itemize} - \item[Status:] Completed - \end{description} - \bigskip - \item - \begin{description} - \item[Objective:] chwirut1.py - \item[Generating function:] Multiple POUNDERS runs from $K$ starting points. - \item[Functionality tested:] \ - \begin{itemize} - \item APOSMM in \libE - \end{itemize} - \item[Status:] Completed - \end{description} - \bigskip - \item - \begin{description} - \item[Objective:] chwirut1.py - \item[Generating function:] Same as above, but with APOSMM giving each point and a single residual to be evaluated. - \item[Functionality tested:] \ - \begin{itemize} - \item Being able to give different residuals in APOSMM - \end{itemize} - \item[Status:] Completed - \end{description} - \bigskip - \item - \begin{description} - \item[Objective:] HFBTHO (imbalance)/variable internal tols - \item[Generating function:] POUNDERS with adaptive tolerance attempts - \item[Functionality tested:] \ - \begin{itemize} - \item Variable time to evaluate each residual - \end{itemize} - \item[Status:] Currently working with Jason Sarich to get this implemented. - \end{description} - \bigskip - \item - \begin{description} - \item[Objective:] Eldad and Lauren subsurface (in TAO) - \item[Generating function:] LCAL PDECO Stefan - \item[Functionality tested:] \ - \begin{itemize} - \item Stefan ?? - \end{itemize} - \item[Status:] Looking for a sample average approximation method that can be used to generate points to be evaluated. - \end{description} - \bigskip - \item - \begin{description} - \item[Objective:] chwirut1.py with stochastic noise on each residual - \item[Generating function:] POUNDERS using sample mean with the number of replications determined by iteration number. - \item[Functionality tested:] \ - \begin{itemize} - \item Efficient handling of multiple evaluations of single points - \end{itemize} - \item[Status:] Looking for a sample average approximation method that can be used to generate points to be evaluated. - \end{description} -\end{enumerate} - -\cite{nlopt} - -\bibliographystyle{plain} -\bibliography{../bibs/masterbib} -\end{document}