Maximum entropy and feasibility methods for convex and nonconvex inverse problems

DOI10.1080/02331934.2011.632502MaRDI QIDQ3225065zbMATH OpenOpenAlexWikidataFDO

Authors Jonathan M. Borwein

Publication date 15 March 2012

Published in Optimization (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/1959.13/940081

zbMATH Keywords

inverse problemsentropy optimizationFenchel duality theoremfeasibility problemsalternating projection and reflection methods

Mathematics Subject Classification ID

Convex programming (90C25) Applications of mathematical programming (90C90) Inverse problems for integral equations (45Q05) Inverse problems in optimal control (49N45) Duality theory (optimization) (49N15)

Recommendations

• A maximum entropy method for convex programming
• A new look at entropy for solving linear inverse problems
• scientific article; zbMATH DE number 879845
• scientific article; zbMATH DE number 1279829
• Linear inverse problems. The maximum entropy connection. With CD-ROM.

Cites work

• scientific article; zbMATH DE number 1266748 (Why is no real title available?)
• $L_2 $ Spectral Estimation
• A Fast Heuristic Method for Polynomial Moment Problems with Boltzmann–Shannon Entropy
• A convex dual approach to the computation of NMR complex spectra
• An alternating projection that does not converge in norm
• Calculus without derivatives
• Convex analysis and monotone operator theory in Hilbert spaces
• Copulas with maximum entropy
• Dual Methods in Entropy Maximization. Application to Some Problems in Crystallography
• Duality Relationships for Entropy-Like Minimization Problems
• Duality and the Computation of Approximate Invariant Densities for Nonsingular Transformations
• Entropic regularization of the \(\ell _{0}\) function
• Fast heuristic methods for function reconstruction using derivative information
• Maximum entropy reconstruction using derivative information. II: Computational results
• On Conjugate Convex Functions
• On Projection Algorithms for Solving Convex Feasibility Problems
• On the convergence of von Neumann's alternating projection algorithm for two sets
• Partially finite convex programming. I: Quasi relative interiors and duality theory
• Relaxed averaged alternating reflections for diffraction imaging
• Searching with iterated maps
• Strong Rotundity and Optimization
• Symbolic Fenchel conjugation
• The Douglas-Rachford algorithm in the absence of convexity
• The origins of quasi-concavity: a development between mathematics and economics.
• Two-Point Step Size Gradient Methods

Cited in

(11)

• Convergence rate analysis for averaged fixed point iterations in common fixed point problems
• On the entropy minimization problem in statistical mechanics
• Pricing and hedging contingent claims by entropy segmentation and Fenchel duality
• scientific article; zbMATH DE number 7523740 (Why is no real title available?)
• COLLAGE-BASED INVERSE PROBLEMS FOR IFSM WITH ENTROPY MAXIMIZATION AND SPARSITY CONSTRAINTS
• Conditioning moments of singular measures for entropy optimization. I
• Entropy-based mixed three-moment description of fermionic radiation transport in slab and spherical geometries
• A variational approach to Lagrange multipliers
• Multivariate truncated moments problems and maximum entropy
• A cyclic Douglas-Rachford iteration scheme
• Minimax entropy solutions of ill-posed problems

This page was built for publication: Maximum entropy and feasibility methods for convex and nonconvex inverse problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3225065)