Fast Givens transformtions applied to the homogeneous optimization method

DOI10.1016/0096-3003(78)90009-7zbMath0401.65038OpenAlexW2079740619MaRDI QIDQ1255301

K. Appert

Publication date: 1978

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0096-3003(78)90009-7

zbMATH Keywords

AlgorithmNumerical ExamplesLinear SystemCholesky DecompositionFast Givens TransformationsMinimum Value of a FunctionUnconstrained Minimization

Mathematics Subject Classification ID

Nonlinear programming (90C30) Numerical optimization and variational techniques (65K10)

Related Items (1)

Some computational advances in unconstrained optimization

Cites Work

• An algorithm that minimizes homogeneous functions of \(n\) variables in \(n + 2\) iterations and rapidly minimizes general functions
• A numerically stable optimization method based on A homogeneous function
• Least Squares Computations by Givens Transformations Without Square Roots

This page was built for publication: Fast Givens transformtions applied to the homogeneous optimization method