On the dual of linear inverse problems

DOI10.1016/0377-2217(95)00078-XzbMath0924.90116MaRDI QIDQ1278264

Emil Klafszky, Peter Kas

Publication date: 22 February 1999

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

zbMATH Keywords

inverse problemsdualityconvex programmingselection rules

Mathematics Subject Classification ID

Convex programming (90C25)

Related Items (1)

Approximation of linear programs by Bregman's \(D_F\) projections

Cites Work

• Optimization of Burg's entropy over linear constraints
• Certainty equivalents and information measures: Duality and extremal principles
• Why least squares and maximum entropy? An axiomatic approach to inference for linear inverse problems
• I-divergence geometry of probability distributions and minimization problems
• On measures of information and their characterizations
• Linearly constrained estimation by mathematical programming
• Pseudoconvex optimization for a special problem of paint industry
• On the duality of the mixed entropy programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the dual of linear inverse problems