An algorithm for finding the shortest element of a polyhedral set with application to Lagrangian duality
From MaRDI portal
(Redirected from Publication:1248461)
Cites work
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- scientific article; zbMATH DE number 3561096 (Why is no real title available?)
- scientific article; zbMATH DE number 3281211 (Why is no real title available?)
- A finite steepest-ascent algorithm for maximizing piecewise-linear concave functions
- A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality
- Algorithms for some minimax problems
- Convergence Conditions for Nonlinear Programming Algorithms
- Steepest Ascent for Large Scale Linear Programs
Cited in
(9)- An analytical solution to the minimum \(L_ p\)-norm of a hyperplane
- A finite steepest-ascent algorithm for maximizing piecewise-linear concave functions
- An algorithm for linearly constrained nonlinear programming problems
- A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality
- A finite algorithm for finding the projection of a point onto the canonical simplex of \({\mathbb R}^ n\)
- An algorithm for least distance programming
- A survey on the continuous nonlinear resource allocation problem
- Finding the closest point to the origin in the convex hull of a discrete set of points
- A maximum \(L_p\) distance problem
This page was built for publication: An algorithm for finding the shortest element of a polyhedral set with application to Lagrangian duality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1248461)
