An algorithm for projecting onto simplicial cones

DOI10.1080/02331934.2019.1696336zbMath1460.90123OpenAlexW2990977611MaRDI QIDQ5151504

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

zbMATH Keywords

global optimizationquadratic programmingconvex programming

Mathematics Subject Classification ID

Convex programming (90C25) Quadratic programming (90C20)

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• 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
• On the Projection onto a Finitely Generated Cone
• The Simplex Method for Quadratic Programming
• 10.1007/s11470-008-3004-0
• A critical index algorithm for nearest point problems on simplicial cones
• An Exact Algorithm for Projection onto a Polyhedral Cone

This page was built for publication: An algorithm for projecting onto simplicial cones