Approximation and Optimization

Algorithms, Complexity and Applications
1. Auflage 2019
ISBN: 978-3-030-12769-5
Verlag: Springer International Publishing

Buch, Englisch, Band 145, 237 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 382 g

Reihe: Springer Optimization and Its Applications

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.

Zielgruppe

Research

Autoren/Hrsg.

Pardalos, Panos M.

Demetriou, Ioannis C.

Fachgebiete

• Mathematik | Informatik Mathematik Mathematische Analysis Funktionalanalysis
• Mathematik | Informatik Mathematik Stochastik Stochastische Prozesse
• Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Algorithmen & Datenstrukturen
• Mathematik | Informatik Mathematik Stochastik Wahrscheinlichkeitsrechnung
• Mathematik | Informatik Mathematik Numerik und Wissenschaftliches Rechnen Angewandte Mathematik, Mathematische Modelle
• Mathematik | Informatik Mathematik Numerik und Wissenschaftliches Rechnen Numerische Mathematik

Inhaltsverzeichnis

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.