On the equilibrium prices of a regular locally Lipschitz exchange economy

We extend classical results by Debreu and Dierker about equilibrium prices of a regular economy with continuously differentiable demand functions/excess demand function to a regular exchange economy with these functions being locally Lipschitz. Our concept of a regular economy is based on Clarke’s concept of regular value and we show that such a regular economy … Read more

A unified scheme for scalarization in set optimization

In this work, we propose a new scheme for scalarization in set optimization studied with the Kuroiwa set appoach. First, we define an abstract scalarizing function possessing properties such as global Lipschizity, sublinearity, cone monotonicity, cone representation property, cone interior representation property and uniform positivity. Next, we use this function to define the so called … Read more

Bishop-Phelps cones given by an equation in Banach spaces

In this work, we study Bishop-Phelps cones (briefly, BP cones) given by an equation in Banach spaces. Due to the special form, these cones enjoy interesting properties. We show that nontrivial BP cones given by an equation form a “large family” in some sense in any Banach space and they can be used to characterize … Read more

The Sard theorem for essentially smooth locally Lipschitz maps and applications in optimization

The classical Sard theorem states that the set of critical values of a $C^{k}$-map from an open set of $\R^n$ to $\R^p$ ($n\geq p$) has Lebesgue measure zero provided $k\geq n-p+1$. In the recent paper by Barbet, Dambrine, Daniilidis and Rifford, the so called “preparatory Sard theorem” for a compact countable set $I$ of $C^k$ … Read more

A new concept of slope for set-valued maps and applications in set optimization studied with Kuroiwa’s set approach

In this paper, scalarizing functions defined with the help of the Hiriart-Urruty signed distance are used to characterize set order relations and weak optimal solutions in set optimization studied with Kuroiwa’s set approach and to introduce a new concept of slope for a set-valued map. It turns out that this slope possesses most properties of … Read more

A Hausdorff-type distance, a directional derivative of a set-valued map and applications in set optimization

In this paper, we follow Kuroiwa’s set approach in set optimization, which proposes to compare values of a set-valued objective map $F$ respect to various set order relations. We introduce a Hausdorff-type distance relative to an ordering cone between two sets in a Banach space and use it to define a directional derivative for $F$. … Read more

Strong slopes of a vector-valued map and applications in the study of error bounds, weak sharp minima and calmness

Using Hiriart-Urruty’s signed distance function, we present new definitions of strong slopes for a vector-valued map recently introduced in [E.M. Bednarczuk, A.Y., Kruger, Error bounds for vector-valued functions on metric spaces. Vietnam J. Math. 40 (2012), no. 2-3, 165-180]. With the new presentation, we are able to show that these slopes enjoy most properties of … Read more

A remark on the lower semicontinuity assumption in the Ekeland variational principle

What happens to the conclusion of the Ekeland variational principle (briefly, EVP) if a considered function $f:X\to \R\cup\{+\infty\}$ is lower semicontinuous not on a whole metric space $X$ but only on its domain? We provide a straightforward proof showing that it still holds but only for $\epsilon $ varying in some interval $]0,\beta-\inf_Xf[$, where $\beta$ … Read more

The global weak sharp minima with explicit exponents in polynomial vector optimization problems

In this paper we discuss the global weak sharp minima property for vector optimization problems with polynomial data. Exploiting the imposed polynomial structure together with tools of variational analysis and a quantitative version of \L ojasiewicz’s gradient inequality due to D’Acunto and Kurdyka, we establish the H\”older type global weak sharp minima with explicitly calculated … Read more

Some criteria for error bounds in set optimization

We obtain sufficient and/or necessary conditions for global/local error bounds for the distances to some sets appeared in set optimization studied with both the set approach and vector approach (sublevel sets, constraint sets, sets of {\it all } Pareto efficient/ Henig proper efficient/super efficient solutions, sets of solutions {\it corresponding to one} Pareto efficient/Henig proper … Read more