An outer-approximation approach for information-maximizing sensor selection
type: Item
instance of: scholarly article
title: An outer-approximation approach for information-maximizing sensor selection
zbMATH Open document ID: 1269.90074
author: Han-Lim Choi
author: Jonathan P. How
author: Paul I. Barton
published in: Optimization Letters
publication date: 2013-04-23T00:00:00Z
Mathematics Subject Classification ID: 90C22
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C90
zbMATH DE Number: 6156593
zbMATH Keywords: sensor selection
zbMATH Keywords: outer-approximation algorithm
zbMATH Keywords: mutual information
zbMATH Keywords: maximum entropy sampling
describes a project that uses: CPLEX
describes a project that uses: TOMLAB
MaRDI profile type: Publication
full work available at URL: s11590-012-0457-9
OpenAlex ID: W2008246569
Wikidata QID: Q60022211
cites work: Using continuous nonlinear relaxations to solve constrained maximum-entropy sampling problems
cites work: Maximum-entropy remote sampling
cites work: Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
cites work: Q3376698
cites work: Solving maximum-entropy sampling problems using factored masks
cites work: Maximum lifetime coverage preserving scheduling algorithms in sensor networks
cites work: Continuous trajectory planning of mobile sensors for informative forecasting
cites work: Q4023085
cites work: An outer-approximation algorithm for a class of mixed-integer nonlinear programs
cites work: Solving mixed integer nonlinear programs by outer approximation
cites work: Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
cites work: Q4424114
cites work: Dynamics of information systems. Theory and applications
cites work: Mobile Sensor Network Control Using Mutual Information Methods and Particle Filters
cites work: Matrix Analysis
cites work: On the distribution of the largest eigenvalue in principal components analysis
cites work: Outer approximation algorithms for separable nonconvex mixed-integer nonlinear programs
cites work: An Exact Algorithm for Maximum Entropy Sampling
cites work: Q3096108
cites work: Constrained maximum-entropy sampling
cites work: A linear integer programming bound for maximum-entropy sampling
cites work: Approximate Dynamic Programming for Communication-Constrained Sensor Network Management
DOI: 10.1007/S11590-012-0457-9
DBLP publication ID: journals/ol/ChoiHB13
description: scientific article; zbMATH DE number 6156593