Analysis of a Symmetric Rank-One Trust Region Method
From MaRDI portal
Recommendations
- A Theoretical and Experimental Study of the Symmetric Rank-One Update
- Symmetric rank-one method based on some modified secant conditions for unconstrained optimization
- On the performance of a new symmetric rank-one method with restart for solving unconstrained optimization problems
- A new approach to symmetric rank-one updating
- Convergence of Symmetric Rank-One method based on Modified Quasi-Newton equation
Cited in
(33)- A new trust region method with adaptive radius
- The symmetric rank-one quasi-Newton method is a space-dilation subgradient algorithm
- Metric-based symmetric rank-one updates
- An SR1/BFGS SQP algorithm for nonconvex nonlinear programs with block-diagonal Hessian matrix
- Cubic regularization in symmetric rank-1 quasi-Newton methods
- The convergence of subspace trust region methods
- A symmetric rank-one quasi-Newton line-search method using negative curvature directions
- Structured symmetric rank-one method for unconstrained optimization
- Symmetric rank-one method based on some modified secant conditions for unconstrained optimization
- Convergence of Symmetric Rank-One method based on Modified Quasi-Newton equation
- Wide interval for efficient self-scaling quasi-Newton algorithms
- Continuous adjoint methods for turbulent flows, applied to shape and topology optimization: industrial applications
- Convergence of a positive definite symmetric rank one method with restart
- Optimalr-order of an adjoint Broyden method without the assumption of linearly independent steps
- A Theoretical and Experimental Study of the Symmetric Rank-One Update
- Measures for Symmetric Rank-One Updates
- Quasi-Newton methods for machine learning: forget the past, just sample
- On solving L-SR1 trust-region subproblems
- Convergence of Newton-MR under inexact Hessian information
- Stochastic proximal quasi-Newton methods for non-convex composite optimization
- Structured Quasi-Newton Methods for Optimization with Orthogonality Constraints
- Approximation of sequences of symmetric matrices with the symmetric rank-one algorithm and applications
- Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results
- Sufficient descent directions in unconstrained optimization
- Towards explicit superlinear convergence rate for SR1
- Regularization of limited memory quasi-Newton methods for large-scale nonconvex minimization
- Greedy PSB methods with explicit superlinear convergence
- Accelerated adaptive cubic regularized quasi-Newton methods
- A nonmonotone PSB algorithm for solving unconstrained optimization
- Quasi-Newton method with subspace gradients
- A randomized sketching trust-region secant method for low-memory dynamic optimization
- Non-asymptotic global convergence rates of BFGS with exact line search
- A derivative-free nonmonotone line-search technique for unconstrained optimization
This page was built for publication: Analysis of a Symmetric Rank-One Trust Region Method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4717555)
