The steepest-ascent method for the linear programming problem

DOI10.1051/M2AN/1981150301951MaRDI QIDQ3932598zbMATH OpenOpenAlexFDO

Authors J. Denel, P. Huard, J. C. Fiorot

Publication date 1981

Published in RAIRO. Analyse numérique (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/193377

zbMATH Keywords

finite projection methodnondifferentiable convex optimizationpiecewise-linear concave functionsteepest-ascent method

Mathematics Subject Classification ID

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

Cites work

• A finite steepest-ascent algorithm for maximizing piecewise-linear concave functions
• Algorithms for some minimax problems
• scientific article; zbMATH DE number 3177183 (Why is no real title available?)
• scientific article; zbMATH DE number 3219394 (Why is no real title available?)
• scientific article; zbMATH DE number 3358258 (Why is no real title available?)
• The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints

Cited in

(1)

• An homage to Joseph-Louis Lagrange and Pierre Huard

This page was built for publication: The steepest-ascent method for the linear programming problem

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