Parallel bucket sorting on graphics processing units based on convex optimization

DOI10.1080/02331934.2013.836645zbMath1320.90058OpenAlexW2046132606MaRDI QIDQ5248218

Gleb Beliakov, Gang Li, Shaowu Liu

Publication date: 28 April 2015

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331934.2013.836645

zbMATH Keywords

convex optimizationorder statisticcutting plane methodparallel sortingGPUparallel selection

Mathematics Subject Classification ID

Convex programming (90C25) Applications of mathematical programming (90C90)

Related Items (1)

Almost sure convergence of random projected proximal and subgradient algorithms for distributed nonsmooth convex optimization

Cites Work

• Computing of high breakdown regression estimators without sorting on graphics processing units
• Fast parallel GPU-sorting using a hybrid algorithm
• Aggregation functions based on penalties
• Time bounds for selection
• Derivative-free optimization and neural networks for robust regression
• The Cutting-Plane Method for Solving Convex Programs
• On Shape Preserving Quadratic Spline Interpolation
• UNDERSTANDING THE MEDIAN AS A FUSION OPERATOR
• Order Statistics
• Parallel Sorting for GPUs

This page was built for publication: Parallel bucket sorting on graphics processing units based on convex optimization