Optimality and duality for nondifferentiable multiobjective variational problems

The concept of efficiency is used to formulate duality for nondifferentiable multiobjective variational problems. Wolfe and Mond-Weir type vector dual problems are formulated. By using the generalized Schwarz inequality and a characterization of efficient solution, we established the weak, strong, and converse duality theorems under generalized (F,ρ)-convexity assumptions.     

Characterization of vector strict global minimizers of order 2 in differentiable vector optimization problems under a new approximation method

In this paper, a new approximation method is introduced to characterize a so-called vector strict global minimizer of order 2 for a class of nonlinear differentiable multiobjective programming problems with (F,ρ)-convex functions of order 2. In this method, an equivalent vector optimization problem is constructed by a modification of both the objectives and the constraint functions in the original multiobjective programming problem at the given feasible point. In order to prove the equivalence between the original multiobjective programming problem and its associated F-approximated vector optimization problem, the suitable (F,ρ)-convexity of order 2 assumption is imposed on the functions constituting the considered vector optimization problem.     

On a Heilbronn-type problem

Let F be a convex figure with area |F| and let G(n,F) denote the smallest number such that from any n points of F we can get G(n,F) triangles with areas less than or equal to |F|/4. In this article, to generalize some results of Soifer, we will prove that for any triangle T, G(5,T)=3; for any parallelogram P, G(5,P)=2; for any convex figure F, if S(F)=6, then G(6,F)=4.     

A travelling salesman approach to solve the F/no-idle/Cmax problem

This paper investigates the F/no-idle/C_max problem, where machines work continuously without idle time intervals. The idle characteristic is a very strong constraint and it affects seriously the value of C_max criterion. We treat here only the permutation flow-shop configuration for machine no-idle problems with the objective to minimise the makespan. Based on the idea that this problem can be modelled as a travelling salesman problem, an adaptation of the well-known nearest insertion rule is proposed to solve it. A computational study shows the result quality.     

Domination problem for narrow orthogonally additive operators

The “Up-and-down” theorem which describes the structure of the Boolean algebra of fragments of a linear positive operator is the well known result in operator theory. We prove an analog of this theorem for a positive abstract Uryson operator defined on a vector lattice and taking values in a Dedekind complete vector lattice. This result is used to prove a theorem of domination for order narrow positive abstract Uryson operators from a vector lattice E to a Banach lattice F with an order continuous norm.     

Contraction mappings in interval analysis

Under certain conditions, the contraction mapping fixed point theorem guarantees the convergence of the iterationx _i+1=f(x _i ) toward a fixed point of the functionf:R ⁿ →R ⁿ. When an interval extensionF off is used in a similar iteration scheme to obtain a sequence of interval vectors these conditions need not provide convergence to a degenerate interval vector representing the fixed point, even if the width of the initial interval vector is chosen arbitrarily small. We give a sufficient condition on the extensionF in order that the convergence is guaranteed. The centered form of Moore satisfies this condition.     

Abelian extensions of topological vector groups

The possibility of endowing an Abelian topological group G with the structure of a topological vector space when a subgroup F of G and the quotient group $\text{G}\text{F}$ are topological vector groups is investigated. It is shown that, if F is a real Fréchet group and $\text{G}\text{F}$ a complete metrizable real vector group, then G is a complete metrizable real vector group. This result is of particular interest if $\text{G}\text{F}$ is finite dimensional or if F is one dimensional and $\text{G}\text{F}$ a separable Hilbert group.     

A problem on conjugacy of matrices

Let F be an infinite field and n?12. Then the number of conjugacy classes of the upper triangular nilpotent matrices in M_n(F) under action by the subgroup of GL_n(F) consisting of all the upper triangular matrices is infinite.     

An extremal problem for operators

Let A be a Banach algebra, F a compact set in the complex plane, and h a function holomorphic in some neighborhood of the set F. Thus h(a) is meaningful for each element a ε A whose spectrum σ(a) is contained in F, and it is possible to evaluate the norm |h(a)|. Problem: Compute the supremum of the norms |h(a) as a ranges over all elements of A with spectrum contained in F and whose norm does not exceed one; that is, compute sup{|h(a)|; a ε A, σ(a) ⊂ F, |a| ⩽ 1}. This problem was first formulated and treated by the author in the particular case where A is the algebra of all linear operators on a finite-dimensional Hilbert space and F is the disc {z; |z| ⩽ r} for a given positive number r<1. The paper discusses motivation, connections with complex function theory, convergence of iterative processes, critical exponents, and the infinite companion matrix.     

Second order mixed type duality in multiobjective programming problems

Second order mixed type dual is introduced for multiobjective programming problems. Results about weak duality, strong duality, and strict converse duality are established under generalized second order (F,ρ)-convexity assumptions. These results generalize the duality results recently given by Aghezzaf and Hachimi involving generalized first order (F,ρ)-convexity conditions.     

A fast approximation algorithm for the multicovering problem

The multicovering problem is: MIN cx subject to Ax≥b, xϵ{0, 1}ⁿ, where A is a matrix whose elements are all zero or one and b is a vector of positive integers. We present a fast heuristic for this important class of problems and analyze its worst-case performance: the ratio of the heuristic value to the optimum does not exceed the maximum row sum of the matrix A. The heuristic algorithm also provides a feasible dual solution vector that is useful in generating lower bounds on the value of the optimum.     

Fundamental solution for linear two-point boundary value problem

The quadratic functional minimization with differential restrictions represented by the command linear systems is considered. The optimal solution determination implies the solving of a linear problem with two points boundary values. The proposed method implies the construction of a fundamental solution S(t)—a n×n matrix—and of a vector h(t) defining an adjoint variable λ(t) depending of the state variable x(t). From the extremum necessary conditions it is obtained the Riccati matrix differential equation having the S(t) as unknown fundamental solution is obtained. The paper analyzes the existence of the Riccati equation solution S(t) and establishes as the optimal solution of the proposed optimum problem. Also a superior limit of the minimum for the considered quadratic functionals class are evaluated.     

Modification of a Finsler space by a normalized semi-parallel vector field

LetF _n be a Finsler space with metric functionF(x, y). M. Matsumoto [6] has defined a modified Finsler spaceF _n ^* whose metric functionF ^*(x, y) is given byF ^*2 = = F² + (X_i(x)yⁱ)², whereX _i are the components of a covariant vector which is a function of coordintae only. Since a concurrent vector is a function of coordinate only, Matsumoto and Eguchi [9] have studied various properties of the modified Finsler spaceF _n ^* under the assumption thatX _i are the components of a concurrent vector field inF _n. In this paper we shall introduce the concept of semi-parallel vector field inF _n and study the properties of modified Finsler spaceF _n ^* .     

Additive operators preserving rank-additivity on symmetry matrix spaces

We characterize the additive operators preserving rank-additivity on symmetry matrix spaces. LetS _n(F) be the space of alln×n symmetry matrices over a fieldF with 2,3 ∈F ^*, thenT is an additive injective operator preserving rank-additivity onS _n(F) if and only if there exists an invertible matrixU∈M _n(F) and an injective field homomorphism ? ofF to itself such thatT(X)=cUX ^?U^T, ?X=(x_ij)∈S_n(F) wherec∈F ^*,X ^?=(?(x _ij)). As applications, we determine the additive operators preserving minus-order onS _n(F) over the fieldF.     

On polyvectors of vector spaces and hyperplanes of projective Grassmannians

We investigate relationships between polyvectors of a vector space V, alternating multilinear forms on V, hyperplanes of projective Grassmannians and regular spreads of projective spaces. Suppose V is an n-dimensional vector space over a field F and that A_n-1,k(F) is the Grassmannian of the (k − 1)-dimensional subspaces of PG(V) (1  ? k ? n − 1). With each hyperplane H of A_n-1,k(F), we associate an (n − k)-vector of V (i.e., a vector of ∧^n−kV) which we will call a representative vector of H. One of the problems which we consider is the isomorphism problem of hyperplanes of A_n-1,k(F), i.e., how isomorphism of hyperplanes can be recognized in terms of their representative vectors. Special attention is paid here to the case n = 2k and to those isomorphisms which arise from dualities of PG(V). We also prove that with each regular spread of the projective space PG(2k-1,F), there is associated some class of isomorphic hyperplanes of the Grassmannian A_2k-1,k(F), and we study some properties of these hyperplanes. The above investigations allow us to obtain a new proof for the classification, up to equivalence, of the trivectors of a 6-dimensional vector space over an arbitrary field F, and to obtain a classification, up to isomorphism, of all hyperplanes of A_5,3(F).     

Linear maps preserving M–P inverses of matrices between matrix spaces over fields

Suppose F is a field of characteristic not 2. Let n and m be two arbitrary positive integers with n≥2. We denote by M _n (F) and S _n (F) the space of n×n full matrices and the space of n×n symmetric matrices over F, respectively. All linear maps from S _n (F) to M _m (F) preserving M–P inverses of matrices are characterized first, and thereby all linear maps from S _n (F) (M _n (F)) to S _m (F) (M _m (F)) preserving M–P inverses of matrices are characterized, respectively.     

On the Gaussian approximation of vector-valued multiple integrals

By combining the findings of two recent, seminal papers by Nualart, Peccati and Tudor, we get that the convergence in law of any sequence of vector-valued multiple integrals F_n towards a centered Gaussian random vector N, with given covariance matrix C, is reduced to just the convergence of: (i) the fourth cumulant of each component of F_n to zero; (ii) the covariance matrix of F_n to C. The aim of this paper is to understand more deeply this somewhat surprising phenomenon. To reach this goal, we offer two results of a different nature. The first one is an explicit bound for d(F,N) in terms of the fourth cumulants of the components of F, when F is a R^d-valued random vector whose components are multiple integrals of possibly different orders, N is the Gaussian counterpart of F (that is, a Gaussian centered vector sharing the same covariance with F) and d stands for the Wasserstein distance. The second one is a new expression for the cumulants of F as above, from which it is easy to derive yet another proof of the previously quoted result by Nualart, Peccati and Tudor.     

The eigenvalue problem for linear and affine iterated function systems

The eigenvalue problem for a linear function L centers on solving the eigen-equation . This paper generalizes the eigenvalue problem from a single linear function to an iterated function system F consisting of possibly an infinite number of linear or affine functions. The eigen-equation becomes F(X)=λX, where λ>0 is real, X is a compact set, and F(X)=?_f∈Ff(X). The main result is that an irreducible, linear iterated function system F has a unique eigenvalue λ equal to the joint spectral radius of the functions in F and a corresponding eigenset S that is centrally symmetric, star-shaped, and full dimensional. Results of Barabanov and of Dranisnikov-Konyagin-Protasov on the joint spectral radius follow as corollaries.     

Ground state estimations in gauge theory

The lowest eigenvalue λ(F) of a vector bundle F over a compact Riemannian manifold M is estimated in terms of the curvature of M and of the connection Γ on F.     

Domination problem for AM-compact abstract Uryson operators

The Boolean algebra of fragments of a positive abstract Uryson operator recently was described in M. Pliev (Positivity, doi:10.1007/s11117-016-0401-9, 2016). Using this result, we prove a theorem of domination for AM-compact positive abstract Uryson operators from a Dedekind complete vector lattice E to a Banach lattice F with an order continuous norm.