Closedness of a Convex Cone and Application by Means of the End Set of a Convex Set

This article presents new conditions that ensure the closedness of a convex cone in terms of the end set and the extent of its generator. The results significantly extend the classic condition. The new closedness conditions are utilized to obtain a simple formula of the least global error bound and a suitable regularity condition of the set containment problem for sublinear functions.     

Properties of the Set of Extreme Solutions for a Class of Nonlinear Second-Order Evolution Inclusions

We establish the existence of extreme solutions for a class of nonlinear second-order evolution inclusions with a nonconvex right-hand side defined on an evolution triple of Banach spaces. Then we show that extreme solutions which belong to the solution set of the original system are in fact dense and codense in the solution set of a system with a convexified right-hand side. The necessary and sufficient conditions for closedness of the solution set for the original system in an appropriate spaces of functions are given as well. Finally, an example of a nonlinear hyperbolic distributed parameter system is worked out in detail.     

On Criteria for Closedness of an Attainable Set of a Discrete Neutral Control System

This paper deals with the closedness of the attainable set in the function space W⁽¹⁾₂ × L₂ of a linear neutral system with commensurate delays in state and control. Necessary and sufficient algebraic criteria expressed in terms of the system matrices for the closedness are derived. By the additional restriction that the control is a scalar control, another criterion for closedness, based on the transfer matrix, is indicated and used to verify the results.     

广义向量拟平衡问题解集映射的稳定性

我们在局部凸Hausdorff拓扑向量空间中,讨论了广义向量拟平衡问题解集映射的上半连续性以及闭性,并利用扰动间隙函数证明解集的Hausdorff下半连续性.     

Conditions for the uniqueness of the optimal solution in linear semi-infinite programming

In this paper, we establish different conditions for the uniqueness of the optimal solution of a semi-infinite programming problem. The approach here is based on the differentiability properties of the optimal value function and yields the corresponding extensions to the general linear semi-infinite case of many results provided by Mangasarian and others. In addition, detailed optimality conditions for the most general problem are supplied, and some features of the optimal set mapping are discussed. Finally, we obtain a dimensional characterization of the optimal set, provided that a usual closedness condition (Farkas-Minkowski condition) holds.     

On the Brézis Nirenberg Stampacchia-type theorems and their applications

In this paper, we obtain several new generalized KKM-type theorems under a new coercivity condition and the condition of intersectionally closedness which improves condition of transfer closedness. As applications, we obtain new versions of equilibrium problem, minimax inequality, coincidence theorem, fixed point theorem and an existence theorem for an 1-person game.     

Closedness of the solution map for parametric weak vector equilibrium problems

In this paper we introduced a new definition of vector topological pseudomonotonicity to study the parametric weak vector equilibrium problems. The main result gives sufficient conditions for closedness of the solution map defined on the set of parameters.     

Banach空间中的非空闭凸集

证明了对有 Schauder基的无限维 Banach空间中存在非空闭凸集 int A=且 A不可共支撑的重要结论 ,并提出了一些更重要的相关问题 ,研究了新旧问题间的联系 .     

Stability of the Feasible Set Mapping of Linear Systems with an Exact Constraint Set

This paper deals with the stability of the feasible set mapping of linear systems of an arbitrary number (possibly infinite) of equations and inequalities such that the variable x ranges on a certain fixed constraint set X?? ⁿ (X could represent the solution set of a given constraint system, e.g., the positive cone of ? ⁿ in the case of sign constraints). More in detail, the paper provides necessary as well as sufficient conditions for the lower and upper semicontinuity (in Berge sense), and the closedness, of the set-valued mapping which associates, with any admissible perturbation of the given (nominal) system its feasible set. The parameter space is formed by all the systems having the same structure (i.e., the same number of variables, equations and inequalities) as the nominal one, and the perturbations are measured by means of the pseudometric of the uniform convergence.     

Levitin–Polyak well-posedness for constrained quasiconvex vector optimization problems

In this paper, a notion of Levitin–Polyak (LP in short) well-posedness is introduced for a vector optimization problem in terms of minimizing sequences and efficient solutions. Sufficient conditions for the LP well-posedness are studied under the assumptions of compactness of the feasible set, closedness of the set of minimal solutions and continuity of the objective function. The continuity assumption is then weakened to cone lower semicontinuity for vector-valued functions. A notion of LP minimizing sequence of sets is studied to establish another set of sufficient conditions for the LP well-posedness of the vector problem. For a quasiconvex vector optimization problem, sufficient conditions are obtained by weakening the compactness of the feasible set to a certain level-boundedness condition. This in turn leads to the equivalence of LP well-posedness and compactness of the set of efficient solutions. Some characterizations of LP well-posedness are given in terms of the upper Hausdorff convergence of the sequence of sets of approximate efficient solutions and the upper semicontinuity of an approximate efficient map by assuming the compactness of the set of efficient solutions, even when the objective function is not necessarily quasiconvex. Finally, a characterization of LP well-posedness in terms of the closedness of the approximate efficient map is provided by assuming the compactness of the feasible set.     

Closedness and Hadamard well-posedness of the solution map for parametric vector equilibrium problems

In this paper we introduced new definitions of vector topological pseudomonotonicity to study the parametric vector equilibrium problems. The main result gives sufficient conditions for closedness of the solution map defined on the set of parameters. The Hadamard well-posedness of parametric vector equilibrium problems is also analyzed by using the new definitions of vector topological pseudomonotonicity.     

Dual Characterizations of Set Containments with Strict Convex Inequalities

Characterizations of the containment of a convex set either in an arbitrary convex set or in the complement of a finite union of convex sets (i.e., the set, described by reverse-convex inequalities) are given. These characterizations provide ways of verifying the containments either by comparing their corresponding dual cones or by checking the consistency of suitable associated systems. The convex sets considered in this paper are the solution sets of an arbitrary number of convex inequalities, which can be either weak or strict inequalities. Particular cases of dual characterizations of set containments have played key roles in solving large scale knowledge-based data classification problems where they are used to describe the containments as inequality constraints in optimization problems. The idea of evenly convex set (intersection of open half spaces), which was introduced by W. Fenchel in 1952, is used to derive the dual conditions, characterizing the set containments.     

Sufficient Conditions for a Minimum of a Strongly Quasiconvex Function on a Weakly Convex Set

Mathematical Notes - We consider a finite-dimensional minimization problem for a strongly quasiconvex function on a weakly convex set. We obtain sufficient conditions for its solution expressed in...     

平面凸集存在最小凸生成集的充要条件

本文在平面上解决了StevenRLay在 [1 ]中提出的开放性问题“什么样的凸集存在唯一的最小凸生成子集” ,给出并证明了“平面上的凸集存在唯一的最小凸生成子集”的一个充要条件 .同时证明了En 中的开集一定不存在最小凸生成集 .     

Singular Set of a Convex Potential in Two Dimensions

Let u be a convex potential of the optimal transfer map from a convex open set X to a nonconvex open set Y in the plane. If u only has singularities whose sets of supports are one dimension, then under some mild assumptions on Y, we show that the singular set of u are disjoint union of countably many C ¹ curves. Or we can say that the singular set is a C ¹ manifold.     

带多面体控制锥的锥约束凸向量优化问题的有效解集的非空有界性的刻画(英文)

本文刻画了控制锥为多面凸锥的锥约束凸向量优化问题有效解集的非空有界性.然后将其中的一个重要条件应用于一类罚函数方法收敛性的研究.     

带多面体控制锥的锥约束凸向量优化问题的有效解集的非空有界性的刻画

本文刻画了控制锥为多面凸锥的锥约束凸向量优化问题有效解集的非空有界性．然后将其中的一个重要条件应用于一类罚函数方法收敛性的研究．     

Banach空间中的弱凸集和W-太阳集

本文在光滑Banach空间的框架下,引进弱凸集和W-太阳集的概念,研究它们性质,并给出了在逼近问题中的应用.     

Minimum Distance to the Complement of a Convex Set: Duality Result

The subject of this paper is to study the problem of the minimum distance to the complement of a convex set. Nirenberg has stated a duality theorem treating the minimum norm problem for a convex set. We state a duality result which presents some analogy with the Nirenberg theorem, and we apply this result to polyhedral convex sets. First, we assume that the polyhedral set is expressed as the intersection of some finite collection of m given half-spaces. We show that a global solution is determined by solving m convex programs. If the polyhedral set is expressed as the convex hull of a given finite set of extreme points, we show that a global minimum for a polyhedral norm is obtained by solving a finite number of linear programs.     

Duality for semi-definite and semi-infinite programming

In this article, we study semi-definite and semi-infinite programming problems (SDSIP), which includes semi-infinite linear programs and semi-definite programs as special cases. We establish that a uniform duality between the homogeneous (SDSIP) and its Lagrangian-type dual problem is equivalent to the closedness condition of certain cone. Moreover, this closedness condition was assured by a generalized canonically closedness condition and a Slater condition. Corresponding results for the nonhomogeneous (SDSIP) problem were obtained by transforming it into an equivalent homogeneous (SDSIP) problem.