Conjugate Intervals for the Linear Fixed-Endpoint Control Problem

For certain optimal control problems with piecewise continuous controls, recently Loewen and Zheng (Ref. 1) and Zeidan (Ref. 2) defined two sets of generalized conjugate points for which, under normality assumptions, the second-order conditions in terms of the accessory problem imply their emptiness. However, simple examples show that checking the existence of such points may be more difficult than directly finding variations that make the second variation negative. In this paper, for the linear fixed-endpoint control problem, we introduce a new set whose emptiness is equivalent to the nonnegativity of the second variation along admissible variations. Moreover, we achieve by means of this set the main objective of introducing a characterization of this condition, namely, to obtain a simpler way of verifying it.     

Conjugacy for normal or abnormal linear Bolza problems

For certain Bolza problems with linear dynamics, two sets extending the notion of conjugate points in the calculus of variations are introduced. Independently of nonsingularity assumptions, their emptiness, in one case without normality assumptions, is shown to be equivalent to a second order necessary condition. A comparison with other notions available in the literature is given.     

无限维空间拟凸映射多目标最优化问题解集的连通性

本文在一个无限格中引入了拟凸、强拟凸和严格拟凸映射。并在约束集为紧凸条件下，证明了相应的多目标规划问题之有效解集和弱有效解集连通性结果。     

无限维空间中强拟凸向量优化问题有效解集的连通性

本文在无穷维空间引进增强凸变换的概念，在约束集是紧和凸的条件下目标函数是连续和强拟凸的，我们得取到向量极小问题有效解集的连通性。     

On fundamental solutions for multivariate singular interpolation

The objective of this paper is to give a constructive approach to the solution of the fundamental functions for cardinal interpolation from a shift-invariant space generated by the (multi-)integer translates of some compactly supported function whose polynomial symbol has a non-empty zero set. This problem was first introduced by Chui, Diamond, and Raphael, where explicit solutions were given for various zero sets. Later, de Boor, Höllig, and Riemenschneider gave an existence proof for zero sets which are more general. In this paper, we give an integral representation of the fundamental solutions that can be made explicit in some cases and we will also give a growth condition of such fundamental solutions. The four-directional box splines will be used as an illustrative example.     

Evaluation of nondominated solution sets for k-objective optimization problems: An exact method and approximations

Integrated Preference Functional (IPF) is a set functional that, given a discrete set of points for a multiple objective optimization problem, assigns a numerical value to that point set. This value provides a quantitative measure for comparing different sets of points generated by solution procedures for difficult multiple objective optimization problems. We introduced the IPF for bi-criteria optimization problems in [Carlyle, W.M., Fowler, J.W., Gel, E., Kim, B., 2003. Quantitative comparison of approximate solution sets for bi-criteria optimization problems. Decision Sciences 34 (1), 63–82]. As indicated in that paper, the computational effort to obtain IPF is negligible for bi-criteria problems. For three or more objective function cases, however, the exact calculation of IPF is computationally demanding, since this requires k (⩾3) dimensional integration.In this paper, we suggest a theoretical framework for obtaining IPF for k (⩾3) objectives. The exact method includes solving two main sub-problems: (1) finding the optimality region of weights for all potentially optimal points, and (2) computing volumes of k dimensional convex polytopes. Several different algorithms for both sub-problems can be found in the literature. We use existing methods from computational geometry (i.e., triangulation and convex hull algorithms) to develop a reasonable exact method for obtaining IPF. We have also experimented with a Monte Carlo approximation method and compared the results to those with the exact IPF method.     

Two-dimensional orthogonal polynomials,their associated sets and the co-recursive sets

This paper deals with the general theory of sets of polynomials verifying a (d+1)-order recurrence. The cased=2 is specially carried out. First, we introduce the notion of associated set of a set of monic polynomials. A general formula for successive associated polynomials is given. The co-recursive sets of a two-dimensional orthogonal set are introduced. We calculate the corresponding formal Stieltjes functions.Finally, we determine the self-associated two-dimensional orthogonal sets and we show they are classical two-dimensional orthogonal sets, that is to say, their set of derivatives is also a two-dimensional orthogonal set.     

Images Réciproques D'ensembles Inévitables Par Les Applications Holomorphes De C Dans C

Unlike the one-dimensional case, when we deal with several complex variables, there exist entire one-to-one holomorphic maps with an identically equal to one jacobian, but with a non-dense range: the Fatou-Bieberbach maps (to simplify, we will call them Fatou-Bieberbach maps, even if there are not one-to-one). In Ref. [4], Gruman gave a sufficient density condition for a discrete set to be unavoidable and he constructed an explicit family of such sets $\{ E_a , a \in {\shadC} ^{*n} \} $ . Analogeously to Nevanlinna theory, he showed that the Fatou-Bieberbach maps intersect these sets with the same asymptotic frequency for a outside a pluripolar set. In the present paper, we generalise these estimates to any discrete set E verifying the sufficient density condition by giving a lower and an upper bound for the pre-image of E by a Fatou-Bieberbach map F in terms of the growth of the function.     

Linear sets on the projective line with complementary weights

Linear sets on the projective line have attracted a lot of attention because of their link with blocking sets, KM-arcs and rank-metric codes. In this paper, we study linear sets having two points of complementary weight, that is, with two points for which the sum of their weights equals the rank of the linear set. As a special case, we study those linear sets having exactly two points of weight greater than one, by showing new examples and studying their equivalence issue. Also, we determine some linearized polynomials defining the linear sets recently introduced by Jena and Van de Voorde [30].     

Two New Recurrent Levels for <Emphasis Type="Italic">C</Emphasis><Superscript>0</Superscript>-Flows

The central problem in dynamical systems is the asymptotic behavior or topological structure of the orbits. Nevertheless only orbits of points with certain recurrence and form a set of full measure are truly of importance. Of course, such a set is desired to be as small (in the sense of set inclusion) as possible. In this paper we discuss such two sets: the set of weakly almost periodic points and the set of quasi-weakly almost periodic points. While the two sets are different from each other by definitions, we prove that their closures both coincide with the measure center (or the minimal center of attraction) of the dynamical systems. Generally, a point may have three levels of orbit-structure: the support of an invariant measure generated by the point, its minimal center of attraction and its ω-limit set. We study the three levels of orbit-structure for weakly almost periodic points and quasi-weakly almost periodic points. We prove that quasi-weakly almost periodic points possess especially rich topological orbit-structures. We also present a necessary and sufficient condition for a point to belong to its own minimal center of attraction.     

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.     

Some properties of convex hulls of integer points contained in general convex sets

In this paper, we study properties of general closed convex sets that determine the closedness and polyhedrality of the convex hull of integer points contained in it. We first present necessary and sufficient conditions for the convex hull of integer points contained in a general convex set to be closed. This leads to useful results for special classes of convex sets such as pointed cones, strictly convex sets, and sets containing integer points in their interior. We then present a sufficient condition for the convex hull of integer points in general convex sets to be a polyhedron. This result generalizes the well-known result due to Meyer (Math Program 7:223–225, 1974). Under a simple technical assumption, we show that these sufficient conditions are also necessary for the convex hull of integer points contained in general convex sets to be a polyhedron.     

Robust registration of point sets using iteratively reweighted least squares

Registration of point sets is done by finding a rotation and translation that produces a best fit between a set of data points and a set of model points. We use robust M-estimation techniques to limit the influence of outliers, more specifically a modified version of the iterative closest point algorithm where we use iteratively re-weighed least squares to incorporate the robustness. We prove convergence with respect to the value of the objective function for this algorithm. A comparison is also done of different criterion functions to figure out their abilities to do appropriate point set fits, when the sets of data points contains outliers. The robust methods prove to be superior to least squares minimization in this setting.     

Locating and paired-dominating sets in graphs

In this paper, we continue the study of paired-domination in graphs introduced by Haynes and Slater [T.W. Haynes, P.J. Slater, Paired-domination in graphs, Networks 32 (1998), 199–206]. A paired-dominating set of a graph G with no isolated vertex is a dominating set S of vertices whose induced subgraph has a perfect matching. We consider paired-dominating sets which are also locating sets, that is distinct vertices of G are dominated by distinct subsets of the paired-dominating set. We consider three variations of sets which are paired-dominating and locating sets and investigate their properties.     

Stability results for properly quasi convex vector optimization problems

In this paper, we discuss the stability of the sets of (weak) minimal points and (weak) efficient points of vector optimization problems. Assuming that the objective functions are (strictly) properly quasi convex, and the data ofthe approximate problems converges to the data of the original problems in the sense of Painlevé–Kuratowski, we establish the Painlevé–Kuratowski set convergence of the sets of (weak) minimal points and (weak) efficient points of the approximate problems to the corresponding ones of original problem. Our main results improve and extend the results of the recent papers.     

Stability for Properly Quasiconvex Vector Optimization Problem

The aim of this paper is to study the stability aspects of various types of solution set of a vector optimization problem both in the given space and in its image space by perturbing the objective function and the feasible set. The Kuratowski?CPainlevé set-convergence of the sets of minimal, weak minimal and Henig proper minimal points of the perturbed problems to the corresponding minimal set of the original problem is established assuming the objective functions to be (strictly) properly quasi cone-convex.     

赋范线性空间中锥拟凸向量优化问题超有效解集的连通性

本文研究赋范线性空间中集值映射向量优化问题超有效解集的连通性问题．证明了目标映射为锥拟凸的向量优化问题的超有效解集是连通的．     

Saddle points and scalarizing sets in multiple objective linear programming

The main purpose of this paper is to study saddle points of the vector Lagrangian function associated with a multiple objective linear programming problem. We introduce three concepts of saddle points and establish their characterizations by solving suitable systems of equalities and inequalities. We deduce dual programs and prove a relationship between saddle points and dual solutions, which enables us to obtain an explicit expression of the scalarizing set of a given saddle point in terms of normal vectors to the value set of the problem. Finally, we present an algorithm to compute saddle points associated with non-degenerate vertices and the corresponding scalarizing sets.     

集值映射最优化问题的严有效解集的连通性及应用

本文对集值映射最优化问题引入严有效解的概念．证明了当目标函数为锥类凸的集值映射时,其目标空间里的严有效点集是连通的;若目标函数为锥凸的集值映射时,其严有效解集也是连通的．作为应用,讨论了超有效解集的连通性．     

Characterizations of strictly convex sets by the uniqueness of support points

Abstract

This short paper characterizes strictly convex sets by the uniqueness of support points (such points are called unique support points or exposed points) under appropriate assumptions. A class of so-called regular sets, for which every extreme point is a unique support point, is introduced. Closed strictly convex sets and their intersections with some other sets are shown to belong to this class. The obtained characterizations are then applied to set-valued maps and to the separation of a convex set and a strictly convex set. Under suitable assumptions, so-called set-valued maps with path property are characterized by strictly convex images of the considered set-valued map.