Theoretical insights into the augmented-neural-network approach for combinatorial optimization

The augmented-neural-network (AugNN) approach has been applied lately to some NP-Hard combinatorial problems, such as task scheduling, open-shop scheduling and resource-constraint project scheduling. In this approach the problem of search in the solution-space is transformed to a search in a weight-matrix space, much like in a neural-network approach. Some weight adjustment strategies are then used to converge to a good set of weights for a locally optimal solution. While empirical results have demonstrated the effectiveness of the AugNN approach vis-à-vis a few other metaheuristics, little theoretical insights exist which justify this approach and explain the effectiveness thereof. This paper provides some theoretical insights and justification for the AugNN approach through some basic theorems and also describes the algorithm and the formulation with the help of examples.     

On practical asymptotic stabilizability of switched affine systems

In this paper, we report some new results on practical asymptotic stabilizability of switched systems consisting of affine subsystems. We first briefly review some practical asymptotic stabilizability notions and some results from our previous papers. Then we propose a new approach to estimate the region of attraction for switched affine systems. Based on this new approach, we present several new sufficient conditions for the practical asymptotic stabilizability and global practical asymptotic stabilizability of such systems. Finally, a computational approach to check the new sufficient conditions is proposed and it is applied to several numerical examples.     

New insights on permutation approach for hypothesis testing on functional data

The permutation approach for testing the equality of distributions and thereby comparing two populations of functional data has recently received increasing attention thanks to the flexibility of permutation tests to handle complex testing problems. The purpose of this work is to present some new insights in the context of nonparametric inference on functional data using the permutation approach, more specifically we formally show the equivalence of some permutation procedures proposed in the literature and we suggest the use of the permutation and combination-based approach within the basis function approximation layout. Validation of theoretical results is shown by simulation studies.     

Lagrangian Duality and Cone Convexlike Functions

In this paper, we consider first the most important classes of cone convexlike vector-valued functions and give a dual characterization for some of these classes. It turns out that these characterizations are strongly related to the closely convexlike and Ky Fan convex bifunctions occurring within minimax problems. Applying the Lagrangian perturbation approach, we show that some of these classes of cone convexlike vector-valued functions show up naturally in verifying strong Lagrangian duality for finite-dimensional optimization problems. This is achieved by extending classical convexity results for biconjugate functions to the class of so-called almost convex functions. In particular, for a general class of finite-dimensional optimization problems, strong Lagrangian duality holds if some vector-valued function related to this optimization problem is closely K-convexlike and satisfies some additional regularity assumptions. For K a full-dimensional convex cone, it turns out that the conditions for strong Lagrangian duality simplify. Finally, we compare the results obtained by the Lagrangian perturbation approach worked out in this paper with the results achieved by the so-called image space approach initiated by Giannessi.     

Zygmund functions on the real line and quasiconformal deformations

By a complex approach, we obtain some results concerning Zygmund functions on the real line, which corresponds to some classical results about Zygmund functions on the unit circle.     

Positivity and stability of the essential spectrum for singular transport semigroups with non-vacuum boundary conditions

In this paper we prove some compactness results for a large class of singular transport equations. Our approach relies on some comparison results for positive operators. Our results extend and complete several earlier works. We also provide simpler proofs for several known results in the literature.     

Global attracting set,exponential stability and stability in distribution of SPDEs with jumps

A novel approach to the global attracting sets of mild solutions for stochastic functional partial differential equations driven by Lévy noise is presented. Consequently, some new sufficient conditions ensuring the existence of the global attracting sets of mild solutions for the considered equations are established. As applications, some new criteria for the exponential stability in mean square of the considered equations is obtained. Subsequently, by employing a weak convergence approach, we try to establish some stability conditions in distribution of the segment processes of mild solutions to stochastic delay partial differential equations with jumps under some weak conditions. Some known results are improved. Lastly, some examples are investigated to illustrate the theory.     

Large sets of t-designs through partitionable sets: A survey

The method of partitionable sets for constructing large sets of t-designs have now been used for nearly a decade. The method has resulted in some powerful recursive constructions and also existence results especially for large sets of prime sizes. Perhaps the main feature of the approach is its simplicity. In this paper, we describe the approach and show how it is employed to obtain some of the recursive theorems. We also review the existence results and recursive constructions which have been found by this method.     

中立型随机泛函微分方程的均方指数稳定性

本文使用一类新方法研究中立型随机泛函微分方程的均方指数稳定性.由此,一些新的关于所考虑的方程解的均方指数稳定性结果被获得,一些已有的结果被改进.最后通过分析一些实例阐述了我们获得的理论的有效性.     

A boundary element method for the Dirichlet eigenvalue problem of the Laplace operator

The solution of eigenvalue problems for partial differential operators by using boundary integral equation methods usually involves some Newton potentials which may be resolved by using a multiple reciprocity approach. Here we propose an alternative approach which is in some sense equivalent to the above. Instead of a linear eigenvalue problem for the partial differential operator we consider a nonlinear eigenvalue problem for an associated boundary integral operator. This nonlinear eigenvalue problem can be solved by using some appropriate iterative scheme, here we will consider a Newton scheme. We will discuss the convergence and the boundary element discretization of this algorithm, and give some numerical results.     

Existence of Solutions for Nonlinear Implicit Differential Equations: An Equilibrium Problem Approach

In this article, we study the existence of solutions for nonlinear implicit differential equations associated to a time-dependent pseudomonotone (respectively, quasimonotone) operator by using a new approach based on the theory of equilibrium \hboxproblems. More precisely, we first establish some existence results of solutions for mixed equilibrium problems where the \hboxbifunctions are, respectively, maximal monotone and \hboxpseudomonotone (quasimonotone) in the topological sense. Then, we write the nonlinear implicit differential equations in the form of a mixed equilibrium problem. By using the existence results for mixed equilibrium problems, we establish the existence of solutions of nonlinear implicit differential equations. This new approach provides some new and nice results which improve and unify most of the recent results obtained in this direction.     

A new method for solving a system of generalized nonlinear variational inequalities in Banach spaces

The purpose of this paper is by using the generalized projection approach to introduce an iterative scheme for finding a solution to a system of generalized nonlinear variational inequality problem. Under suitable conditions, some existence and strong convergence theorems are established in uniformly smooth and strictly convex Banach spaces. The results presented in the paper improve and extend some recent results.     

Completeness, Sections and Selections

In this paper, we develop a general approach to set-valued semi-continuous selections which is based on order-like arguments rather than on classical approximations. The approach works nice in a number of situations demonstrating the genesis of such selection properties of set-valued mappings. In particular, it allows to generalize several known results, also to get some new results about sections of set-valued mappings.      

Subharmonic solutions for a class of non-quadratic second order Hamiltonian systems

In this paper, some existence theorems are obtained for infinitely subharmonic solutions of second order Hamiltonian systems under non-quadratic conditions. The approach is the minimax principle. Our results greatly extend and improve some known results.     

Analysis of multiobjective decision problems by the indifference band approach

A new approach, based on indifference band, for analyzing problems with multiple objectives is described. The relations of this approach to some previous results are given. Methods for generating nondominated solutions are supplied.     

New Scalarizing Approach to the Stability Analysis in Parametric Generalized Ky Fan Inequality Problems

This paper gives sufficient conditions for the upper and lower semicontinuities of the solution mapping of a parametric mixed generalized Ky Fan inequality problem. We use a new scalarizing approach quite different from traditional linear scalarization approaches which, in the framework of the stability analysis of solution mappings of equilibrium problems, were useful only for weak vector equilibrium problems and only under some convexity and strict monotonicity assumptions. The main tools of our approach are provided by two generalized versions of the nonlinear scalarization function of Gerstewitz. Our stability results are new and are obtained by a unified technique. An example is given to show that our results can be applied, while some corresponding earlier results cannot.     

Flow Search Approach and New Bounds for the m-Step Linear Conjugate Gradient Algorithm

A flow search approach is presented in this paper. In the approach, each iterative process involves a subproblem, whose variables are the stepsize parameters. Every feasible solution of the subproblem corresponds to some serial search stages, the stepsize parameters in different search stages may interact mutually, and their optimal values are determined by evaluating the total effect of the interaction. The main idea of the flow search approach is illustrated via the minimization of a convex quadratic function. Based on the flow search approach, some properties of the m-step linear conjugate gradient algorithm are analyzed and new bounds on its convergence rate are also presented. Theoretical and numerical results indicate that the new bounds are better than the well-known ones.     

研究二元样条空间维数的Blossoming方法

本文综述了研究二元样条的Ｂｌｏｓｓｏｍｉｎｇ方法．成功地重建了平面上贯穿剖分的维数公式．而且利用这种方法，对定义在Ｍｏｒｇａｎ－Ｓｃｏｔ剖分上样条空间的维数取得了一些新的结果．     

Polygonal chain approximation: a query based approach

In this paper we present a new, query based approach for approximating polygonal chains in the plane. We give a few results based on this approach, some of more general interest, and propose a greedy heuristic to speed up the computation. Our algorithms are simple, based on standard geometric operations, and thus suitable for efficient implementation. We also show that the query based approach can be used to obtain a subquadratic time exact algorithm with infinite beam criterion and Euclidean distance metric if some condition on the input path holds. Although in a special case, this is the first subquadratic result for path approximation with Euclidean distance metric.     

Cutting-plane theory: Algebraic methods

This paper is a survey, with new results, of the algebraic approach to cutting-planes. The new results are a subadditive dual program for integer programs, and a generalization of R. Gomory's linear inequality characterization of the cuts valid for the group problem. We also provide some results on the large family of alternate group problems, in addition to the one group problem that is conventionally thought of in connection with the algebraic approach. In terms of expository material, we shall provide very concise proofs of the most well-known results in the basic papers of the algebraic approach. (Note: This is a revision of Part I of MSRR no. 370).