Optimization Online


Efficient Solution of Maximum-Entropy Sampling Problems

Kurt Anstreicher(kurt-anstreicher***at***uiowa.edu)

Abstract: We consider a new approach for the maximum-entropy sampling problem (MESP) that is based on bounds obtained by maximizing a function of the form ldet M(x) over linear constraints, where M(x)is linear in the n-vector x. These bounds can be computed very efficiently and are superior to all previously known bounds for MESP on most benchmark test problems. A branch-and-bound algorithm using the new bounds solves challenging instances of MESP to optimality for the first time.

Keywords: Maximum-entropy sampling, convex programming, nonlinear integer programming

Category 1: Integer Programming ((Mixed) Integer Nonlinear Programming )

Category 2: Convex and Nonsmooth Optimization (Convex Optimization )

Category 3: Applications -- Science and Engineering (Statistics )

Citation: Department of Management Sciences, University of Iowa, Iowa City, IA 52242 USA, June 2018.

Download: [PDF]

Entry Submitted: 07/10/2018
Entry Accepted: 07/10/2018
Entry Last Modified: 07/10/2018

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society