Linearly constrained estimation by mathematical programming

DOI10.1016/0377-2217(89)90437-2zbMath0685.90065OpenAlexW2008368754MaRDI QIDQ1262209

Emil Klafszky, János Mayer, Tamás Terlaky

Publication date: 1989

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(89)90437-2

zbMATH Keywords

statistical estimationinformation divergencePearson divergencecomputational experiences\(\ell _ p\)- programmingHellinger divergencemixing problemSmirnov distances

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Quadratic programming (90C20) Linear programming (90C05) Estimation and detection in stochastic control theory (93E10) Operations research and management science (90B99) Mathematical programming (90C99)

Related Items

An algorithm for finding the minimum-norm point in the intersection of a convex polyhedron and a hyperplane, A fifth bibliography of fractional programming^*, An efficient algorithm for finding the minimum norm point in the convex hull of a finite point set in the plane, Pseudoconvex optimization for a special problem of paint industry, Inverse barriers and CES-functions in linear programming, An application of Lipschitzian global optimization to product design, On the duality of the mixed entropy programming, On the dual of linear inverse problems, Semi-infinite programming duality for order restricted statistical inference models, An algorithm for solving the minimum-norm point problem over the intersection of a polytope and an affine set, An approximate algorithm for computing multidimensional convex hulls, An interior point algorithm for large scale portfolio optimization

Uses Software

• LINDO

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On \(\ell_ p\) programming
• Controlled dual perturbations for posynomial programs
• Quadratically constrained minimum cross-entropy analysis
• I-divergence geometry of probability distributions and minimization problems
• A comparison of computational strategies for geometric programs
• A generalisation of geometric programming with an application to information theory
• Controlled dual perturbations for l p -programming
• M.D.I. estimation via unconstrained convex programming
• Finding the nearest point in A polytope
• Large-scale linearly constrained optimization
• Bimatrix Equilibrium Points and Mathematical Programming