Pages that link to "Item:Q1240155"
From MaRDI portal
The following pages link to A finite steepest-ascent algorithm for maximizing piecewise-linear concave functions (Q1240155):
Displaying 4 items.
- An algorithm for finding the shortest element of a polyhedral set with application to Lagrangian duality (Q1248461) (← links)
- A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality (Q1257414) (← links)
- Nonsmooth nonconvex optimization approach to clusterwise linear regression problems (Q2355817) (← links)
- The steepest-ascent method for the linear programming problem (Q3932598) (← links)