Variable metric algorithms: Necessary and sufficient conditions for identical behaviour of nonquadratic functions
From MaRDI portal
Publication:2549166
DOI10.1007/BF00934961zbMath0226.49014MaRDI QIDQ2549166
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)
Related Items
A modified Broyden family algorithm with global convergence under a weak Wolfe-Powell line search for unconstrained nonconvex problems, On \(q\)-BFGS algorithm for unconstrained optimization problems, Global convergence of a nonmonotone Broyden family method for nonconvex unconstrained minimization, The global convergence of a modified BFGS method for nonconvex functions, Global convergence of a modified Broyden family method for nonconvex functions, A double-parameter scaling Broyden-Fletcher-Goldfarb-Shanno method based on minimizing the measure function of Byrd and Nocedal for unconstrained optimization, Spectral scaling BFGS method, A double parameter scaled BFGS method for unconstrained optimization, Two examples on the convergence of certain rank-2 minimization methods for quadratic functionals in Hilbert space, Degenerate values for Broyden methods, Über die globale Konvergenz von Variable-Metrik-Verfahren mit nicht- exakter Schrittweitenbestimmung, The projection technique for two open problems of unconstrained optimization problems, The convergence of a new modified BFGS method without line searches for unconstrained optimization or complexity systems, On the rate of superlinear convergence of a class of variable metric methods, Quasi Newton techniques generate identical points II: The proofs of four new theorems, On the selection of parameters in Self Scaling Variable Metric Algorithms, Superlinear convergence of symmetric Huang's class of methods, Conditions for variable-metric algorithms to be conjugate-gradient algorithms, A modified BFGS method and its superlinear convergence in nonconvex minimization with general line search rule, An adaptive scaled BFGS method for unconstrained optimization, On the convergence rate of imperfect minimization algorithms in Broyden'sβ-class, Global convergence of a modified two-parameter scaled BFGS method with Yuan-Wei-Lu line search for unconstrained optimization, A class of quadratically convergent algorithms for constrained function minimization, A modified BFGS method and its global convergence in nonconvex minimization, Variable metric methods in Hilbert space with applications to control problems, Superlinearly convergent variable metric algorithms for general nonlinear programming problems, Convergence analysis of a modified BFGS method on convex minimizations, Direct-prediction quasi-Newton methods in Hilbert space with applications to control problems, A rank-one algorithm for unconstrained function minimization, A globally convergent BFGS method for nonlinear monotone equations without any merit functions, Convergence of the DFP algorithm without exact line search, Two new unconstrained optimization algorithms which use function and gradient values, Global convergence of BFGS and PRP methods under a modified weak Wolfe-Powell line search, A globally convergent BFGS method for nonconvex minimization without line searches, The revised DFP algorithm without exact line search, Self-Scaling Variable Metric Algorithms without Line Search for Unconstrained Minimization, Variable-metric technique for the solution of affinely parametrized nondifferentiable optimal design problems, Unnamed Item, The convergence of Broyden algorithms for LC gradient function, A derivative-free line search and dfp method for symmetric equations with global and superlinear convergence, A CLASS OF DFP ALGORITHMS WITH REVISED SEARCH DIRECTION
Cites Work
- Unified approach to quadratically convergent algorithms for function minimization
- Numerical experiments on quadratically convergent algorithms for function minimization
- Variable Metric Method for Minimization
- A Rapidly Convergent Descent Method for Minimization
- Quasi-Newton Methods and their Application to Function Minimisation
- A new approach to variable metric algorithms
- The Convergence of a Class of Double-rank Minimization Algorithms 1. General Considerations
- Parameter Selection for Modified Newton Methods for Function Minimization
