Line search termination criteria for collinear scaling algorithms for minimizing a class of convex functions

DOI10.1007/S002110050371zbMath0916.65061OpenAlexW2066743371MaRDI QIDQ1272810

Ariyawansa, K. A.

Publication date: 6 July 1999

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s002110050371

zbMATH Keywords

convex programmingquasi-Newton methodscollinear scaling algorithmsline search termination criterianormal conic local approximation

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25)

Related Items (1)

A new class of supermemory gradient methods

This page was built for publication: Line search termination criteria for collinear scaling algorithms for minimizing a class of convex functions