Nonlocal problem with integral conditions for a system of hyperbolic equations in characteristic rectangle

We consider a nonlocal problem with integral conditions for a system of hyperbolic equations in rectangular domain. We investigate the questions of existence of unique classical solution to the problemunder consideration and approaches of its construction. Sufficient conditions of unique solvability to the investigated problem are established in the terms of initial data. The nonlocal problem with integral conditions is reduced to an equivalent problem consisting of the Goursat problem for the system of hyperbolic equations with functional parameters and functional relations. We propose algorithms for finding a solution to the equivalent problem with functional parameters on the characteristics and prove their convergence. We also obtain the conditions of unique solvability to the auxiliary boundary-value problem with an integral condition for the system of ordinary differential equations. As an example, we consider the nonlocal boundary-value problem with integral conditions for a two-dimensional system of hyperbolic equations.     

On the well-posedness of periodic problems for the system of hyperbolic equations with finite time delay

A periodic problem for the system of hyperbolic equations with finite time delay is investigated. The investigated problem is reduced to an equivalent problem, consisting the family of periodic problems for a system of ordinary differential equations with finite delay and integral equations using the method of a new functions introduction. Relationship of periodic problem for the system of hyperbolic equations with finite time delay and the family of periodic problems for the system of ordinary differential equations with finite delay is established. Algorithms for finding approximate solutions of the equivalent problem are constructed, and their convergence is proved. Criteria of well-posedness of periodic problem for the system of hyperbolic equations with finite time delay are obtained.     

A study of mixed discrete bilevel programs using semidefinite and semi-infinite programming

In this paper, we study the bilevel programming problem with discrete polynomial lower level problem. We start by transforming the problem into a bilevel problem comprising a semidefinite program (SDP for short) in the lower level problem. Then, we are able to deduce some conditions of existence of solutions for the original problem. After that, we again change the bilevel problem with SDP in the lower level problem into a semi-infinite program. With the aid of the exchange technique, for simple bilevel programs, an algorithm for computing a global optimal solution is suggested, the convergence is shown, and a numerical example is given.     

Error estimates for shooting methods in two-point boundary value problems for second-order equations

This paper is concerned with a procedure for estimating the global discretization error arising when a boundary value problem for a system of second order differential equations is solved by the simple shooting method, without transforming the original problem in an equivalent first order problem. Expressions of the global discretization error are derived for both linear and nonlinear boundary value problems, which reduce the error estimation for a boundary value problem to that for an initial value problem of same dimension. The procedure extends to second order equations a technique for global error estimation given elsewhere for first order equations. As a practical result the accuracy of the estimates for a second order problem is increased compared with the estimates for the equivalent first order problem.     

一些约束规划问题的近似全局最优解

首先将一个具有多个约束的规划问题转化为一个只有一个约束的规划问题,然后通过利用这个单约束的规划问题,对原来的多约束规划问题提出了一些凸化、凹化的方法,这样这些多约束的规划问题可以被转化为一些凹规划、反凸规划问题．最后,还证明了得到的凹规划和反凸规划的全局最优解就是原问题的近似全局最优解．     

Single machine stochastic JIT scheduling problem subject to machine breakdowns

In this paper we research the single machine stochastic JIT scheduling problem subject to the machine breakdowns for preemptive-resume and preemptive-repeat.The objective function of the problem is the sum of squared deviations of the job-expected completion times from the due date.For preemptive-resume,we show that the optimal sequence of the SSDE problem is V-shaped with respect to expected processing times.And a dynamic programming algorithm with the pseudopolynomial time complexity is given.We discuss the difference between the SSDE problem and the ESSD problem and show that the optimal solution of the SSDE problem is a good approximate optimal solution of the ESSD problem,and the optimal solution of the SSDE problem is an optimal solution of the ESSD problem under some conditions.For preemptive-repeat,the stochastic JIT scheduling problem has not been solved since the variances of the completion times cannot be computed.We replace the ESSD problem by the SSDE problem.We show that the optimal sequence of the SSDE problem is V-shaped with respect to the expected occupying times.And a dynamic programming algorithm with the pseudopolynomial time complexity is given.A new thought is advanced for the research of the preemptive-repeat stochastic JIT scheduling problem.     

A hybrid method for multidimensional scaling using city-block distances

The problem of multidimensional scaling with city-block distances in the embedding space is reduced to a two level optimization problem consisting of a combinatorial problem at the upper level and a quadratic programming problem at the lower level. A hybrid method is proposed combining randomized search for the upper level problem with a standard quadratic programming algorithm for the lower level problem. Several algorithms for the combinatorial problem have been tested and an evolutionary global search algorithm has been proved most suitable. An experimental code of the proposed hybrid multidimensional scaling algorithm is developed and tested using several test problems of two- and three-dimensional scaling.     

An Algorithm for the 0-1 Equality Knapsack Problem

The 0-1 knapsack problem is a linear integer-programming problem with a single constraint and binary variables. The knapsack problem with an inequality constraint has been widely studied, and several efficient algorithms have been published. We consider the equality-constraint knapsack problem, which has received relatively little attention. We describe a branch-and-bound algorithm for this problem, and present computational experience with up to 10,000 variables. An important feature of this algorithm is a least-lower-bound discipline for candidate problem selection.     

具有未知源的某些非线性伪抛物型方程的反问题

考 虑具有未 知源项的 某些非 线性伪 抛物 型方程 的反演 问题． 首先 将伪抛 物型 方程初 边值问 题化为非线 性发展方 程 Ｃｏｕｃｈ ｙ 问题,然 后,利用半 群理论,论 证发展 方程反问 题解的存 在唯一 性,最后, 利用不 动点方法得到 伪抛物型方程反 问题的可解性     

Optimal design of an elastic beam with a unilateral elastic foundation: Semicoercive state problem

A design optimization problem for an elastic beam with a unilateral elastic foundation is analyzed. Euler-Bernoulli’s model for the beam and Winkler’s model for the foundation are considered. The state problem is represented by a nonlinear semicoercive problem of 4th order with mixed boundary conditions. The thickness of the beam and the stiffness of the foundation are optimized with respect to a cost functional. We establish solvability conditions for the state problem and study the existence of a solution to the optimization problem.     

Algebra complexity problems involving graph homomorphism,semigroups and the constraint satisfaction problem

In this paper, we connect the constraint satisfaction problem with other complexity problems, like the polynomial equivalence problem for combinatorial 0-simple semigroups, the graph retraction problem and the geometry problem. We show that every constraint satisfaction problem is polynomially equivalent to an easily formulated algebra complexity problem. As an application we prove that the polynomial equivalence problem (word problem) for the 2×2 matrices over the two element field is co-NP-complete.     

An approximation method for stochastic control problems with partial observation of the state — a method for constructing ∈-optimal controls

We consider a continuous-time stochastic control problem with partial observations. Given some assumptions, we reduce the problem in successive approximation steps to a discrete-time, complete-observation, stochastic control problem with a finite number of possible states and controls. For the latter problem an optimal control can always be explicitly computed. Convergence of the approximations is shown, which in turn implies that an optimal control for the last-stage approximating problem is ∈-optimal for the original problem.     

Asymptotic Analysis for a Class of Infinite Systems of First-Order PDE: Nonlinear Parabolic PDE in the Singular Limit

Abstract

We study the asymptotic behavior of solutions of the Cauchy problem for a functional partial differential equation with a small parameter as the parameter tends to zero. We establish a convergence theorem in which the limit problem is identified with the Cauchy problem for a nonlinear parabolic partial differential equation. We also present comparison and existence results for the Cauchy problem for the functional partial differential equation and the limit problem.     

Convergence of a continuous approach for zero-one programming problems

In this paper a new continuous formulation for the zero-one programming problem is presented, followed by an investigation of the algorithm for it. This paper first reformulates the zero-one programming problem as an equivalent mathematical programs with complementarity constraints, then as a smooth ordinary nonlinear programming problem with the help of the Fischer-Burmeister function. After that the augmented Lagrangian method is introduced to solve the resulting continuous problem, with optimality conditions for the non-smooth augmented Lagrangian problem derived on the basis of approximate smooth variational principle, and with convergence properties established. To our benefit, the sequence of solutions generated converges to feasible solutions of the original problem, which provides a necessary basis for the convergence results.     

Reconstruction of boundary regimes in the inverse problem of thermal convection of a high-viscosity fluid

A problem of reconstruction of boundary regimes in a model for free convection of a high-viscosity fluid is considered. A variational method and a quasi-inversion method are suggested for solving the problem in question. The variational method is based on the reduction of the original inverse problem to some equivalent variational minimum problem for an appropriate objective functional and solving this problem by a gradient method. When realizing the gradient method for finding a minimizing element of the objective functional, an iterative process actually reducing the original problem to a series of direct well-posed problems is organized. For the quasi-inversion method, the original differential model is modified by means of introducing special additional differential terms of higher order with small parameters as coefficients. The new perturbed problem is well-posed; this allows one to solve this problem by standard methods. An appropriate choice of small parameters gives an opportunity to obtain acceptable qualitative and quantitative results in solving the inverse problem. A comparison of the methods suggested for solving the inverse problem is made with the use of model examples.     

Multiparameter spectral problem for some weakly coupled systems of Hamiltonian equations

We consider a multiparameter spectral problem for a weakly coupled system of ordinary differential equations in which every equation is Hamiltonian and contains two unknown functions. Using the notion of the number of an eigenvalue for a problem with one such equation, we give a statement of the problem of finding the desired eigentuple of values for the problem with several equations. We prove the existence and uniqueness of a solution of this problem and suggest and study a numerical solution method.     

On a family of initial-boundary value problems for the heat equation

We consider the heat problem with nonlocal boundary conditions containing a real parameter. For the zero value of the parameter, this problem is well known as the Samarskii-Ionkin problem and has been comprehensively studied. We analyze the spectral problem for the operator of second derivative subjected to the boundary conditions of the original problem. By separation of variables, we prove the existence and uniqueness of a classical solution for any nonzero value of the parameter. The obtained a priori estimates for a solution imply the stability of the problem with respect to the initial data.     

The mixed problem for degenerate elliptic equations of second order

The present paper deals with the mixed boundary value problem for elliptic equations with degenerate rank 0. We first give the formulation of the problem and estimates of solutions of the problem, and then prove the existence of solutions of the above problem for elliptic equations by the above estimates and the method of parameter extension. We use the complex method, namely first discuss the corresponding problem for degenerate elliptic complex equations of first order, afterwards discuss the above problem for degenerate elliptic equations of second order.     

精确罚函数和极小极大问题

在这篇文章中我们研究了对于不等式约束的非线性规划问题如何根据极小极大问题的鞍点来找精确罚问题的解。对于一个具有不等式约束的非线性规划问题,通过罚函数,我们构造出一个极小极大问题,应用交换“极小”或“极大”次序的策略,证明了罚问题的鞍点定理。研究结果显示极小极大问题的鞍点是精确罚问题的解。