Proximal operator and optimality conditions for ramp loss SVM

نویسندگان

چکیده

Support vector machines with ramp loss ( $$L_r$$ -SVM) have attracted considerable attention due to the robustness of loss. However, corresponding optimization problem is non-convex, and given Karush–Kuhn–Tucker (KKT) conditions are only first-order necessary conditions. To enrich optimality theory -SVM, we first introduce analyze proximal operator for loss, then establish a stronger condition: P-stationarity, which proved be sufficient local minimizer -SVM. Finally, define P-support vectors based on P-stationary point show that under mild conditions, all -SVM two support hyperplanes.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Ozaki's conditions for general integral operator

Assume that $mathbb{D}$ is the open unit disk. Applying Ozaki's conditions, we consider two classes of locally univalent, which denote by $mathcal{G}(alpha)$ and $mathcal{F}(mu)$ as follows begin{equation*}  mathcal{G}(alpha):=left{fin mathcal{A}:mathfrak{Re}left( 1+frac{zf^{prime prime }(z)}{f^{prime }(z)}right) <1+frac{alpha }{2},quad 0<alphaleq1right}, end{equation*} and begin{equation*}  ma...

متن کامل

Sequential Optimality Conditions and Variational Inequalities

In recent years, sequential optimality conditions are frequently used for convergence of iterative methods to solve nonlinear constrained optimization problems. The sequential optimality conditions do not require any of the constraint qualications. In this paper, We present the necessary sequential complementary approximate Karush Kuhn Tucker (CAKKT) condition for a point to be a solution of a ...

متن کامل

New optimality conditions for multiobjective fuzzy programming problems

In this paper we study fuzzy multiobjective optimization problems defined for $n$ variables.  Based on a new $p$-dimensional fuzzy stationary-point definition,  necessary  efficiency conditions are obtained.  And we prove that these conditions are also sufficient under new fuzzy generalized convexity notions. Furthermore, the results are obtained under general differentiability hypothesis.

متن کامل

Optimality Conditions and Algorithms

This paper treats the problem of minimizing a general continuously differentiable function subject to sparsity constraints. We present and analyze several different optimality criteria which are based on the notions of stationarity and coordinate-wise optimality. These conditions are then used to derive three numerical algorithms aimed at finding points satisfying the resulting optimality crite...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Optimization Letters

سال: 2021

ISSN: ['1862-4480', '1862-4472']

DOI: https://doi.org/10.1007/s11590-021-01756-7