Implementation of gradient methods by tangential discretization

DOI10.1007/BF00932219MaRDI QIDQ1250684zbMATH OpenFDO

Authors P. Huard

Publication date 1979

Published in Journal of Optimization Theory and Applications (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Methods of reduced gradient type (90C52)

Cites work

• Convex Analysis
• Convex programming in Hilbert space
• scientific article; zbMATH DE number 3310599 (Why is no real title available?)
• Implementation of gradient methods by tangential discretization
• On the cones of tangents with applications to mathematical programming
• Optimization algorithms and point-to-set-maps
• The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
• The Gradient Projection Method for Nonlinear Programming. Part II. Nonlinear Constraints
• The Validity of a Family of Optimization Methods

Cited in

(2)

• Implementation of gradient methods by tangential discretization
• An homage to Joseph-Louis Lagrange and Pierre Huard

This page was built for publication: Implementation of gradient methods by tangential discretization

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