Superlinear convergence of Broyden's boundedθ-class of methods
From MaRDI portal
Publication:3895235
DOI10.1007/BF01589345zbMath0448.90048MaRDI QIDQ3895235
Publication date: 1981
Published in: Mathematical Programming (Search for Journal in Brave)
unconstrained minimizationquasi-Newton methodssuperlinear convergenceBroyden's bounded theta-class of methodsdirect prediction case
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Rate of convergence, degree of approximation (41A25)
Related Items
Superlinear convergence of a class of \(\theta\)-bounded rank-one update methods, A modified Broyden family algorithm with global convergence under a weak Wolfe-Powell line search for unconstrained nonconvex problems, Local and superlinear convergence of quasi-Newton methods based on modified secant conditions, Rates of superlinear convergence for classical quasi-Newton methods, A numerical evaluation of some collinear scaling algorithms for unconstrained, A robust combined trust region–line search exact penalty projected structured scheme for constrained nonlinear least squares, Fresh look into the design and computation of optimal output feedback controls for linear multivariable systems, Local andQ-superlinear convergence of a class of collinear scaling algorithms that extends quasi-newton methods with broyden's bounded-⊘ class of updates† ‡, Superlinear convergence of symmetric Huang's class of methods, Oblique projections, Broyden restricted class and limited-memory quasi-Newton methods, New results on superlinear convergence of classical quasi-Newton methods, Local convergence analysis for partitioned quasi-Newton updates, Greedy Quasi-Newton Methods with Explicit Superlinear Convergence, The convergence of matrices generated by rank-2 methods from the restricted \(\beta\)-class of Broyden
Cites Work
- Unnamed Item
- Unnamed Item
- Local and superlinear convergence of a class of variable metric methods
- On the convergence rate of imperfect minimization algorithms in Broyden'sβ-class
- Quasi-Newton Methods, Motivation and Theory
- On the Local and Superlinear Convergence of Quasi-Newton Methods
- A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods
- A New Method of Solving Nonlinear Simultaneous Equations
- A Family of Variable-Metric Methods Derived by Variational Means
- A new approach to variable metric algorithms
- The Convergence of Single-Rank Quasi-Newton Methods
- On the Convergence of the Variable Metric Algorithm
- The Convergence of a Class of Double-rank Minimization Algorithms 1. General Considerations
- Conditioning of Quasi-Newton Methods for Function Minimization