Learning Theory
From MaRDI portal
Publication:5473619
DOI10.1007/b137542zbMath1127.68082OpenAlexW4246660828MaRDI QIDQ5473619
Hans Ulrich Simon, Nikolas List
Publication date: 22 June 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b137542
Analysis of algorithms and problem complexity (68Q25) Convex programming (90C25) Learning and adaptive systems in artificial intelligence (68T05) Quadratic programming (90C20)
Related Items (5)
On the complexity of working set selection ⋮ A simple decomposition algorithm for support vector machines with polynomial-time convergence ⋮ A random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraints ⋮ A coordinate gradient descent method for linearly constrained smooth optimization and support vector machines training ⋮ Block-coordinate gradient descent method for linearly constrained nonsmooth separable optimization
This page was built for publication: Learning Theory
