Get Free Shipping on orders over $79
Maximum-Entropy Sampling : Algorithms and Application - Marcia Fampa

Maximum-Entropy Sampling

Algorithms and Application

By: Marcia Fampa, Jon Lee

eText | 29 October 2022

At a Glance

eText


$199.00

or 4 interest-free payments of $49.75 with

 or 

Instant online reading in your Booktopia eTextbook Library *

Why choose an eTextbook?

Instant Access *

Purchase and read your book immediately

Read Aloud

Listen and follow along as Bookshelf reads to you

Study Tools

Built-in study tools like highlights and more

* eTextbooks are not downloadable to your eReader or an app and can be accessed via web browsers only. You must be connected to the internet and have no technical issues with your device or browser that could prevent the eTextbook from operating.
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.  
on
Desktop
Tablet
Mobile

Other Editions and Formats

Paperback

Published: 31st October 2023

More in Operational Research

Logistics Handbook - James F. Robeson

eBOOK

Shaping Collaborative Ecosystems for Tomorrow - Igor Perko

eBOOK

Operations Management - Steven Bragg

eBOOK

Current Issues in Accounting - Niyazi Kurnaz

eBOOK

RRP $143.50

$129.99