Variable metric algorithms: Necessary and sufficient conditions for identical behaviour of nonquadratic functions

DOI10.1007/BF00934961zbMATH Open0226.49014MaRDI QIDQ2549166FDOQ2549166

Publication date: 1972

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Numerical methods based on nonlinear programming (49M37) Control/observation systems governed by functional relations other than differential equations (such as hybrid and switching systems) (93C30) Optimality conditions for free problems in two or more independent variables (49K10)

Cites Work

Variable Metric Method for Minimization
A Rapidly Convergent Descent Method for Minimization
A new approach to variable metric algorithms
The Convergence of a Class of Double-rank Minimization Algorithms 1. General Considerations
Quasi-Newton Methods and their Application to Function Minimisation
Unified approach to quadratically convergent algorithms for function minimization
Numerical experiments on quadratically convergent algorithms for function minimization
Parameter Selection for Modified Newton Methods for Function Minimization

Cited In (43)

A CLASS OF DFP ALGORITHMS WITH REVISED SEARCH DIRECTION
An adaptive scaled BFGS method for unconstrained optimization
The global convergence of a modified BFGS method for nonconvex functions
On \(q\)-BFGS algorithm for unconstrained optimization problems
A modified Broyden family algorithm with global convergence under a weak Wolfe-Powell line search for unconstrained nonconvex problems
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
On the selection of parameters in Self Scaling Variable Metric Algorithms
Variable metric methods in Hilbert space with applications to control problems
Direct-prediction quasi-Newton methods in Hilbert space with applications to control problems
A double parameter scaled BFGS method for unconstrained optimization
A globally convergent BFGS method for nonlinear monotone equations without any merit functions
Spectral scaling BFGS method
Global convergence of a modified two-parameter scaled BFGS method with Yuan-Wei-Lu line search for unconstrained optimization
Two new unconstrained optimization algorithms which use function and gradient values
A modified BFGS method and its global convergence in nonconvex minimization
Global convergence of a nonmonotone Broyden family method for nonconvex unconstrained minimization
Über die globale Konvergenz von Variable-Metrik-Verfahren mit nicht- exakter Schrittweitenbestimmung
Global convergence of a cautious projection BFGS algorithm for nonconvex problems without gradient Lipschitz continuity
Degenerate values for Broyden methods
A derivative-free line search and dfp method for symmetric equations with global and superlinear convergence
Global convergence of BFGS and PRP methods under a modified weak Wolfe-Powell line search
On the convergence rate of imperfect minimization algorithms in Broyden'sβ-class
Convergence analysis of a modified BFGS method on convex minimizations
Superlinearly convergent variable metric algorithms for general nonlinear programming problems
Title not available (Why is that?)
Superlinear convergence of symmetric Huang's class of methods
Convergence of the DFP algorithm without exact line search
Conditions for variable-metric algorithms to be conjugate-gradient algorithms
A double-parameter scaling Broyden-Fletcher-Goldfarb-Shanno method based on minimizing the measure function of Byrd and Nocedal for unconstrained optimization
The convergence of a new modified BFGS method without line searches for unconstrained optimization or complexity systems
A class of quadratically convergent algorithms for constrained function minimization
Global convergence of a modified Broyden family method for nonconvex functions
Two examples on the convergence of certain rank-2 minimization methods for quadratic functionals in Hilbert space
The revised DFP algorithm without exact line search
A modified BFGS method and its superlinear convergence in nonconvex minimization with general line search rule
The projection technique for two open problems of unconstrained optimization problems
Variable-metric technique for the solution of affinely parametrized nondifferentiable optimal design problems
A globally convergent BFGS method for nonconvex minimization without line searches
Quasi Newton techniques generate identical points II: The proofs of four new theorems
A rank-one algorithm for unconstrained function minimization
The convergence of Broyden algorithms for LC gradient function
Self-Scaling Variable Metric Algorithms without Line Search for Unconstrained Minimization

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)