Maximum Entropy Derivation of Quasi-Newton Methods
From MaRDI portal
Publication:2834562
DOI10.1137/15M1027668zbMath1356.90163MaRDI QIDQ2834562
Steven H. Waldrip, Robert K. Niven
Publication date: 23 November 2016
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Related Items (2)
Maximum Entropy Analysis of Flow Networks with Structural Uncertainty (Graph Ensembles) ⋮ Bayesian and Maximum Entropy Analyses of Flow Networks with Non-Gaussian Priors and Soft Constraints
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Mathematical Theory of Communication
- A restarting approach for the symmetric rank one update for unconstrained optimization
- Combinatorial entropies and statistics
- Convergence of quasi-Newton matrices generated by the symmetric rank one update
- Practical quasi-Newton methods for solving nonlinear systems
- A Bregman extension of quasi-Newton updates. II: Analysis of robustness properties
- Probabilistic Interpretation of Linear Solvers
- Structured symmetric rank-one method for unconstrained optimization
- Convergence of Symmetric Rank-One method based on Modified Quasi-Newton equation
- Information Theory and Statistical Mechanics
- Statistical Quasi-Newton: A New Look at Least Change
- The Quasi-Newton Least Squares Method: A New and Fast Secant Method Analyzed for Linear Systems
- A Tool for the Analysis of Quasi-Newton Methods with Application to Unconstrained Minimization
- Least Change Secant Updates for Quasi-Newton Methods
- Axiomatic derivation of the principle of maximum entropy and the principle of minimum cross-entropy
- Some Convergence Properties of Broyden’s Method
- Variable Metric Method for Minimization
- A New Variational Result for Quasi-Newton Formulae
- Quasi-Newton Methods, Motivation and Theory
- Numerical Optimization
- Probability Theory
- A Theoretical and Experimental Study of the Symmetric Rank-One Update
- Maximum Entropy Elements in the Intersection of an Affine Space and the Cone of Positive Definite Matrices
- A Bregman extension of quasi-Newton updates I: an information geometrical framework
- A Class of Methods for Solving Nonlinear Simultaneous Equations
- A Rapidly Convergent Descent Method for Minimization
- Quasi-Newton Methods and their Application to Function Minimisation
- Prior Probabilities
- A Family of Variable-Metric Methods Derived by Variational Means
- Variations on Variable-Metric Methods
- Variable metric methods of minimisation
- The Convergence of a Class of Double-rank Minimization Algorithms
- A new approach to variable metric algorithms
- Conditioning of Quasi-Newton Methods for Function Minimization
- A New Algorithm for Unconstrained Optimization
- On Information and Sufficiency
This page was built for publication: Maximum Entropy Derivation of Quasi-Newton Methods