Abstract
We consider unconstrained minimax problem where the objective function is the maximum of a finite number of smooth convex functions. We present an iterative method to compute the optimal solution for the unconstrained convex finite minimax problem. The algorithm developed estimates the direction of steepest-descent rapidly and using Armijo's condition proceeds towards the solution. Owing to the highly parallel nature of the algorithm, it is highly suitable for large minimax problems. Algorithm is implemented on Nvidia Tesla C1060 graphics card using CUDA and numerical comparisons with RGA & CFSQP are presented. © 2010 Springer-Verlag.
Author supplied keywords
Cite
CITATION STYLE
Arora, R., Upadhyay, U., Tulshyan, R., & Dutta, J. (2010). A parallel algorithm for solving large convex minimax problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6457 LNCS, pp. 35–44). https://doi.org/10.1007/978-3-642-17298-4_3
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
