scientific article
From MaRDI portal
Publication:4039213
zbMath0771.90090MaRDI QIDQ4039213
Publication date: 8 August 1993
Full work available at URL: https://eudml.org/doc/27963
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Efficient hybrid conjugate gradient techniques
- Partitioned variable metric updates for large structured optimization problems
- On the relation between quadratic termination and convergence properties of minimization algorithms. Part II. Applications
- Analysis of a new algorithm for one-dimensional minimization
- Global convergence result for conjugate gradient methods
- Generalized Polak-Ribière algorithm
- Truncated-Newton algorithms for large-scale unconstrained optimization
- Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search
- Globally convergent conjugate gradient algorithms
- Testing a Class of Methods for Solving Minimization Problems with Simple Bounds on the Variables
- Testing Unconstrained Optimization Software
- Updating Quasi-Newton Matrices with Limited Storage
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- Optimally conditioned optimization algorithms without line searches
- On Sparse and Symmetric Matrix Updating Subject to a Linear Equation
- Restart procedures for the conjugate gradient method
- A Rapidly Convergent Descent Method for Minimization
- Function minimization by conjugate gradients
- Conditioning of Quasi-Newton Methods for Function Minimization
- Methods of conjugate gradients for solving linear systems
