Results 51 to 60 of about 15,245 (222)
Vector subdifferentials and tangent cones
Following the Rockafellar's definition for the subdifferential of a real map we define a vector subdifferential using the normal cone to the epigraph of the function.
Cristina Stamate
doaj +2 more sources
On one consequence of the Chebyshev alternance [PDF]
The classical problem of the best approximation of a continuous function by a polynomial over a Chebyshev system of functions is considered. It is known that the solution of the problem is characterized by alternance.
Dudov, Sergei Ivanovitch +1 more
doaj +1 more source
We prove that every function $f:\mathbb{R}^n\to \mathbb{R}$ satisfies that the image of the set of critical points at which the function $f$ has Taylor expansions of order $n-1$ and non-empty subdifferentials of order $n$ is a Lebesgue-null set.
Azagra, Daniel +2 more
core +1 more source
Dimer models and conformal structures
Abstract Dimer models have been the focus of intense research efforts over the last years. Our paper grew out of an effort to develop new methods to study minimizers or the asymptotic height functions of general dimer models and the geometry of their frozen boundaries.
Kari Astala +3 more
wiley +1 more source
Sensitivity analysis of parametric vector equilibrium problems on Fréchet coderivative
In this paper, the sensitivity analysis of parametric vector equilibrium problems (for short PVEP) is conducted based on the Fréchet coderivative of a multifunction.
Xicai Deng, Yibo Liu, Chongyi Zhong
doaj +1 more source
Inequalities and counterexamples for functional intrinsic volumes and beyond
Abstract We show that analytic analogs of Brunn–Minkowski‐type inequalities fail for functional intrinsic volumes on convex functions. This is demonstrated both through counterexamples and by connecting the problem to results of Colesanti, Hug, and Saorín Gómez.
Fabian Mussnig, Jacopo Ulivelli
wiley +1 more source
The main aim of this paper is to study strong Karush–Kuhn–Tucker (KKT) optimality conditions for nonsmooth multiobjective semi-infinite programming (MSIP) problems. By using tangential subdifferential and suitable regularity conditions, we establish some
L. Tung
semanticscholar +1 more source
This paper defines a strong convertible nonconvex (SCN) function for solving the unconstrained optimization problems with the nonconvex or nonsmooth (nondifferentiable) function. First, the concept of SCN function is defined, where the SCN functions are nonconvex or nonsmooth.
Min Jiang +4 more
wiley +1 more source
The author gives a survey (with over 100 references) about the theory of Fréchet subdifferentiation in Banach spaces. After the definitions of Fréchet subdifferentials (and superdifferentials) of real-valued functions, Fréchet normal cones of sets and Fréchet coderivatives of set-valued mappings, the most important properties of these notions are ...
openaire +3 more sources
Robust multitask feature learning with adaptive Huber regressions
Abstract When data from multiple tasks have outlier contamination, existing multitask learning methods perform less efficiently. To address this issue, we propose a robust multitask feature learning method by combining the adaptive Huber regression tasks with mixed regularization. The robustification parameters can be chosen to adapt to the sample size,
Yuan Zhong, Xin Gao, Wei Xu
wiley +1 more source

