Variable metric algorithms: Necessary and sufficient conditions for identical behaviour of nonquadratic functions
From MaRDI portal
Publication:2549166
Cites work
- A Rapidly Convergent Descent Method for Minimization
- A new approach to variable metric algorithms
- Numerical experiments on quadratically convergent algorithms for function minimization
- Parameter Selection for Modified Newton Methods for Function Minimization
- Quasi-Newton Methods and their Application to Function Minimisation
- The Convergence of a Class of Double-rank Minimization Algorithms 1. General Considerations
- Unified approach to quadratically convergent algorithms for function minimization
- Variable Metric Method for Minimization
Cited in
(43)- Global convergence of BFGS and PRP methods under a modified weak Wolfe-Powell line search
- A rank-one algorithm for unconstrained function minimization
- The convergence of a new modified BFGS method without line searches for unconstrained optimization or complexity systems
- The convergence of Broyden algorithms for LC gradient function
- A globally convergent BFGS method for nonconvex minimization without line searches
- A class of quadratically convergent algorithms for constrained function minimization
- Superlinearly convergent variable metric algorithms for general nonlinear programming problems
- Two new unconstrained optimization algorithms which use function and gradient values
- A modified Broyden family algorithm with global convergence under a weak Wolfe-Powell line search for unconstrained nonconvex problems
- A modified BFGS method and its superlinear convergence in nonconvex minimization with general line search rule
- On the convergence rate of imperfect minimization algorithms in Broyden'sβ-class
- Convergence of the DFP algorithm without exact line search
- scientific article; zbMATH DE number 4180681 (Why is no real title available?)
- A CLASS OF DFP ALGORITHMS WITH REVISED SEARCH DIRECTION
- Global convergence of a nonmonotone Broyden family method for nonconvex unconstrained minimization
- Über die globale Konvergenz von Variable-Metrik-Verfahren mit nicht- exakter Schrittweitenbestimmung
- Variable metric methods in Hilbert space with applications to control problems
- An adaptive scaled BFGS method for unconstrained optimization
- Direct-prediction quasi-Newton methods in Hilbert space with applications to control problems
- Spectral scaling BFGS method
- Degenerate values for Broyden methods
- Conditions for variable-metric algorithms to be conjugate-gradient algorithms
- Two examples on the convergence of certain rank-2 minimization methods for quadratic functionals in Hilbert space
- Variable-metric technique for the solution of affinely parametrized nondifferentiable optimal design problems
- Global convergence of a modified Broyden family method for nonconvex functions
- A double parameter scaled BFGS method for unconstrained optimization
- A globally convergent BFGS method for nonlinear monotone equations without any merit functions
- Global convergence of a cautious projection BFGS algorithm for nonconvex problems without gradient Lipschitz continuity
- Superlinear convergence of symmetric Huang's class of methods
- The projection technique for two open problems of unconstrained optimization problems
- Self-Scaling Variable Metric Algorithms without Line Search for Unconstrained Minimization
- On the selection of parameters in Self Scaling Variable Metric Algorithms
- The global convergence of a modified BFGS method for nonconvex functions
- The revised DFP algorithm without exact line search
- A modified BFGS method and its global convergence in nonconvex minimization
- A modified two-parameter scaled Broyden-type algorithm for unconstrained optimization problems
- On the rate of superlinear convergence of a class of variable metric methods
- Global convergence of a modified two-parameter scaled BFGS method with Yuan-Wei-Lu line search for unconstrained optimization
- A double-parameter scaling Broyden-Fletcher-Goldfarb-Shanno method based on minimizing the measure function of Byrd and Nocedal for unconstrained optimization
- On \(q\)-BFGS algorithm for unconstrained optimization problems
- Convergence analysis of a modified BFGS method on convex minimizations
- A derivative-free line search and dfp method for symmetric equations with global and superlinear convergence
- Quasi Newton techniques generate identical points II: The proofs of four new theorems
This page was built for publication: Variable metric algorithms: Necessary and sufficient conditions for identical behaviour of nonquadratic functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2549166)
