{"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":25,"n_cols":5,"rows_kept":25,"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],[3,2,3,3],[4,2,4,3],[5,2,5,3],[6,2,6,3],[7,2,7,3],[9,2,9,3],[19,2,19,3],[20,2,20,3],[22,2,22,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA9910338258003321"]
[null,null,"Titolo",null,"Approximation and Optimization : Algorithms, Complexity and Applications / / edited by Ioannis C. Demetriou, Panos M. Pardalos"]
[null,null,"Pubbl/distr/stampa",null,"Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019"]
[null,null,"ISBN",null,"3-030-12767-2"]
[null,null,"Edizione",null,"[1st ed. 2019.]"]
[null,null,"Descrizione fisica",null,"1 online resource (244 pages)"]
[null,null,"Collana",null,"Springer Optimization and Its Applications, , 1931-6836 ; ; 145"]
[null,null,"Disciplina",null,"516.11"]
[{"$nulls":4},"511.4"]
[null,null,"Soggetti",null,"Approximation theory"]
[{"$nulls":4},"Mathematical optimization"]
[{"$nulls":4},"Calculus of variations"]
[{"$nulls":4},"Algorithms"]
[{"$nulls":4},"Numerical analysis"]
[{"$nulls":4},"Probabilities"]
[{"$nulls":4},"Approximations and Expansions"]
[{"$nulls":4},"Calculus of Variations and Optimization"]
[{"$nulls":4},"Numerical Analysis"]
[{"$nulls":4},"Probability Theory"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,"Nota di contenuto",null,"Introduction -- Evaluation Complexity Bounds for Smooth Constrained Nonlinear Optimization using Scaled KKT Conditions and High-order Models -- Data-Dependent Approximation in Social Computing -- Multi-Objective Evolutionary Optimization Algorithms for Machine Learning: a Recent Survey -- No Free Lunch Theorem, a Review -- Piecewise Convex-Concave Approximation in the Minimax Norm -- A Decomposition Theorem for the Least Squares Piecewise Monotonic Data Approximation Problem -- Recent Progress in Optimization of Multiband Electrical Filters -- Impact of Error in Parameter Estimations on Large Scale Portfolio Optimization -- Optimal Design of Smart Composites -- Tax Evasion as an Optimal Solution to a Partially Observable Markov Decision Process."]
[null,null,null,"Sommario/riassunto","This book focuses on the development of approximation-related algorithms and their relevant applications. Individual contributions are "]
[{"$nulls":4},"written by leading experts and reflect emerging directions and connections in data approximation and optimization. Chapters discuss state of the art topics with highly relevant applications throughout science, engineering, technology and social sciences. Academics, researchers, data science practitioners, business analysts, social sciences investigators and graduate students will find the number of illustrations, applications, and examples provided useful. This volume is based on the conference Approximation and Optimization: Algorithms, Complexity, and Applications, which was held in the National and Kapodistrian University of Athens, Greece, June 29–30, 2017. The mix of survey and research content includes topics in approximations to discrete noisy data; binary sequences; design of networks and energy systems; fuzzycontrol; large scale optimization; noisy data; data-dependent approximation; networked control systems; machine learning ; optimal design; no free lunch theorem; non-linearly constrained optimization; spectroscopy."]