A finite steepest-ascent algorithm for maximizing piecewise-linear concave functions (Q1240155): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Algorithms for some minimax problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4145425 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5630824 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elements of Large-Scale Mathematical Programming Part I: Concepts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steepest Ascent for Large Scale Linear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Decomposition Algorithm for Linear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Validation of subgradient optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4128913 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Solution of Systems of Piecewise Linear Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for finding the shortest element of a polyhedral set with application to Lagrangian duality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5566063 / rank
 
Normal rank

Revision as of 20:56, 12 June 2024

scientific article
Language Label Description Also known as
English
A finite steepest-ascent algorithm for maximizing piecewise-linear concave functions
scientific article

    Statements

    Identifiers