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

DOI10.1007/BF00932904zbMATH Open0362.90114OpenAlexW2028865307MaRDI QIDQ1240155FDOQ1240155

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

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

Cited In (4)

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

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)