Relating Lexicographic Smoothness and Directed Subdifferentiability
نویسندگان
چکیده
منابع مشابه
Relating lexicographic smoothness and directed subdifferentiability
Lexicographic derivatives developed by Nesterov and directed subdifferentials developed by Baier, Farkhi, and Roshchina are both essentially nonconvex generalized derivatives for nonsmooth nonconvex functions and satisfy strict calculus rules and mean-value theorems. This article aims to clarify the relationship between the two generalized derivatives. In particular, for scalar-valued functions...
متن کاملSubdifferentiability and the Duality Gap
We point out a connection between sensitivity analysis and the fundamental theorem of linear programming by characterizing when a linear programming problem has no duality gap. The main result is that the value function is subdifferentiable at the primal constraint if and only if there exists an optimal dual solution and there is no duality gap. To illustrate the subtlety of the condition, we e...
متن کاملReverse Lexicographic and Lexicographic Shifting
A short new proof of the fact that all shifted complexes are fixed by reverse lexicographic shifting is given. A notion of lexicographic shifting, ∆lex — an operation that transforms a monomial ideal of S = k[xi : i ∈ N] that is finitely generated in each degree into a squarefree strongly stable ideal — is defined and studied. It is proved that (in contrast to the reverse lexicographic case) a ...
متن کاملOn the Subdifferentiability of Convex Functions
(Thus the subgradients of / correspond to the nonvertical supporting hyperplanes to the convex set consisting of all the points of E®R lying above the graph of /.) The set of subgradients of / at x is denoted by dfix). If d/(x) is not empty, / is said to be subdifferentiable at x. If/actually had a gradient x* = V/(x) at x in the sense of Gateaux (or Frechet), one would in particular have d/(x)...
متن کاملBounded lower subdifferentiability optimization techniques: applications
In this article we develop a global optimization algorithm for quasiconvex programming where the objective function is a Lipschitz function which may have “flat parts”. We adapt the Extended Cutting Angle method to quasiconvex functions, which reduces significantly the number of iterations and objective function evaluations, and consequently the total computing time. Applications of such an alg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Set-Valued and Variational Analysis
سال: 2016
ISSN: 1877-0533,1877-0541
DOI: 10.1007/s11228-016-0375-6