+ Linear support vector machine maximize hard interval (handwritten notes)

Personal original notes, reproduced, please attach a link! This article only deduced hard to maximize the interval solving.



 The derivation process

First, we need to write the optimization problem solving.

 Write a convex optimization problem of the dual problem, namely Lagrange Minimax Problem. Use solving KKT conditions.

 

Published 62 original articles · won praise 34 · views 20000 +

Guess you like

Origin blog.csdn.net/weixin_41960890/article/details/105281351