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

DOI10.1007/BF00932904zbMath0362.90114OpenAlexW2028865307MaRDI QIDQ1240155

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)

Related Items

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

Cites Work

• An algorithm for finding the shortest element of a polyhedral set with application to Lagrangian duality
• A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality
• Algorithms for some minimax problems
• The Decomposition Algorithm for Linear Programs
• The Solution of Systems of Piecewise Linear Equations
• Steepest Ascent for Large Scale Linear Programs
• Validation of subgradient optimization
• Elements of Large-Scale Mathematical Programming Part I: Concepts
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item