Computation of a trust region step
From MaRDI portal
Publication:1198611
DOI10.1007/BF02009686zbMath0753.90062MaRDI QIDQ1198611
Publication date: 16 January 1993
Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)
Nonlinear programming (90C30) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds
- Approximate solution of the trust region problem by minimization over two-dimensional subspaces
- Computing a Trust Region Step
- On the global convergence of trust region algorithms for unconstrained minimization
- A Family of Trust-Region-Based Algorithms for Unconstrained Minimization with Strong Global Convergence Properties
- Computing Optimal Locally Constrained Steps
- Newton’s Method with a Model Trust Region Modification
- Numerically stable methods for quadratic programming
This page was built for publication: Computation of a trust region step