1.

Record Nr.

UNINA9910624393203321

Autore

Fampa Marcia

Titolo

Maximum-Entropy Sampling : Algorithms and Application / / by Marcia Fampa, Jon Lee

Pubbl/distr/stampa

Cham : , : Springer International Publishing : , : Imprint : Springer, , 2022

ISBN

3-031-13078-2

Edizione

[1st ed. 2022.]

Descrizione fisica

1 online resource (206 pages)

Collana

Springer Series in Operations Research and Financial Engineering, , 2197-1773

Disciplina

519.3

519.54

Soggetti

Mathematical optimization

Operations research

Management science

Optimization

Operations Research, Management Science

Lingua di pubblicazione

Inglese

Formato

Materiale a stampa

Livello bibliografico

Monografia

Nota di bibliografia

Includes bibliographical references (pages 183-191) and index.

Nota di contenuto

Overview -- Notation -- The problem and basic properties -- Branch-and-bound -- Upper bounds -- Environmental monitoring -- Opportunities -- Basic formulae and inequalities -- References -- Index.

Sommario/riassunto

This monograph presents a comprehensive treatment of the maximum-entropy sampling problem (MESP), which is a fascinating topic at the intersection of mathematical optimization and data science. The text situates MESP in information theory, as the algorithmic problem of calculating a sub-vector of pre-specificed size from a multivariate Gaussian random vector, so as to maximize Shannon's differential entropy. The text collects and expands on state-of-the-art algorithms for MESP, and addresses its application in the field of environmental monitoring. While MESP is a central optimization problem in the theory of statistical designs (particularly in the area of spatial monitoring), this book largely focuses on the unique challenges of its algorithmic side. From the perspective of mathematical-optimization methodology, MESP



is rather unique (a 0/1 nonlinear program having a nonseparable objective function), and the algorithmic techniques employed are highly non-standard. In particular, successful techniques come from several disparate areas within the field of mathematical optimization; for example: convex optimization and duality, semidefinite programming, Lagrangian relaxation, dynamic programming, approximation algorithms, 0/1 optimization (e.g., branch-and-bound), extended formulation, and many aspects of matrix theory. The book is mainly aimed at graduate students and researchers in mathematical optimization and data analytics. .