The revised DFP algorithm without exact line search
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 232393
- Convergence of the DFP algorithm without exact line search
- A CLASS OF DFP ALGORITHMS WITH REVISED SEARCH DIRECTION
- Superlinear convergence of the DFP algorithm without exact line search
- Convergence of DFP algorithms without convexity and exact line search assumptions
- scientific article; zbMATH DE number 2068696
- scientific article; zbMATH DE number 1310905
- scientific article; zbMATH DE number 4112394
- scientific article; zbMATH DE number 1185967
- scientific article; zbMATH DE number 857603
Cites work
- A Class of Methods for Solving Nonlinear Simultaneous Equations
- A class of rank-one positive definite qnasi-newton updates for unconstrained minimization2
- A feasible BFGS interior point algorithm for solving convex minimization problems
- A new QP-free, globally convergent, locally superlinearly convergent algorithm for inequality constrained optimization
- A Rapidly Convergent Descent Method for Minimization
- A variable metric-method for function minimization derived from invariancy to nonlinear scaling
- Automatic Column Scaling Strategies for Quasi-Newton Methods
- Convergence Conditions for Ascent Methods
- Convergence Conditions for Ascent Methods. II: Some Corrections
- Convergence of the DFP algorithm without exact line search
- Family of optimally conditioned quasi-Newton updates for unconstrained optimization
- Global Convergence of a Cass of Quasi-Newton Methods on Convex Problems
- How bad are the BFGS and DFP methods when the objective function is quadratic?
- scientific article; zbMATH DE number 3843083 (Why is no real title available?)
- scientific article; zbMATH DE number 3852805 (Why is no real title available?)
- scientific article; zbMATH DE number 3526471 (Why is no real title available?)
- scientific article; zbMATH DE number 3529352 (Why is no real title available?)
- scientific article; zbMATH DE number 1215043 (Why is no real title available?)
- scientific article; zbMATH DE number 1243473 (Why is no real title available?)
- scientific article; zbMATH DE number 721769 (Why is no real title available?)
- scientific article; zbMATH DE number 232393 (Why is no real title available?)
- scientific article; zbMATH DE number 3325269 (Why is no real title available?)
- Modifying the BFGS update by a new column scaling technique
- On a conjecture of Dixon and other topics in variable metric methods
- On the Convergence of the Variable Metric Algorithm
- On the convergence property of the DFP algorithm
- Optimally conditioned optimization algorithms without line searches
- Perspectives on self-scaling variable metric algorithms
- Quasi-Newton Algorithms with Updates from the Preconvex Part of Broyden's Family
- Quasi-Newton Methods, Motivation and Theory
- The convergence of Broyden algorithms for LC gradient function
- The least prior deviation quasi-Newton update
- Updating conjugate directions by the BFGS formula
- Updating of conjugate direction matrices using members of Broyden's family
- Variable metric algorithms: Necessary and sufficient conditions for identical behaviour of nonquadratic functions
- Variational quasi-Newton methods for unconstrained optimization
Cited in
(18)- A short note on the Duff-Nocedal-Reid algorithm
- Analysis of the maximum magnification by the scaled memoryless DFP updating formula with application to compressive sensing
- A class of revised Broyden algorithms
- Convergence of DFP algorithms without convexity and exact line search assumptions
- A CLASS OF DFP ALGORITHMS WITH REVISED SEARCH DIRECTION
- A NOTE ON THE CONVERGENCE OF THE DFP ALGORITHM ON QUADRATIC UNIFORMLY CONVEX FUNCTIONS
- Convergence Properties of the DFP Algorithm for Unconstrained Optimization
- scientific article; zbMATH DE number 857603 (Why is no real title available?)
- scientific article; zbMATH DE number 232393 (Why is no real title available?)
- On the Local and Superlinear Convergence of a Parameterized DFP Method
- Superlinear convergence of the DFP algorithm without exact line search
- Convergence of the DFP algorithm without exact line search
- A projection-based derivative free DFP approach for solving system of nonlinear convex constrained monotone equations with image restoration applications
- Eigenvalue analyses on the memoryless Davidon-Fletcher-Powell method based on a spectral secant equation
- An extended version of the memoryless DFP algorithm with the sufficient descent property
- An augmented memoryless Davidon–Fletcher–Powell method based on the Dai–Liao approach
- Convergence analysis of the DFP algorithm for unconstrained optimization problems on Riemannian manifolds
- On the convergence property of the DFP algorithm
This page was built for publication: The revised DFP algorithm without exact line search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1811670)
