Multiple Order Pick Sequencing in a Carousel System: A Solvable Case of the Rural Postman Problem

We consider the problem of sequencing picks in a set of orders on a single carousel. First we consider the situation in which the sequence of the orders is given. For this problem we present an efficient dynamic programming algorithm. Second, we consider the problem without a given order sequence. We simplify this problem to a Rural Postman Problem on a circle and solve this problem to optimality. Finally, we show that the solution of the Rural Postman Problem requires at most 1.5 revolutions more than a lower bound of an optimum solution to the original problem.     

抽象经济均衡问题解的存在性及其算法

本文首先研究一类新的向量均衡问题,利用截口定理与KKM定理两种不同的工具证明此类均衡问题解的存在性,接着,把这类向量均衡问题推广到更为一般的情形,随后讨论了具有上下界的均衡问题,它是由Isac,Sehgal和Singh于1999年提出的一个公开问题,本文在一定条件下获得了一个新的解的存在性定理,并构造了一个迭代算法,讨论了算法的收敛性。     

Solving some optimal path planning problems using an approach based on measure theory

In this paper we solve a collection of optimal path planning problems using a method based on measure theory. First we consider the problem as an optimization problem and then we convert it to an optimal control problem by defining some artificial control functions. Then we perform a metamorphosis in the space of problem. In fact we define an injection between the set of admissible pairs, containing the control vector function and a collision-free path defined on free space and the space of positive Radon measures. By properties of this kind of measures we obtain a linear programming problem that its solution gives rise to constructing approximate optimal trajectory of the original problem. Some numerical examples are proposed.     

An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem

In this paper we consider low-rank semidefinite programming (LRSDP) relaxations of combinatorial quadratic problems that are equivalent to the maxcut problem. Using the Gramian representation of a positive semidefinite matrix, the LRSDP problem can be formulated as the nonconvex nonlinear programming problem of minimizing a quadratic function with quadratic equality constraints. For the solution of this problem we propose a continuously differentiable exact merit function that exploits the special structure of the constraints and we use this function to define an efficient and globally convergent algorithm. Finally, we test our code on an extended set of instances of the maxcut problem and we report comparisons with other existing codes.     

Periodic Solutions for Second Order Differential Inclusions with Nonconvex and Unbounded Multifunction

In this paper we consider a second order multivalued periodic boundary value problem with a nonconvex and unbounded orientor field (set-valued vector field). Using a directionally continuous selector, through its Filippov regularization we produce a convex-valued, bounded multifunction and with this as orientor field we introduce a new multivalued periodic problem. Using the Leray-Schauder principle, we solve the convex problem and then we show that its solutions also solve the original nonconvex problem.     

Conformable fractional Sturm‐Liouville equation

In this article, we discuss a conformable fractional Sturm‐Liouville boundary‐value problem. We prove an existence and uniqueness theorem for this equation and formulate a self‐adjoint boundary value problem. We also construct the associated Green function of this problem, and we give the eigenfunction expansions. Finally, we will give some examples.     

移动通信系统中的最优功率控制算法

本文研究了移动通信系统中的功率最优控制问题.我们首先将这一个工程问题转化为最大可满足线性不等式组问题的一个特殊情形,然后通过对这个组合优化问题的最优解的性质研究,给出了求解该问题的多项式时间算法.     

Monotone operator theory in convex optimization

In this paper, we establish tractable sum of squares characterizations of the containment of a convex set, defined by a SOS-concave matrix inequality, in a non-convex set, defined by difference of a SOS-convex polynomial and a support function, with Slater’s condition. Using our set containment characterization, we derive a zero duality gap result for a DC optimization problem with a SOS-convex polynomial and a support function, its sum of squares polynomial relaxation dual problem, the semidefinite representation of this dual problem, and the dual problem of the semidefinite programs. Also, we present the relations of their solutions. Finally, through a simple numerical example, we illustrate our results. Particularly, in this example we find the optimal solution of the original problem by calculating the optimal solution of its associated semidefinite problem.     

Multiphysics mixed finite element method with Nitsche's technique for Stokes-poroelasticity problem

In this article, we propose a multiphysics mixed finite element method with Nitsche's technique for Stokes-poroelasticity problem. Firstly, we reformulate the poroelasticity part of the original problem by introducing two pseudo-pressures to into a “fluid–fluid” coupled problem so that we can use the classical stable finite element pairs to deal with this problem conveniently. Then, we prove the existence and uniqueness of weak solution of the reformulated problem. And we use Nitsche's technique to approximate the coupling condition at the interface to propose a loosely-coupled time-stepping method to solve three subproblems at each time step–a Stokes problem, a generalized Stokes problem and a mixed diffusion problem. And the proposed method does not require any restriction on the choice of the discrete approximation spaces on each side of the interface provided that appropriate quadrature methods are adopted. Also, we give the stability analysis and error estimates of the loosely-coupled time-stepping method. Finally, we give the numerical tests to show that the proposed numerical method has a good stability and no “locking” phenomenon.     

A partially observable decision problem under a shifted likelihood ratio ordering

In this paper, we discuss a partially observable sequential decision problem under a shifted likelihood ratio ordering. Since we employ the Bayes' theorem for the learning procedure, we treat this problem under several assumptions. Under these assumptions, we obtain some fundamental results about the relation between prior and posterior information. We also consider an optimal stopping problem for this partially observable Markov decision process.     

First kind symmetric periodic solutions and their stability for the Kepler problem and anisotropic Kepler problem plus generalized anisotropic perturbation

Motivated by some problems in Celestial Mechanics that combines quasihomogeneous potential in the anisotropic space, we investigate the existence of several families of first kind symmetric periodic solutions for a family of planar perturbed Kepler problem. In addition, we give sufficient conditions for the existence of first kind periodic solutions and also we characterize its type of stability. As an application of this general situation, we discuss the existence of symmetric periodic solutions for the anisotropic Kepler problem plus a generalized anisotropic perturbation, (shortly, p-AKPQ problem) and for the Kepler problem plus a generalized anisotropic perturbation (shortly, p-KPQ problem), as continuation of circular orbits of the two-dimensional Kepler problem. To get this objective, we consider different types of perturbations and then we apply our main result.     

二阶非线性椭圆型方程带位移的边值问题

In this paper, we consider the boundary value problem with the shift for nonlinear uniformly elliptic equations of second order in a multiply connected domain. For this sake, we propose a modified boundary value problem for nonlinear elliptic systems of first order equations, and give a priori estimates of solutions for the modified boundary value problem. Afterwards we prove by using the Schauder fixedpoint theorem that this boundary value problem with some conditions has a solution. The result obtained is the generlization of the corresponding theorem on the Poincare boundary value problem.     

Simultaneous Subgradient Algorithms for the Generalized Split Variational Inclusion Problem in Hilbert Spaces

In this article, we study the generalized split variational inclusion problem. For this purpose, motivated by the projected Landweber algorithm for the split equality problem, we first present a simultaneous subgradient extragradient algorithm and give related convergence theorems for the proposed algorithm. Next, motivated by the alternating CQ-algorithm for the split equality problem, we propose another simultaneous subgradient extragradient algorithm to study the general split variational inclusion problem. As applications, we consider the split equality problem, split feasibility problem, split variational inclusion problem, and variational inclusion problem in Hilbert spaces.     

Numerical transformation methods: Blasius problem and its variants

Blasius problem is the simplest nonlinear boundary-layer problem. We hope that any approach developed for this epitome can be extended to more difficult hydrodynamics problems. With this motivation we review the so called Töpfer transformation, which allows us to find a non-iterative numerical solution of the Blasius problem by solving a related initial value problem and applying a scaling transformation. The applicability of a non-iterative transformation method to the Blasius problem is a consequence of its partial invariance with respect to a scaling group. Several problems in boundary-layer theory lack this kind of invariance and cannot be solved by non-iterative transformation methods. To overcome this drawback, we can modify the problem under study by introducing a numerical parameter, and require the invariance of the modified problem with respect to an extended scaling group involving this parameter. Then we apply initial value methods to the most recent developments involving variants and extensions of the Blasius problem.     

Properties and methods for finding the best rank-one approximation to higher-order tensors

The problem of finding the best rank-one approximation to higher-order tensors has extensive engineering and statistical applications. It is well-known that this problem is equivalent to a homogeneous polynomial optimization problem. In this paper, we study theoretical results and numerical methods of this problem, particularly focusing on the 4-th order symmetric tensor case. First, we reformulate the polynomial optimization problem to a matrix programming, and show the equivalence between these two problems. Then, we prove that there is no duality gap between the reformulation and its Lagrangian dual problem. Concerning the approaches to deal with the problem, we propose two relaxed models. The first one is a convex quadratic matrix optimization problem regularized by the nuclear norm, while the second one is a quadratic matrix programming regularized by a truncated nuclear norm, which is a D.C. function and therefore is nonconvex. To overcome the difficulty of solving this nonconvex problem, we approximate the nonconvex penalty by a convex term. We propose to use the proximal augmented Lagrangian method to solve these two relaxed models. In order to obtain a global solution, we propose an alternating least eigenvalue method after solving the relaxed models and prove its convergence. Numerical results presented in the last demonstrate, especially for nonpositive tensors, the effectiveness and efficiency of our proposed methods.     

Heterogeneous time-harmonic Maxwell equations in bidimensional domains

This note deals with the low-frequency time-harmonic Maxwell equations for a heterogeneous media in bidimensional bounded domains. We propose a three step method to solve this problem. First, we construct an extension of the boundary data solving a scalar Neumann problem for the Laplace operator. Second, we solve a problem in the conductor with an unusual boundary condition of nonlocal type. Third, we solve a boundary value problem in the insulator using the solution calculated in the conductor. Also, this third problem can be reduced to a Neumann problem for the Laplace operator.     

Some remarks on the dynamics of cell membranes

Motivated by the desire to model the entry of 1,25D into a cell by receptor mediated endocytosis, we have formulated the problem as the dynamics of a bilayer membrane. We have discussed setting the problem as a variational problem using the Helfrich modeling of the bilayer in terms of the free energy. Using a Lagrangian formulation we arrive at the Euler–Lagrange equations for the system. The model we have used depends on the amount of reagent in the neighborhood of the upper membrane. The problem thereby reduces to a moving boundary problem, which is dependent on a diffusion equation for a region changing with time. In order to solve this problem we seek the correct Neumann function for this altered. This is accomplished by deriving a Hadamard variational formula for the diffusion equation. We also offer an iterative procedure for solving this non-linear problem.     

On approximating the nearest Ω‐stable matrix

In this paper, we consider the problem of approximating a given matrix with a matrix whose eigenvalues lie in some specific region Ω of the complex plane. More precisely, we consider three types of regions and their intersections: conic sectors, vertical strips, and disks. We refer to this problem as the nearest Ω‐stable matrix problem. This includes as special cases the stable matrices for continuous and discrete time linear time‐invariant systems. In order to achieve this goal, we parameterize this problem using dissipative Hamiltonian matrices and linear matrix inequalities. This leads to a reformulation of the problem with a convex feasible set. By applying a block coordinate descent method on this reformulation, we are able to compute solutions to the approximation problem, which is illustrated on some examples.     

Pompeiu Problem on Product of Heisenberg Groups

In this paper, we address the Pompeiu problem for a product of Heisenberg groups. We consider this problem both for cases of a ball and for a bidisk. Furthermore, we address this problem for a product of the Heisenberg group with Euclidean space.     

A general filter regularization method to solve the three dimensional Cauchy problem for inhomogeneous Helmholtz-type equations: Theory and numerical simulation

In this paper, we solve the Cauchy problem for an inhomogeneous Helmholtz-type equation with homogeneous Dirichlet and Neumann boundary condition. The proposed problem is ill-posed. Up to now, most investigations on this topic focus on very specific cases, and with Dirichlet boundary condition. Recently, we solve this problem in 2D for an inhomogeneous modified Helmholtz equation (2012). This work is a continuous expansion of our previous results. Herein we introduce a general filter regularization (GFR) method, and then from the GFR we deduce two concrete filters, which are a foundation to implement a numerical procedure. In addition, we develop a numerical model for solving this problem in three dimensional region. The proposed filter method has been verified by numerical experiments.