Linearly constrained estimation by mathematical programming
type: Item
instance of: scholarly article
title: Linearly constrained estimation by mathematical programming
zbMATH Open document ID: 0685.90065
DOI: 10.1016/0377-2217(89)90437-2
author: Emil Klafszky
author: J. Mayer
author: Tamás Terlaky
published in: European Journal of Operational Research
publication date: 1989-01-01T00:00:00Z
Mathematics Subject Classification ID: 90B99
Mathematics Subject Classification ID: 90C90
Mathematics Subject Classification ID: 93E10
Mathematics Subject Classification ID: 90C99
Mathematics Subject Classification ID: 90C20
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 4123521
zbMATH Keywords: statistical estimation
zbMATH Keywords: information divergence
zbMATH Keywords: mixing problem
zbMATH Keywords: Smirnov distances
zbMATH Keywords: Pearson divergence
zbMATH Keywords: Hellinger divergence
zbMATH Keywords: \(\ell _ p\)- programming
zbMATH Keywords: computational experiences
describes a project that uses: LINDO
MaRDI profile type: Publication
full work available at URL: 0377-2217(89)90437-2
OpenAlex ID: W2008368754
cites work: Q3694430
cites work: M.D.I. estimation via unconstrained convex programming
cites work: Q4120304
cites work: Q5583495
cites work: I-divergence geometry of probability distributions and minimization problems
cites work: Q3844775
cites work: Q5557595
cites work: Controlled dual perturbations for l p -programming
cites work: Controlled dual perturbations for posynomial programs
cites work: Quadratically constrained minimum cross-entropy analysis
cites work: Q4739659
cites work: Q5529067
cites work: Bimatrix Equilibrium Points and Mathematical Programming
cites work: Q4137813
cites work: Large-scale linearly constrained optimization
cites work: Q3285916
cites work: A comparison of computational strategies for geometric programs
cites work: A generalisation of geometric programming with an application to information theory
cites work: On \(\ell_ p\) programming
cites work: Q4132018
cites work: Finding the nearest point in A polytope
description: scientific article; zbMATH DE number 4123521