An \(LDL^{\mathrm{T}}\) trust-region quasi-Newton method
From MaRDI portal
Publication:6623694
DOI10.1137/23M1623380MaRDI QIDQ6623694
Johannes J. Brust, Philip E. Gill
Publication date: 24 October 2024
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
conjugate gradient methodunconstrained minimizationquasi-Newton methodstrust-region methodsline-search methods\(LDL^{\mathrm{T}}\) factorization
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On solving L-SR1 trust-region subproblems
- Approximate solution of the trust region problem by minimization over two-dimensional subspaces
- A limited-memory multipoint symmetric secant method for bound constrained optimization
- A quasi-Newton trust-region method
- Large-scale quasi-Newton trust-region methods with low-dimensional linear equality constraints
- On efficiently combining limited-memory and trust-region techniques
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Minimizing a quadratic over a sphere
- Computing a Trust Region Step
- Iterative Methods for Finding a Trust-region Step
- The Conjugate Gradient Method and Trust Regions in Large Scale Optimization
- Computing Optimal Locally Constrained Steps
- A model algorithm for composite nondifferentiable optimization problems
- Newton’s Method with a Model Trust Region Modification
- On the Behavior of Broyden’s Class of Quasi-Newton Methods
- On the Modification of LDL T Factorizations
- Quasi-Newton Methods, Motivation and Theory
- CUTE
- Line search algorithms with guaranteed sufficient decrease
- Trust Region Methods
- Optimization Methods for Large-Scale Machine Learning
- Solving the Trust-Region Subproblem using the Lanczos Method
- On the Local and Superlinear Convergence of Quasi-Newton Methods
- Methods for Modifying Matrix Factorizations
- Convergence Properties of the BFGS Algoritm
- Large-Scale Optimization with Linear Equality Constraints Using Reduced Compact Representation
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- CUTEr and SifDec
- A Family of Variable-Metric Methods Derived by Variational Means
- A new approach to variable metric algorithms
- The Convergence of a Class of Double-rank Minimization Algorithms 1. General Considerations
- Conditioning of Quasi-Newton Methods for Function Minimization
- A New Algorithm for Unconstrained Optimization
- Quasi-Newton Methods for Unconstrained Optimization
- Methods of conjugate gradients for solving linear systems
- Benchmarking optimization software with performance profiles.
- SOBMOR: Structured Optimization-Based Model Order Reduction
This page was built for publication: An \(LDL^{\mathrm{T}}\) trust-region quasi-Newton method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6623694)