An algorithm for projecting onto simplicial cones
From MaRDI portal
Publication:5151504
DOI10.1080/02331934.2019.1696336zbMATH Open1460.90123OpenAlexW2990977611MaRDI QIDQ5151504FDOQ5151504
Authors: Oh Kang Kwon 
Publication date: 19 February 2021
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2019.1696336
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
- The Simplex Method for Quadratic Programming
- A critical index algorithm for nearest point problems on simplicial cones
- An active index algorithm for the nearest point problem in a polyhedral cone
- Projection onto simplicial cones by a semi-smooth Newton method
- Projection onto simplicial cones by Picard's method
- An Exact Algorithm for Projection onto a Polyhedral Cone
- On the projection onto a finitely generated cone
- 10.1007/s11470-008-3004-0
- Title not available (Why is that?)
Cited In (7)
- Projected gradient algorithms for optimization over order simplices
- Projecting a simplex onto another one
- A dynamic algorithm for constructing the dual representation of a polyhedral cone
- A linear-time median-finding algorithm for projecting a vector on the simplex of \({\mathbb{R}}^ n\)
- An oracle-based, output-sensitive algorithm for projections of resultant polytopes
- Projection onto simplicial cones by a semi-smooth Newton method
- Projection onto simplicial cones by Picard's method
Uses Software
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)
