A CLASS OF DFP ALGORITHMS WITH REVISED SEARCH DIRECTION
From MaRDI portal
Publication:3148358
DOI10.1081/NFA-120006700zbMATH Open1006.90079MaRDI QIDQ3148358FDOQ3148358
Authors: Dingguo Pu, Weiwen Tian 
Publication date: 2002
Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)
Recommendations
Cites Work
- A Rapidly Convergent Descent Method for Minimization
- Convergence Conditions for Ascent Methods. II: Some Corrections
- Quasi-Newton Methods, Motivation and Theory
- A new QP-free, globally convergent, locally superlinearly convergent algorithm for inequality constrained optimization
- Global Convergence of a Cass of Quasi-Newton Methods on Convex Problems
- On the convergence property of the DFP algorithm
- Variational quasi-Newton methods for unconstrained optimization
- How bad are the BFGS and DFP methods when the objective function is quadratic?
- Quasi-Newton Algorithms with Updates from the Preconvex Part of Broyden's Family
- A feasible BFGS interior point algorithm for solving convex minimization problems
- Optimally conditioned optimization algorithms without line searches
- A variable metric-method for function minimization derived from invariancy to nonlinear scaling
- Variable metric algorithms: Necessary and sufficient conditions for identical behaviour of nonquadratic functions
- Updating conjugate directions by the BFGS formula
- On the Convergence of the Variable Metric Algorithm
- Perspectives on self-scaling variable metric algorithms
- Modifying the BFGS update by a new column scaling technique
- Automatic Column Scaling Strategies for Quasi-Newton Methods
- Updating of conjugate direction matrices using members of Broyden's family
- Title not available (Why is that?)
- On a conjecture of Dixon and other topics in variable metric methods
- Family of optimally conditioned quasi-Newton updates for unconstrained optimization
- The least prior deviation quasi-Newton update
- The convergence of Broyden algorithms for LC gradient function
- Stability of majorly efficient points and solutions in multiobjective programming
- Convergence of the DFP algorithm without exact line search
Cited In (4)
- Eigenvalue analyses on the memoryless Davidon-Fletcher-Powell method based on a spectral secant equation
- Analysis of the maximum magnification by the scaled memoryless DFP updating formula with application to compressive sensing
- An extended version of the memoryless DFP algorithm with the sufficient descent property
- The revised DFP algorithm without exact line search
This page was built for publication: A CLASS OF DFP ALGORITHMS WITH REVISED SEARCH DIRECTION
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3148358)
