A numerically stable optimization method based on A homogeneous function

DOI10.1007/BF01580370MaRDI QIDQ4121691zbMATH OpenOpenAlexFDO

Authors Janusz S. Kowalik, K. Ramakrishnan

Publication date 1976

Published in Mathematical Programming (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Nonlinear programming (90C30) Linear equations (linear algebraic aspects) (15A06) Iterative numerical methods for linear systems (65F10)

Cites work

• scientific article; zbMATH DE number 3529352 (Why is no real title available?)
• A View of Unconstrained Minimization Algorithms that Do Not Require Derivatives
• A modified homogeneous algorithm for function minimization
• The simplex method of linear programming using LU decomposition

Cited in

(9)

• The effect of data grid size on certain interpolation methods for unconstrained function minimization
• Differential gradient methods
• Imperfect conjugate gradient algorithms for extended quadratic functions
• On the convergence, invariance, and related aspects of a modification of Huang's algorithm
• New combined method for unconstrained minimization
• A generalized conjugate gradient algorithm for minimization
• Some computational advances in unconstrained optimization
• Fast Givens transformtions applied to the homogeneous optimization method
• A numerically stable reduced-gradient type algorithm for solving large- scale linearly constrained minimization problems

This page was built for publication: A numerically stable optimization method based on A homogeneous function

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4121691)