A CLASS OF DFP ALGORITHMS WITH REVISED SEARCH DIRECTION
From MaRDI portal
Publication:3148358
DOI10.1081/NFA-120006700zbMath1006.90079MaRDI QIDQ3148358
Publication date: 2002
Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)
Related Items
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
Cites Work
- Unnamed Item
- Updating of conjugate direction matrices using members of Broyden's family
- On the convergence property of the DFP algorithm
- Perspectives on self-scaling variable metric algorithms
- A variable metric-method for function minimization derived from invariancy to nonlinear scaling
- Variational quasi-Newton methods for unconstrained optimization
- Modifying the BFGS update by a new column scaling technique
- The least prior deviation quasi-Newton update
- Family of optimally conditioned quasi-Newton updates for unconstrained optimization
- The convergence of Broyden algorithms for LC gradient function
- Stability of majorly efficient points and solutions in multiobjective programming
- Variable metric algorithms: Necessary and sufficient conditions for identical behaviour of nonquadratic functions
- A New QP-Free, Globally Convergent, Locally Superlinearly Convergent Algorithm For Inequality Constrained Optimization
- A Feasible BFGS Interior Point Algorithm for Solving Convex Minimization Problems
- Automatic Column Scaling Strategies for Quasi-Newton Methods
- How bad are the BFGS and DFP methods when the objective function is quadratic?
- Updating conjugate directions by the BFGS formula
- Global Convergence of a Cass of Quasi-Newton Methods on Convex Problems
- Quasi-Newton Algorithms with Updates from the Preconvex Part of Broyden's Family
- Optimally conditioned optimization algorithms without line searches
- Quasi-Newton Methods, Motivation and Theory
- On a conjecture of Dixon and other topics in variable metric methods
- A Rapidly Convergent Descent Method for Minimization
- Convergence Conditions for Ascent Methods. II: Some Corrections
- On the Convergence of the Variable Metric Algorithm
- Convergence of the DFP algorithm without exact line search