{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":1,"comments":0,"pivot_tables":0},"unopened":[],"bounds":{"document_bytes":16777216,"sheet_cells":100000,"run_cost":"one","rows_first":2000,"rows_last":500,"rows_between":2000,"halvings":0,"cell_chars":16384,"cell_head_chars":4096},"cells_cut":0,"cells_raw":0,"read":"whole","date_system":"1900","formulas":"cached_only"}

{"sheet":"report2","index":0,"n_rows":23,"n_cols":5,"rows_kept":23,"cut":false,"hidden":false,"merged":[[0,2,0,3],[0,4,0,5],[1,2,1,3],[1,4,1,5],[2,2,2,3],[2,4,2,5],[3,2,3,3],[4,2,4,3],[5,2,5,3],[6,2,6,3],[7,2,7,3],[8,2,8,3],[9,2,9,3],[16,2,16,3],[17,2,17,3],[20,2,20,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA9910254281003321"]
[null,null,"Autore",null,"Sergeyev Yaroslav D"]
[null,null,"Titolo",null,"Deterministic Global Optimization : An Introduction to the Diagonal Approach / / by Yaroslav D. Sergeyev, Dmitri E. Kvasov"]
[null,null,"Pubbl/distr/stampa",null,"New York, NY : , : Springer New York : , : Imprint : Springer, , 2017"]
[null,null,"ISBN",null,"1-4939-7199-9"]
[null,null,"Edizione",null,"[1st ed. 2017.]"]
[null,null,"Descrizione fisica",null,"1 online resource (X, 136 p. 39 illus.)"]
[null,null,"Collana",null,"SpringerBriefs in Optimization, , 2191-575X"]
[null,null,"Disciplina",null,"519.3"]
[null,null,"Soggetti",null,"Computer programming"]
[{"$nulls":4},"Mathematical optimization"]
[{"$nulls":4},"Computer science - Mathematics"]
[{"$nulls":4},"Programming Techniques"]
[{"$nulls":4},"Optimization"]
[{"$nulls":4},"Mathematics of Computing"]
[{"$nulls":4},"Mathematical Applications in Computer Science"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Nota di bibliografia","Includes bibliographical references."]
[null,null,"Nota di contenuto",null,"1. Lipschitz global optimization -- 2. One-dimensional algorithms and their accleration -- 3. Diagonal approach and efficient paritioning strategies -- 4. Global optimization algorithms based on the non-redundant partitions -- References."]
[null,null,null,"Sommario/riassunto","This book begins with a concentrated introduction into deterministic global optimization and moves forward to present new original results from the authors who are well known experts in the field. Multiextremal continuous problems that have an unknown structure with Lipschitz objective functions and functions having the first Lipschitz derivatives defined over hyperintervals are examined. A class of algorithms using several Lipschitz constants is introduced which has its origins in the DIRECT (DIviding RECTangles) method. This new class is based on an efficient strategy that is applied for the search domain partitioning. In addition a survey on derivative free methods and methods using the first derivatives is given for both one-dimensional and multi-dimensional cases. Non-smooth and smooth minorants and acceleration techniques that can speed up several classes of global optimization methods with examples of applications and problems arising in numerical testing of global optimizationalgorithms are discussed. Theoretical considerations are illustrated through "]
[{"$nulls":4},"engineering applications. Extensive numerical testing of algorithms described in this book stretches the likelihood of establishing a link between mathematicians and practitioners. The authors conclude by describing applications and a generator of random classes of test functions with known local and global minima that is used in more than 40 countries of the world. This title serves as a starting point for students, researchers, engineers, and other professionals in operations research, management science, computer science, engineering, economics, environmental sciences, industrial and applied mathematics to obtain an overview of deterministic global optimization.   ."]