Convergence of quasi-Newton matrices generated by the symmetric rank one update

DOI10.1007/BF01594934zbMath0737.90062OpenAlexW2053964895WikidataQ59567942 ScholiaQ59567942MaRDI QIDQ1176575

S. Singh

Publication date: 25 June 1992

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01594934

zbMATH Keywords

rate of convergencequasi-Newton algorithmsHessian approximationstrue Hessian matrixunconstrained nonlinear minimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (61)

Convergence properties of the Broyden-like method for mixed linear-nonlinear systems of equations ⋮ A limited memory quasi-Newton trust-region method for box constrained optimization ⋮ On the performance of switching BFGS/SR1 algorithms for unconstrained optimization ⋮ Accelerated memory-less SR1 method with generalized secant equation for unconstrained optimization ⋮ A note on memory-less SR1 and memory-less BFGS methods for large-scale unconstrained optimization ⋮ The least prior deviation quasi-Newton update ⋮ Quasi-Newton methods for machine learning: forget the past, just sample ⋮ On the local convergence of adjoint Broyden methods ⋮ Non-intrusive coupling: recent advances and scalable nonlinear domain decomposition ⋮ On Efficiently Computing the Eigenvalues of Limited-Memory Quasi-Newton Matrices ⋮ On efficiently combining limited-memory and trust-region techniques ⋮ On the performance of a new symmetric rank-one method with restart for solving unconstrained optimization problems ⋮ A quasi-second-order proximal bundle algorithm ⋮ A limited-memory Riemannian symmetric rank-one trust-region method with a restart strategy ⋮ A posteriori error estimation and adaptivity in non-intrusive couplings between concurrent models ⋮ Towards explicit superlinear convergence rate for SR1 ⋮ Non-asymptotic superlinear convergence of standard quasi-Newton methods ⋮ A derivative-free scaling memoryless DFP method for solving large scale nonlinear monotone equations ⋮ Scaling limits in computational Bayesian inversion ⋮ An overview of stochastic quasi-Newton methods for large-scale machine learning ⋮ A modified scaled memoryless symmetric rank-one method ⋮ A novel iterative learning control scheme based on Broyden‐class optimization method ⋮ An SR1/BFGS SQP algorithm for nonconvex nonlinear programs with block-diagonal Hessian matrix ⋮ Limited memory methods with improved symmetric rank-one updates and its applications on nonlinear image restoration ⋮ Improved Hessian approximation with modified secant equations for symmetric rank-one method ⋮ Greedy PSB methods with explicit superlinear convergence ⋮ Trust-region algorithms for training responses: machine learning methods using indefinite Hessian approximations ⋮ Estimation and inference by stochastic optimization ⋮ Approximating Higher-Order Derivative Tensors Using Secant Updates ⋮ A restarting approach for the symmetric rank one update for unconstrained optimization ⋮ A symmetric rank-one method based on extra updating techniques for unconstrained optimization ⋮ A survey of gradient methods for solving nonlinear optimization ⋮ Optimalr-order of an adjoint Broyden method without the assumption of linearly independent steps ⋮ A derivative-free nonmonotone line-search technique for unconstrained optimization ⋮ A new class of conjugate gradient methods for unconstrained smooth optimization and absolute value equations ⋮ Convergence of Newton-MR under Inexact Hessian Information ⋮ Cubic regularization in symmetric rank-1 quasi-Newton methods ⋮ Eigenvalues and switching algorithms for Quasi-Newton updates ⋮ On solving L-SR1 trust-region subproblems ⋮ Formulation and solution strategies for nonparametric nonlinear stochastic programmes with an application in finance ⋮ Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results ⋮ On constrained optimization by adjoint based quasi-Newton methods ⋮ On constrained optimization by adjoint based quasi-Newton methods ⋮ Maintaining factorized KKT systems subject to rank-one updates of Hessians and Jacobians ⋮ Scaled memoryless symmetric rank one method for large-scale optimization ⋮ Properties and numerical performance of quasi-Newton methods with modified quasi-Newton equations ⋮ Stochastic proximal quasi-Newton methods for non-convex composite optimization ⋮ Quasi-Newton acceleration for equality-constrained minimization ⋮ A modified Broyden-like quasi-Newton method for nonlinear equations ⋮ Convergence of Broyden-like matrix ⋮ A symmetric rank-one quasi-Newton line-search method using negative curvature directions ⋮ How much do approximate derivatives hurt filter methods? ⋮ Maximum Entropy Derivation of Quasi-Newton Methods ⋮ Bayesian mechanistic modeling of thermodynamically controlled volatile fatty acid, hydrogen and methane production in the bovine rumen ⋮ Greedy Quasi-Newton Methods with Explicit Superlinear Convergence ⋮ Approximation of Sequences of Symmetric Matrices with the Symmetric Rank-One Algorithm and Applications ⋮ An inexact ℓ₁penalty SQP algorithm for PDE-constrained optimization with an application to shape optimization in linear elasticity ⋮ Adjoint-based SQP method with block-wise quasi-Newton Jacobian updates for nonlinear optimal control ⋮ Extended Dai-Yuan conjugate gradient strategy for large-scale unconstrained optimization with applications to compressive sensing ⋮ Pointwise quasi-Newton method for unconstrained optimal control problems. II ⋮ Variational quasi-Newton methods for unconstrained optimization

Uses Software

• ve08

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Partitioned variable metric updates for large structured optimization problems
• On the order of convergence of certain quasi-Newton methods
• The convergence of variable metric matrices in unconstrained optimization
• Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds
• Testing a Class of Methods for Solving Minimization Problems with Simple Bounds on the Variables
• On the Superlinear Convergence of an Algorithm for Solving a Sparse Minimization Problem
• Quasi-Newton Methods, Motivation and Theory
• A New Algorithm for Unconstrained Optimization

This page was built for publication: Convergence of quasi-Newton matrices generated by the symmetric rank one update