Maximum entropy and feasibility methods for convex and nonconvex inverse problems
DOI10.1080/02331934.2011.632502zbMATH Open1241.45009OpenAlexW2093167197WikidataQ56935446 ScholiaQ56935446MaRDI QIDQ3225065FDOQ3225065
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
Recommendations
inverse problemsentropy optimizationFenchel duality theoremfeasibility problemsalternating projection and reflection methods
Convex programming (90C25) Applications of mathematical programming (90C90) Inverse problems for integral equations (45Q05) Inverse problems in optimal control (49N45) Duality theory (optimization) (49N15)
Cites Work
- On Projection Algorithms for Solving Convex Feasibility Problems
- Convex analysis and monotone operator theory in Hilbert spaces
- Two-Point Step Size Gradient Methods
- On the convergence of von Neumann's alternating projection algorithm for two sets
- Calculus without derivatives
- Title not available (Why is that?)
- Partially finite convex programming. I: Quasi relative interiors and duality theory
- An alternating projection that does not converge in norm
- The Douglas-Rachford algorithm in the absence of convexity
- Duality Relationships for Entropy-Like Minimization Problems
- On Conjugate Convex Functions
- Searching with iterated maps
- Dual Methods in Entropy Maximization. Application to Some Problems in Crystallography
- Relaxed averaged alternating reflections for diffraction imaging
- The origins of quasi-concavity: a development between mathematics and economics.
- Duality and the Computation of Approximate Invariant Densities for Nonsingular Transformations
- Entropic regularization of the \(\ell _{0}\) function
- A Fast Heuristic Method for Polynomial Moment Problems with Boltzmann–Shannon Entropy
- Symbolic Fenchel conjugation
- Copulas with maximum entropy
- A convex dual approach to the computation of NMR complex spectra
- $L_2 $ Spectral Estimation
- Maximum entropy reconstruction using derivative information. II: Computational results
- Strong Rotundity and Optimization
- Fast heuristic methods for function reconstruction using derivative information
Cited In (11)
- Multivariate truncated moments problems and maximum entropy
- Conditioning moments of singular measures for entropy optimization. I
- Convergence rate analysis for averaged fixed point iterations in common fixed point problems
- COLLAGE-BASED INVERSE PROBLEMS FOR IFSM WITH ENTROPY MAXIMIZATION AND SPARSITY CONSTRAINTS
- A cyclic Douglas-Rachford iteration scheme
- On the entropy minimization problem in statistical mechanics
- Pricing and hedging contingent claims by entropy segmentation and Fenchel duality
- A variational approach to Lagrange multipliers
- Minimax entropy solutions of ill-posed problems
- Title not available (Why is that?)
- Entropy-based mixed three-moment description of fermionic radiation transport in slab and spherical geometries
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)
