A finite steepest-ascent algorithm for maximizing piecewise-linear concave functions

DOI10.1007/BF00932904MaRDI QIDQ1240155zbMATH OpenOpenAlexFDO

Authors Mokhtar S. Bazaraa, Jamie J. Goode, Ronald L. Rardin

Publication date 1978

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

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

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Cites work

• scientific article; zbMATH DE number 3554413 (Why is no real title available?)
• scientific article; zbMATH DE number 3573593 (Why is no real title available?)
• scientific article; zbMATH DE number 3281211 (Why is no real title available?)
• scientific article; zbMATH DE number 3356467 (Why is no real title available?)
• A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality
• Algorithms for some minimax problems
• An algorithm for finding the shortest element of a polyhedral set with application to Lagrangian duality
• Elements of Large-Scale Mathematical Programming Part I: Concepts
• Steepest Ascent for Large Scale Linear Programs
• The Decomposition Algorithm for Linear Programs
• The Solution of Systems of Piecewise Linear Equations
• Validation of subgradient optimization

Cited in

(4)

• An algorithm for finding the shortest element of a polyhedral set with application to Lagrangian duality
• The steepest-ascent method for the linear programming problem
• A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality
• Nonsmooth nonconvex optimization approach to clusterwise linear regression problems

This page was built for publication: A finite steepest-ascent algorithm for maximizing piecewise-linear concave functions

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