Maximum-entropy sampling : algorithms and application / Marcia Fampa, Jon Lee.
2022
QA402.5
Formats
| Format | |
|---|---|
| BibTeX | |
| MARCXML | |
| TextMARC | |
| MARC | |
| DublinCore | |
| EndNote | |
| NLM | |
| RefWorks | |
| RIS |
Cite
Citation
Linked e-resources
Linked Resource
Concurrent users
Unlimited
Authorized users
Authorized users
Document Delivery Supplied
Can lend chapters, not whole ebooks
Details
Title
Maximum-entropy sampling : algorithms and application / Marcia Fampa, Jon Lee.
Author
ISBN
9783031130786 (electronic bk.)
3031130782 (electronic bk.)
3031130774
9783031130779
3031130782 (electronic bk.)
3031130774
9783031130779
Published
Cham, Switzerland : Springer, 2022.
Language
English
Description
1 online resource (1 volume).
Item Number
10.1007/978-3-031-13078-6 doi
Call Number
QA402.5
Dewey Decimal Classification
519.6
Summary
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.
Bibliography, etc. Note
Includes bibliographical references and index.
Access Note
Access limited to authorized users.
Source of Description
Description based on print version record.
Added Author
Series
Springer series in operations research.
Available in Other Form
Linked Resources
Record Appears in
Table of Contents
Overview
Notation
The problem and basic properties
Branch-and-bound
Upper bounds
Environmental monitoring
Opportunities
Basic formulae and inequalities
References
Index.
Notation
The problem and basic properties
Branch-and-bound
Upper bounds
Environmental monitoring
Opportunities
Basic formulae and inequalities
References
Index.