An algorithm for projecting onto simplicial cones
From MaRDI portal
Recommendations
- Projection onto simplicial cones by a semi-smooth Newton method
- A linear-time median-finding algorithm for projecting a vector on the simplex of \({\mathbb{R}}^ n\)
- Two fast algorithms for projecting a point onto the canonical simplex
- Projection onto simplicial cones by Picard's method
- A finite algorithm for finding the projection of a point onto the canonical simplex of \({\mathbb R}^ n\)
Cites work
- 10.1007/s11470-008-3004-0
- A critical index algorithm for nearest point problems on simplicial cones
- An active index algorithm for the nearest point problem in a polyhedral cone
- An Exact Algorithm for Projection onto a Polyhedral Cone
- scientific article; zbMATH DE number 1869979 (Why is no real title available?)
- On the projection onto a finitely generated cone
- Projection onto simplicial cones by a semi-smooth Newton method
- Projection onto simplicial cones by Picard's method
- The Simplex Method for Quadratic Programming
Cited in
(7)- Projecting a simplex onto another one
- A linear-time median-finding algorithm for projecting a vector on the simplex of \({\mathbb{R}}^ n\)
- A dynamic algorithm for constructing the dual representation of a polyhedral cone
- Projection onto simplicial cones by a semi-smooth Newton method
- Projection onto simplicial cones by Picard's method
- An oracle-based, output-sensitive algorithm for projections of resultant polytopes
- Projected gradient algorithms for optimization over order simplices
This page was built for publication: An algorithm for projecting onto simplicial cones
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5151504)
