QUADRATIC AND CONVEX MINIMAX CLASSIFICATION PROBLEMS

DOI10.15807/jorsj.51.191zbMath1279.90125OpenAlexW323485064MaRDI QIDQ3535164

Tomonari Kitahara, Kazuhide Nakata, Shinji Mizuno

Publication date: 10 November 2008

Published in: Journal of the Operations Research Society of Japan (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.15807/jorsj.51.191

Mathematics Subject Classification ID

Convex programming (90C25) Minimax problems in mathematical programming (90C47) Quadratic programming (90C20)

Related Items (4)

Distributionally robust optimization by probability criterion for estimating a bounded signal ⋮ A robust probability classifier based on the modified \(\chi^2\)-distance ⋮ A truncated aggregate smoothing Newton method for minimax problems ⋮ A multivariate Chebyshev bound of the Selberg form

This page was built for publication: QUADRATIC AND CONVEX MINIMAX CLASSIFICATION PROBLEMS