Alternating multi-step quasi-Newton methods for unconstrained optimization
The authors consider multistep quasi-Newton methods for unconstrained optimization. These methods were introduced in three earlier papers of the authors, where they showed how an interpolating curve in the variable-space could be used to derive an appropriate generalization of the secant equation normally employed in the construction of quasi-Newton methods. One of the most successful of these multistep methods employs the current approximation to the Hessian to determine the parametrization of the interpolating curve and, hence, the derivatives required in the generalized updating formula. However, certain approximations were found to be necessary in the process in order to reduce the level of computation required (which must be repeated at each iteration) to acceptable levels. In this paper, the authors show how a variant of this algorithm, which avoids the need for such approximations, may be obtained. This is accomplished by alternating, on successive iterations, a single-step and a two-step method. The results of a series of experiments, which show that the new algorithm exhibits a clear improvement in numerical performance, are reported.
- A Family of Variable-Metric Methods Derived by Variational Means
- A new approach to variable metric algorithms
- Conditioning of Quasi-Newton Methods for Function Minimization
- scientific article; zbMATH DE number 4091191 (Why is no real title available?)
- scientific article; zbMATH DE number 1243473 (Why is no real title available?)
- scientific article; zbMATH DE number 1552870 (Why is no real title available?)
- Matrix conditioning and nonlinear optimization
- Minimum curvature multistep quasi-Newton methods
- Multi-step quasi-Newton methods for optimization
- Quasi-Newton Methods and their Application to Function Minimisation
- Testing Unconstrained Optimization Software
- The Convergence of a Class of Double-rank Minimization Algorithms
- Multi-step quasi-Newton methods for optimization
- Global convergence property of scaled two-step BFGS method
- Accumulative approach in multistep diagonal gradient-type method for large-scale unconstrained optimization
- New implicit updates in multi-step quasi-Newton methods for unconstrained optimisation
- Using nonlinear functions to approximate a new quasi-Newton method for unconstrained optimization problems
- Two-step conjugate gradient method for unconstrained optimization
- A multi-iterate method to solve systems of nonlinear equations
- New parameterization for multi-step quasi-Newton algorithms
- A two-step matrix-free secant method for solving large-scale systems of nonlinear equations
- scientific article; zbMATH DE number 1424421 (Why is no real title available?)
- Metric-based parameterizations for multi-step unconstrained optimization
- Implicit updates in multistep quasi-Newton methods
- A new two-step gradient-type method for large-scale unconstrained optimization
- Competitive secant (BFGS) methods based on modified secant relations for unconstrained optimization
- An improved multi-step gradient-type method for large scale optimization
- The use of alternation and recurrences in two-step quasi-Newton methods
- Three-step fixed-point quasi-Newton methods for unconstrained optimisation
This page was built for publication: Alternating multi-step quasi-Newton methods for unconstrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1372056)
