Lagrange Multipliers and Duality with Applications to Constrained Support Vector Machine
Abstract: In this paper, we employ the concept of quasi-relative interior to analyze the method of Lagrange multipliers and establish strong Lagrangian duality for nonsmooth convex optimization problems in Hilbert spaces. Then, we generalize the classical support vector machine (SVM) model by incorporating a new geometric constraint or a regularizer on the separating hyperplane, serving as a regularization mechanism for the SVM. This new SVM model is examined using Lagrangian duality and other convex optimization techniques in both theoretical and numerical aspects via a new subgradient algorithm as well as a primal-dual method.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.