Maximum entropy and feasibility methods for convex and nonconvex inverse problems
From MaRDI portal
Publication:3225065
DOI10.1080/02331934.2011.632502zbMath1241.45009OpenAlexW2093167197WikidataQ56935446 ScholiaQ56935446MaRDI QIDQ3225065
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
inverse problemsentropy optimizationFenchel duality theoremfeasibility problemsalternating projection and reflection methods
Convex programming (90C25) Applications of mathematical programming (90C90) Duality theory (optimization) (49N15) Inverse problems in optimal control (49N45) Inverse problems for integral equations (45Q05)
Related Items
On the entropy minimization problem in statistical mechanics ⋮ Convergence Rate Analysis for Averaged Fixed Point Iterations in Common Fixed Point Problems ⋮ Multivariate truncated moments problems and maximum entropy ⋮ A variational approach to Lagrange multipliers ⋮ Entropy-based mixed three-moment description of fermionic radiation transport in slab and spherical geometries ⋮ A cyclic Douglas-Rachford iteration scheme ⋮ Conditioning moments of singular measures for entropy optimization. I ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Copulas with maximum entropy
- Symbolic Fenchel conjugation
- Partially finite convex programming. I: Quasi relative interiors and duality theory
- On the convergence of von Neumann's alternating projection algorithm for two sets
- Maximum entropy reconstruction using derivative information. II: Computational results
- The origins of quasi-concavity: a development between mathematics and economics.
- An alternating projection that does not converge in norm
- A convex dual approach to the computation of NMR complex spectra
- Entropic Regularization of the ℓ 0 Function
- The Douglas–Rachford Algorithm in the Absence of Convexity
- Calculus Without Derivatives
- Duality and the Computation of Approximate Invariant Densities for Nonsingular Transformations
- $L_2 $ Spectral Estimation
- Two-Point Step Size Gradient Methods
- Duality Relationships for Entropy-Like Minimization Problems
- Dual Methods in Entropy Maximization. Application to Some Problems in Crystallography
- Strong Rotundity and Optimization
- Relaxed averaged alternating reflections for diffraction imaging
- On Projection Algorithms for Solving Convex Feasibility Problems
- A Fast Heuristic Method for Polynomial Moment Problems with Boltzmann–Shannon Entropy
- Fast heuristic methods for function reconstruction using derivative information
- Searching with iterated maps
- On Conjugate Convex Functions
- Convex analysis and monotone operator theory in Hilbert spaces
