A modified quasi-boundary value method for ill-posed problems

In this paper, we study a final value problem for first order abstract differential equation with positive self-adjoint unbounded operator coefficient. This problem is ill-posed. Perturbing the final condition we obtain an approximate nonlocal problem depending on a small parameter. We show that the approximate problems are well posed and that their solutions converge if and only if the original problem has a classical solution. We also obtain estimates of the solutions of the approximate problems and a convergence result of these solutions. Finally, we give explicit convergence rates.     

Global solutions for initial-boundary value problem of quasilinear wave equations

This work investigates the existence of globally Lipschitz continuous solutions to a class of initial-boundary value problem of quasilinear wave equations. Applying the Lax's method and generalized Glimm's method, we construct the approximate solutions of initial-boundary Riemann problem near the boundary layer and perturbed Riemann problem away from the boundary layer. By showing the weak convergence of residuals for the approximate solutions, we establish the global existence for the derivatives of solutions and obtain the existence of global Lipschitz continuous solutions of the problem.     

非光滑向量均衡问题近似拟全局真有效解的最优性条件

本文研究一类非光滑向量均衡问题(Vector Equilibrium Problem)(VEP)关于近似拟全局真有效解的最优性条件.首先,利用凸集的拟相对内部型分离定理和Clarke次微分的性质,得到了问题(VEP)关于近似拟全局真有效解的最优性必要条件.其次,引入近似伪拟凸函数的概念,并给出具体实例验证其存在性,且在该凸性假设下建立了问题(VEP)关于近似拟全局真有效解的充分条件.最后,利用Tammer函数以及构建满足一定性质的非线性泛函,得到了问题(VEP)近似拟全局真有效解的标量化定理.     

向量优化问题的一类非线性标量化定理

利用Gertewitz泛函研究向量优化问题的一类非线性标量化问题. 证明了向量优化问题的(C, \varepsilon)-弱有效解或(C, \varepsilon)-有效解与标量化问题的近似解或严格近似解间的等价关系, 并估计了标量化问题的近似解．     

On Free Boundary Problem for the Non-Newtonian Shear Thickening Fluids

The aim of this paper is to explore the free boundary problem for the NonNewtonian shear thickening fluids. These fluids not only have vacuum, but also have strong nonlinear properties. In this paper, a class of approximate solutions is first constructed, and some uniform estimates are obtained for these approximate solutions. Finally, the existence of free boundary problem solutions is proved by these uniform estimates.     

Approximate algorithms for the competitive facility location problem

We consider the competitive facility location problem in which two competing sides (the Leader and the Follower) open in succession their facilities, and each consumer chooses one of the open facilities basing on its own preferences. The problem amounts to choosing the Leader’s facility locations so that to obtain maximal profit taking into account the subsequent facility location by the Follower who also aims to obtain maximal profit. We state the problem as a two-level integer programming problem. A method is proposed for calculating an upper bound for the maximal profit of the Leader. The corresponding algorithm amounts to constructing the classical maximum facility location problem and finding an optimal solution to it. Simultaneously with calculating an upper bound we construct an initial approximate solution to the competitive facility location problem. We propose some local search algorithms for improving the initial approximate solutions. We include the results of some simulations with the proposed algorithms, which enable us to estimate the precision of the resulting approximate solutions and give a comparative estimate for the quality of the algorithms under consideration for constructing the approximate solutions to the problem.     

Nonlocal boundary-value problems for abstract parabolic equations: well-posedness in Bochner spaces

The well-posedness of the nonlocal boundary-value problem for abstract parabolic differential equations in Bochner spaces is established. The first and second order of accuracy difference schemes for the approximate solutions of this problem are considered. The coercive inequalities for the solutions of these difference schemes are established. In applications, the almost coercive stability and coercive stability estimates for the solutions of difference schemes for the approximate solutions of the nonlocal boundary-value problem for parabolic equation are obtained.     

On minty variational principle for nonsmooth vector optimization problems with approximate convexity

In this paper, we consider a vector optimization problem involving locally Lipschitz approximately convex functions and give several concepts of approximate efficient solutions. We formulate approximate vector variational inequalities of Stampacchia and Minty type and use these inequalities as a tool to characterize an approximate efficient solution of the vector optimization problem.     

上半连续集值优化解在图像逼近意义下的稳定性

给出上半连续集值映射优化问题在图像拓扑逼近意义下的本质弱有效解和本质有效解的概念.利用通有稳定性研究的usco方法, 证明了上半连续集值映射优化问题.在图像拓扑逼近意义下,弱有效解映射在定义域和映射同时扰动下是紧值上半连续的,从而是通有下半连续的,即在Baire纲意义下, 绝大多数上半连续集值映射优化问题, 在图像逼近意义下其弱有效解是稳定的,或者说是本质的. 证明了上半连续集值映射优化问题在图像逼近意义下有效解映射上半连续的一个充要条件,也即是有效解通有稳定的一个重要条件.     

Initial-Value Technique for Singularly-Perturbed Turning-Point Problems Exhibiting Twin Boundary Layers

The initial-value technique that was originally developed for solving singularly-perturbed nonturning-point problems (Ref. 1) is used here to solve singularly-perturbed turning-point problems exhibiting twin boundary layers. In this method, the required approximate solution is obtained by combining solutions of the reduced problem, an initial-value problem, and a terminal-value problem. Error estimates for approximate solutions are obtained. The implementation of the method on parallel architectures is discussed. Numerical examples are presented to illustrate the present technique.     

Approximate Optimality and Approximate Duality for Quasi Approximate Solutions in Robust Convex Semidefinite Programs

In this paper, we study quasi approximate solutions for a convex semidefinite programming problem in the face of data uncertainty. Using the robust optimization approach (worst-case approach), approximate optimality conditions and approximate duality theorems for quasi approximate solutions in robust convex semidefinite programming problems are explored under the robust characteristic cone constraint qualification. Moreover, some examples are given to illustrate the obtained results.     

kth Order convergence for a semilinear elliptic boundary value problem in the divergence form

The convergence problem of approximate solutions for a semilinear elliptic boundary value problem in the divergence form is studied. By employing the method of quasilinearization, a sequence of approximate solutions converging with the kth (k ? 2) order convergence to a weak solution for a semilinear elliptic problem is obtained via the variational approach.     

Approximate solutions for a class of first order nonlinear difference equations

In this paper, a measure-theoretical approach to find the approximate solutions for a class of first order nonlinear difference equations is introduced. In this method the problem is transformed to an equivalent optimization problem. Then, by considering it as a calculus of variations problem, some concepts in measure theory are used to approximate the solution. The procedure of constructing approximate solution in form of an algorithm is shown. Finally a numerical example is given.     

Some properties of approximate solutions for vector optimization problem with set-valued functions

In this paper, we study the approximate solutions for vector optimization problem with set-valued functions. The scalar characterization is derived without imposing any convexity assumption on the objective functions. The relationships between approximate solutions and weak efficient solutions are discussed. In particular, we prove the connectedness of the set of approximate solutions under the condition that the objective functions are quasiconvex set-valued functions.     

Approximate solutions of multiobjective optimization problems

This paper provides some new results on approximate Pareto solutions of a multiobjective optimization problem involving nonsmooth functions. We establish Fritz-John type necessary conditions and sufficient conditions for approximate Pareto solutions of such a problem. As a consequence, we obtain Fritz-John type necessary conditions for (weakly) Pareto solutions of the considered problem by exploiting the corresponding results of the approximate Pareto solutions. In addition, we state a dual problem formulated in an approximate form to the reference problem and explore duality relations between them.     

Initial-Value Technique for Singularly Perturbed Boundary-Value Problems for Second-Order Ordinary Differential Equations Arising in Chemical Reactor Theory

An initial-value technique is presented for solving singularly perturbed two-point boundary-value problems for linear and semilinear second-order ordinary differential equations arising in chemical reactor theory. In this technique, the required approximate solution is obtained by combining solutions of two terminal-value problems and one initial-value problem which are obtained from the original boundary-value problem through asymptotic expansion procedures. Error estimates for approximate solutions are obtained. Numerical examples are presented to illustrate the present technique.     

Hybrid Approximate Proximal Method with Auxiliary Variational Inequality for Vector Optimization

This paper studies a general vector optimization problem of finding weakly efficient points for mappings from Hilbert spaces to arbitrary Banach spaces, where the latter are partially ordered by some closed, convex, and pointed cones with nonempty interiors. To find solutions of this vector optimization problem, we introduce an auxiliary variational inequality problem for a monotone and Lipschitz continuous mapping. The approximate proximal method in vector optimization is extended to develop a hybrid approximate proximal method for the general vector optimization problem under consideration by combining an extragradient method to find a solution of the variational inequality problem and an approximate proximal point method for finding a root of a maximal monotone operator. In this hybrid approximate proximal method, the subproblems consist of finding approximate solutions to the variational inequality problem for monotone and Lipschitz continuous mapping, and then finding weakly efficient points for a suitable regularization of the original mapping. We present both absolute and relative versions of our hybrid algorithm in which the subproblems are solved only approximately. The weak convergence of the generated sequence to a weak efficient point is established under quite mild assumptions. In addition, we develop some extensions of our hybrid algorithms for vector optimization by using Bregman-type functions.     

具变指数非线性拟抛物方程弱解的存在性

虑一类变指数的非线性拟抛物方程的初值问题.在一些初值的假定下,基于时间离散化方法构造逼近解.通过对逼近解的一致性估计,证明了弱解的存在性.     

An approximate solution for linear boundary-value problems with slowly varying coefficients

In this paper, an approximate closed-form solution for linear boundary-value problems with slowly varying coefficient matrices is obtained. The derivation of the approximate solution is based on the freezing technique, which is commonly used in analyzing the stability of slowly varying initial-value problems as well as solving them. The error between the approximate and the exact solutions is given, and an upper bound on the norm of the error is obtained. This upper bound is proportional to the rate of change of the coefficient matrix of the boundary-value problem. The proposed approximate solution is obtained for a two-point boundary-value problem and is compared to its solution obtained numerically. Good agreement is observed between the approximate and the numerical solutions, when the rate of change of the coefficient matrix is small.     

Existence theory for nonclassical entropy solutions of scalar conservation laws

We establish a general existence theory for the Cauchy problem associated with a scalar conservation law in one-space dimension. The flux-function is assumed to be nonconvex and we consider nonclassical entropy solutions selected by a kinetic relation. To solve the Cauchy problem, we construct a sequence of approximate solutions using a wave-front tracking scheme. The main difficulty is deriving a uniform estimate on the total variation of the approximate solutions. This is achieved here by introducing a generalized total variation functional, which is decreasing in time and, additionally, reduces to the standard total variation functional when the solutions contain only classical shocks. This functional seems sufficiently robust to be useful for systems as well.