Pages that link to "Item:Q1248461"

The following pages link to An algorithm for finding the shortest element of a polyhedral set with application to Lagrangian duality (Q1248461):

Displaying 9 items.

• A finite algorithm for finding the projection of a point onto the canonical simplex of \({\mathbb R}^ n\) (Q1061617) (← links)
• An algorithm for linearly constrained nonlinear programming problems (Q1151830) (← links)
• A finite steepest-ascent algorithm for maximizing piecewise-linear concave functions (Q1240155) (← links)
• A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality (Q1257414) (← links)
• Finding the closest point to the origin in the convex hull of a discrete set of points (Q1260737) (← links)
• An analytical solution to the minimum \(L_ p\)-norm of a hyperplane (Q1363554) (← links)
• A maximum \(L_p\) distance problem (Q1378646) (← links)
• A survey on the continuous nonlinear resource allocation problem (Q2456404) (← links)
• An algorithm for least distance programming (Q3920551) (← links)