A Proximal-Type Method for Convex Vector Optimization Problem in Banach Spaces

In this paper, we consider a convex vector optimization problem of finding weak Pareto optimal solutions from a uniformly convex and uniformly smooth Banach space to a real Banach space, with respect to the partial order induced by a closed, convex, and pointed cone with a nonempty interior. We introduce a vector-valued proximal-type method based on the Lyapunov functional, carry out convergent analysis on this method, and prove that any sequence generated by the method weakly converges to a weak Pareto optimal solution of the vector optimization problem under some mild conditions. Our results improve and generalize some known results.     

SEPARABLE CONDITIONS AND SCALARIZATION OF BENSON PROPER EFFICIENCY

Under the assumption that the ordering cone has a nonempty interior and is separable （or the feasible set has a nonempty interior and is separable）, we give scalarization theorems on Benson proper effciency. Applying the results to vector optimization problems with nearly cone-subconvexlike set-valued maps, we obtain scalarization theorems and Lagrange multiplier theorems for Benson proper effcient solutions.     

Separable Determination of the Fixed Point Property of Convex Sets in Banach Spaces

In this paper, we first show that for every mapping $f$ from a metric space $Ω$ to itself which is continuous off a countable subset of $Ω,$ there exists a nonempty closed separable subspace $S ⊂ Ω$ so that $f|_S$ is again a self mapping on $S.$ Therefore, both the fixed point property and the weak fixed point property of a nonempty closed convex set in a Banach space are separably determined. We then prove that every separable subspace of $c_0(\Gamma)$ (for any set $\Gamma$) is again lying in $c_0.$ Making use of these results, we finally presents a simple proof of the famous result: Every non-expansive self-mapping defined on a nonempty weakly compact convex set of $c_0(\Gamma)$ has a fixed point.     

Translating Finite Sets into Convex Sets

Let X be a reflexive Banach space, and let C X be a closed,convex and bounded set with empty interior. Then, for every > 0, there is a nonempty finite set F X with an arbitrarilysmall diameter, such that C contains at most .|F| points ofany translation of F. As a corollary, a separable Banach spaceX is reflexive if and only if every closed convex subset ofX with empty interior is Haar null. 2000 Mathematics SubjectClassification 46B20 (primary), 28C20 (secondary).     

B-Fredholm Properties of Closed Invertible Operators

In this paper, we study B-Fredholm spectral properties of an invertible closed linear operator in relation with the B-Fredholm spectral properties of its bounded inverse. Precisely, for such operator, we characterize its B-Fredholm spectrum and other related spectra in terms of the corresponding spectra of its bounded inverse. As an application, we show that every normal operator with nonempty resolvent set, in particular self-adjoint Schrödinger operators, satisfies generalized Weyl’s theorem.

     

Infinite dimensional duality and applications

The usual duality theory cannot be applied to infinite dimensional problems because the underlying constraint set mostly has an empty interior and the constraints are possibly nonlinear. In this paper we present an infinite dimensional nonlinear duality theory obtained by using new separation theorems based on the notion of quasi-relative interior, which, in all the concrete problems considered, is nonempty. We apply this theory to solve the until now unsolved problem of finding, in the infinite dimensional case, the Lagrange multipliers associated to optimization problems or to variational inequalities. As an example, we find the Lagrange multiplier associated to a general elastic–plastic torsion problem.     

Closed convex hulls,contents, and K‐spectral states

Our general result says that the closed convex hull of a set K consists of barycentres of probability contents (i.e., finitely additive set functions) on K. (Here K can be any nonempty subset of any nonempty compact convex set in any real or complex locally convex Hausdorff vector space.) In the equivalent setting of dual spaces, we give a very handy analytic criterion for a linear functional to be in the closed convex hull of a given nonempty point‐wise bounded set K of linear functionals (under some mild additional assumption). This is the notion of a K‐spectral state. Our criterion enhances the Abstract Bochner Theorem for unital commutative Banach *‐algebras (which easily follows from our result), in that it allows us to prescribe the set K on which a representing content should live. The content can be chosen to be a Radon measure if K is weak* compact. (© 2008 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

John's Decomposition of the Identity in the Non-Convex Case

We prove an extension of the classical John's Theorem, that characterises the ellipsoid of maximal volume position inside a convex body by the existence of some kind of decomposition of the identity, obtaining some results for maximal volume position of a compact and connected set inside a convex set with nonempty interior. By using those results we give some estimates for the outer volume ratio of bodies not necessarily convex.     

A Bound on the Ratio between the Packing and Covering Densities of a Convex Body

It is shown that if K is a compact convex set which is centrally symmetric and has a nonempty interior, then the density of the tightest lattice packing with copies of K in Euclidean 3-space divided by the density of the thinnest lattice covering of Euclidean 3-space with copies of K is greater than or equal to 1/4. It is likely this bound can be improved, though not beyond approximately 1/2. Received October 8, 1998, and in revised form December 30, 1998.     

Partial Orders on Weak Orders Convex Subsets

We study a visibility relation on the nonempty connected convex subsets of a finite partially ordered set and we investigate the partial orders representable as a visibility relation of such subsets of a weak order. Moreover, we consider restrictions where the subsets of the weak order are total orders or isomorphic total orders.     

Stability of the Minkowski Measure of Asymmetry for Convex Bodies

Given a convex body $C\subset R^n$ (i.e., a compact convex set with nonempty interior), for $x\in$ {\it int}$(C)$, the interior, and a hyperplane $H$ with $x\in H$, let $H_1,H_2$ be the two support hyperplanes of $C$ parallel to $H$. Let $r(H, x)$ be the ratio, not less than 1, in which $H$ divides the distance between $H_1,H_2$. Then the quantity $${\it As}(C):=\inf_{x\in {\it int}(C)}\,\sup_{H\ni x}\,r(H,x)$$ is called the Minkowski measure of asymmetry of $C$. {\it As}$(\cdot)$ can be viewed as a real-valued function defined on the family of all convex bodies in $R^n$. It has been known for a long time that {\it As}$(\cdot)$ attains its minimum value 1 at all centrally symmetric convex bodies and maximum value $n$ at all simplexes. In this paper we discuss the stability of the Minkowski measure of asymmetry for convex bodies. We give an estimate for the deviation of a convex body from a simplex if the corresponding Minkowski measure of asymmetry is close to its maximum value. More precisely, the following result is obtained: Let $C\subset R^n$ be a convex body. If {\it As}$(C)\ge n-\varepsilon$ for some $0\le \varepsilon < 1/8(n+1),$ then there exists a simplex $S_0$ formed by $n+1$ support hyperplanes of $C$, such that $$(1+8(n+1)\varepsilon)^{-1}S_0\subset C\subset S_0,$$ where the homethety center is the (unique) Minkowski critical point of $C$. So $$d_{{\rm BM}}(C,S)\le 1+8(n+1)\varepsilon$$ holds for all simplexes $S$, where $d_{{\rm BM}}(\cdot,\cdot)$ denotes the Banach-Mazur distance.     

自反Banach空间中向量优化问题弱有效解集特性的进一步研究

本文分别研究了在无限维自反Banach空间中,当控制结构为多面体锥时,-般凸向量优化问题和锥约束凸向量优化问题的弱有效解集的非空有界性,并且把结论应用到了一类罚函数方法的收敛性分析上.     

Packing and Covering with Centrally Symmetric Convex Disks

Given a convex disk K (a convex compact planar set with nonempty interior), let δ _L (K) and θ _L (K) denote the lattice packing density and the lattice covering density of K, respectively. We prove that for every centrally-symmetric convex disk K we have that $$ 1\le\delta_L(K)\theta_L(K)\le1.17225\ldots $$ The left inequality is tight and it improves a 10-year old result.     

Relations between the convexity of a set and the differentiability of its support function

It is known that, in finite dimensions, the support function of a compact convex set with nonempty interior is differentiable excepting the origin if and only if the set is strictly convex. In this paper, we realize a thorough study of the relations between the differentiability of the support function on the interior of its domain and the convexity of the set, mainly for unbounded sets. Then, we revisit some results related to the differentiability of the cost function associated to a production function.     

Remotality of Closed Bounded Convex Sets in Reflexive Spaces

Let X be a Banach space and E be a closed bounded subset of X. For x ? X, we define D(x, E) = sup{‖ x ? e‖:e ? E}. The set E is said to be remotal (in X) if, for every x ? X, there exists e ? E such that D(x, E) = ‖x ? e‖. The object of this paper is to characterize those reflexive Banach spaces in which every closed bounded convex set is remotal. Such a result enabled us to produce a convex closed and bounded set in a uniformly convex Banach space that is not remotal. Further, we characterize Banach spaces in which every bounded closed set is remotal.     

Strong Restricted-Orientation Convexity

Strong restricted-orientation convexity is a generalization of standard convexity. We explore the properties of strongly convex sets in multidimensional Euclidean space and identify major properties of standard convex sets that also hold for strong convexity. We characterize strongly convex flats and halfspaces, and establish the strong convexity of the affine hull of a strongly convex set. We then show that, for every point in the boundary of a strongly convex set, there is a supporting strongly convex hyperplane through it. Finally, we show that a closed set with nonempty interior is strongly convex if and only if it is the intersection of strongly convex halfspaces; we state a condition under which this result extends to sets with empty interior.     

On Convergence of a Sequence of Parameterized Closed Convex Sets and Its Applications

Some abstract results about convergences for a sequence of parameterized nonempty closed convex sets, in the Mosco sense as well as in the sense of the local gap have been proved. By using these results, the convergences of some sequences of closed convex sets by certain general concrete structures arc discussed.     

Uniform Boundedness and Closed Graph Theorems for Convex Operators

We are concerned with convex operators mapping a convex subset of a certain topological vector space into an ordered topological vector space, whose positive cone is assumed to be normal. Under the appropriate topological assumptions, we prove the equicontinuity of every pointwise bounded family of continuous convex operators as well as the continuity of every closed convex operator at every algebraically interior point of the domain. We also show that some weak kind of monotonicity implies the continuity of a convex operator.     

On Generalizations of the Frank-Wolfe Theorem to Convex and Quasi-Convex Programmes

In this paper we are concerned with the problem of boundedness and the existence of optimal solutions to the constrained optimization problem. We present necessary and sufficient conditions for boundedness of either a faithfully convex or a quasi-convex polynomial function over the feasible set defined by a system of faithfully convex inequality constraints and/or quasi-convex polynomial inequalities, where the faithfully convex functions satisfy some mild assumption. The conditions are provided in the form of an algorithm, terminating after a finite number of iterations, the implementation of which requires the identification of implicit equality constraints in a homogeneous linear system. We prove that the optimal solution set of the considered problem is nonempty, this way extending the attainability result well known as the so-called Frank-Wolfe theorem. Finally we show that our extension of the Frank-Wolfe theorem immediately implies continuity of the solution set defined by the considered system of (quasi)convex inequalities.     

Set-Valued Systems with Infinite-Dimensional Image and Applications

In infinite-dimensional spaces, we investigate a set-valued system from the image perspective. By exploiting the quasi-interior and the quasi-relative interior, we give some new equivalent characterizations of (proper, regular) linear separation and establish some new sufficient and necessary conditions for the impossibility of the system under new assumptions, which do not require the set to have nonempty interior. We also present under mild assumptions the equivalence between (proper, regular) linear separation and saddle points of Lagrangian functions for the system. These results are applied to obtain some new saddle point sufficient and necessary optimality conditions of vector optimization problems.