A Descent Algorithm for Minimizing Polyhedral Convex Functions
From MaRDI portal
Recommendations
- An efficient algorithm for minimizing a multivariate polyhedral function along a line
- Descent methods for convex essentially smooth minimization
- On the Linear Convergence of Descent Methods for Convex Essentially Smooth Minimization
- An algorithm for linearizing convex extremal problems
- A descent algorithm for nonsmooth convex optimization
Cited in
(14)- The hill detouring method for minimizing hinging hyperplanes functions
- Finding normal solutions in piecewise linear programming
- Iterative schemes for the least 2-norm solution of piecewise linear programs
- A new algorithm for minimizing convex functions over convex sets
- On level regularization with normal solutions in decomposition methods for multistage stochastic programming problems
- A hard case!
- scientific article; zbMATH DE number 3867078 (Why is no real title available?)
- A finite algorithm for concave minimization over a polyhedron
- A regularized decomposition method for minimizing a sum of polyhedral functions
- On Steepest Descent Algorithms for Discrete Convex Functions
- A PRACTICAL ALOGORITHM FOR MINIMIZING A RANK-TWO SADDLE FUNCTION ON A POLYTOPE
- scientific article; zbMATH DE number 6129040 (Why is no real title available?)
- Pebble Minimization of Polyregular Functions
- Minimizing Piecewise-Concave Functions Over Polyhedra
This page was built for publication: A Descent Algorithm for Minimizing Polyhedral Convex Functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3321363)
