Approximation and Optimization: Algorithms, Complexity and Applications

✍ Scribed by Ioannis C. Demetriou, Panos M. Pardalos

Publisher: Springer International Publishing
Year: 2019
Tongue: English
Leaves: 244
Series: Springer Optimization and Its Applications 145
Edition: 1st ed.
Category: Library

No coin nor oath required. For personal study only.

✦ Synopsis

This book focuses on the development of approximation-related algorithms and their relevant applications. Individual contributions are 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; fuzzy control; large scale optimization; noisy data; data-dependent approximation; networked control systems; machine learning ; optimal design; no free lunch theorem; non-linearly constrained optimization; spectroscopy.

✦ Table of Contents

Front Matter ....Pages i-x
Introduction (Ioannis C. Demetriou, Panos M. Pardalos)....Pages 1-4
Evaluation Complexity Bounds for Smooth Constrained Nonlinear Optimization Using Scaled KKT Conditions and High-Order Models (Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint)....Pages 5-26
Data-Dependent Approximation in Social Computing (Weili Wu, Yi Li, Panos M. Pardalos, Ding-Zhu Du)....Pages 27-34
Multi-Objective Evolutionary Optimization Algorithms for Machine Learning: A Recent Survey (Stamatios-Aggelos N. Alexandropoulos, Christos K. Aridas, Sotiris B. Kotsiantis, Michael N. Vrahatis)....Pages 35-55
No Free Lunch Theorem: A Review (Stavros P. Adam, Stamatios-Aggelos N. Alexandropoulos, Panos M. Pardalos, Michael N. Vrahatis)....Pages 57-82
Piecewise Convex–Concave Approximation in the Minimax Norm (Michael P. Cullinan)....Pages 83-118
A Decomposition Theorem for the Least Squares Piecewise Monotonic Data Approximation Problem (Ioannis C. Demetriou)....Pages 119-134
Recent Progress in Optimization of Multiband Electrical Filters (Andrei Bogatyrëv)....Pages 135-149
Impact of Error in Parameter Estimations on Large Scale Portfolio Optimization (Valery A. Kalyagin, Sergey V. Slashchinin)....Pages 151-184
Optimal Design of Smart Composites (Georgios K. Tairidis, Georgia Foutsitzi, Georgios E. Stavroulakis)....Pages 185-217
Tax Evasion as an Optimal Solution to a Partially Observable Markov Decision Process (Paraskevi Papadopoulou, Dimitrios Hristu-Varsakelis)....Pages 219-237

✦ Subjects

Mathematics; Approximations and Expansions; Calculus of Variations and Optimal Control; Optimization; Algorithms; Numerical Analysis; Probability Theory and Stochastic Processes

📜 SIMILAR VOLUMES

Approximation Methods for Polynomial Opt

📁 Approximation Methods for Polynomial Optimization: Models, Algorithms, and Applications

✍ Zhening Li, Simai He, Shuzhong Zhang (auth.) 📂 Library 📅 2012 🏛 Springer-Verlag New York 🌐 English

<p><p>Polynomial optimization have been a hot research topic for the past few years and its applications range from Operations Research, biomedical engineering, investment science, to quantum mechanics, linear algebra, and signal processing, among many others. In this brief the authors discuss some

Approximation Methods for Polynomial Opt

📁 Approximation Methods for Polynomial Optimization: Models, Algorithms, and Applications

✍ Zhening Li, Simai He, Shuzhong Zhang 📂 Library 📅 2012 🏛 Springer 🌐 English

Polynomial optimization have been a hot research topic for the past few years and its applications range from Operations Research, biomedical engineering, investment science, to quantum mechanics, linear algebra, and signal processing, among many others. In this brief the authors discuss some import

Approximation Methods for Polynomial Opt

📁 Approximation Methods for Polynomial Optimization: Models, Algorithms, and Applications

✍ He, Simai;Li, Zhening;Zhang, Shuzhong 📂 Library 📅 2012 🏛 Springer New York : Imprint : Springer 🌐 English

Network optimization problems : algorith

📁 Network optimization problems : algorithms, applications, and complexity

✍ Du D.-Z., Pardalos P.M. (eds.) 📂 Library 📅 1993 🏛 World Scientific 🌐 English

Group testing was first proposed for blood tests, but soon found its way to many industrial applications. Combinatorial group testing studies the combinatorial aspect of the problem and is particularly related to many topics in combinatorics, computer science and operations research. Recently, the i

Optimization: Algorithms and Consistent

📁 Optimization: Algorithms and Consistent Approximations

✍ Polak E. 📂 Library 📅 1997 🌐 English

This book covers algorithms and discretization procedures for the solution of nonlinear programming, semi-infinite optimization, and optimal control problems. Among the important features included are a theory of algorithms represented as point-to-set maps; the treatment of finite- and infinite-dime

Optimization: algorithms and consistent

📁 Optimization: algorithms and consistent approximations

✍ Elijah Polak 📂 Library 📅 1997 🏛 Springer 🌐 English