多目标规划的ak—较多有效点与ak—较多最优点

在[1]中,作引入了多目标规划的较多有效点及较多最优点的概念,并讨论了它们的性质,本首次提出了ak-较多有效点与ak-较多最优点的概念,并讨论了ak-较多有效点,ak-较多最优点、ak-较多有效解,ak-较多最优解的相关性质。     

Saddle Points and Pareto Points in Multiple Objective Programming

In this paper relationships between Pareto points and saddle points are studied in convex and nonconvex multiple objective programming. The analysis is based on partitioning the index sets of objectives and constraints and splitting the original problem into subproblems having a special structure. The results are based on scalarizations of multiple objective programs and related linear and augmented Lagrangian functions. In the nonconvex case, a saddle point characterization of Pareto points is possible under assumptions that guarantee existence of Pareto points and stability conditions of single objective problems. Essentially, these conditions are not stronger than those in analogous results for single objective programming.This research was partially supported by ONR Grant N00014-97-1-784AMS Subject Classification: 90C29, 90C26     

具有转向点的非线性系统边值问题的奇摄动

本文应用微分不等式的方法,研究具有转向点的非线性系统两点边值问题的奇摄动.证明了当ε→0~ 时,其解的渐近性态.     

三阶非线性微分方程三点边值问题的渐近解

本文通过引入伸长变量和使用边界层校正项的方法构造了一类三阶非线性微分方程三点边值问题的形式渐近解,然后利用高阶微分不等式理论,证明了此解的一致有效性.     

An Interior Point Algorithm for Computing Saddle Points of Constrained Continuous Minimax

The aim of this paper is to present an algorithm for finding a saddle point to the constrained minimax problem. The initial problem is transformed into an equivalent equality constrained problem, and then the interior point approach is used. To satisfy the original inequality constraints a logarithmic barrier function is used and special care is given to step size parameter to keep the variables within permitted boundaries. Numerical results illustrating the method are given.     

High order finite volume methods for singular perturbation problems

In this paper we establish a high order finite volume method for the fourth order singular perturbation problems.In conjunction with the optimal meshes,the numerical solutions resulting from the method have optimal convergence order.Numerical experiments are presented to verify our theoretical estimates.     

A Geometrical Look at Iterative Methods for Operators with Fixed Points

ABSTRACT

We distinguish classes of operators T with fixed points on a real Hilbert space by comparing the distances of a point x and its image Tx to the (set of) fixed points of T; this leads to a ranking of those classes, based on a nonnegative parameter. That same parameter also lets us conclude about the sign of and an upper bound for a characteristic inner product result that arises in iterative processes to obtain a common fixed point of a set of operators. We use that parameter as the starting point for a geometrically-inclined study of specific iterative algorithms intended to find a common fixed point of operators belonging to such class.     

Fixed Points,Continuous Selections,and Existence of Solution of Optimization-Related Problems

We propose a definition of a generalized type of Knaster–Kuratowski–Mazurkiewicz (KKM) mappings, called a weak T-KKM mapping, and a corresponding weak KKM property. A new extension of the Fan–Glicksberg fixed-point theorem is established. Sufficient conditions for the existence of a continuous selection, a fixed point of a composition, and a coincidence point are also provided. Then, we use the obtained results to study the existence of solutions to various optimization-related problems. Discussions and detailed examples are included as well to compare our results with existing ones and to explain their advantages in many situations.     

周期变号减少核确定的完全样条与最优取样点的唯一性

证明了具有给定零点的完全样条的唯一性，证明了在卷积类上最优取样点的唯一性．     

Comparison of Existence Results for Efficient Points

Existence results of maximal points with respect to general binary relations were stated by Hazen and Morin (Ref. 1) and by Gajek and Zagrodny (Ref. 2). In this paper, we point out that the natural framework for this problem is that of transitive and reflexive relations (preorders). The aim of this paper is to discuss existence results for maximal points with respect to general transitive relations in such a way that, when considering them for preorders defined by convex cones, we are able to recover most known existence results for efficient points; the quasi-totality of them, with their (short) proofs, is presented, too.     

含双参数的三阶非线性两点边值问题的套层解(英文)

对含双参数且有套层解的一类三阶非线性微分方程的边值问题的渐近解做了估计 ,得到了任意次近似的一致有效的渐近展开式 .     

一类非紧算子的不动点

运用Zorn引理得到了非紧，非单调算子不动点存在性的一些有趣结果。     

Approximating Fixed Points of Infinite Nonexpansive Mappings by the Hybrid Method

In this paper, we introduce an iterative scheme for finding a common fixed point of infinite nonexpansive mappings in a Hilbert space by using the hybrid method. Then, we prove a strong convergence theorem which is connected with the problem of image recovery. Further, using this result, we consider the generalized problem of image recovery and the problem of finding a common fixed point of a family of nonexpansive mappings.     

Numerical Computation of Optimal Feed Rates for a Fed-Batch Fermentation Model

In this paper, we consider a model for a fed-batch fermentation process which describes the biosynthesis of penicillin. First, we solve the problem numerically by using a direct shooting method. By discretization of the control variable, we transform the basic optimal control problem to a finite-dimensional nonlinear programming problem, which is solved numerically by a standard SQP method. Contrary to earlier investigations (Luus, 1993), we consider the problem as a free final time problem, thus obtaining an improved value of the penicillin output. The results indicate that the assumption of a continuous control which underlies the discretization scheme seems not to be valid. In a second step, we apply classical optimal control theory to the fed-batch fermentation problem. We derive a boundary-value problem (BVP) with switching conditions, which can be solved numerically by multiple shooting techniques. It turns out that this BVP is sensitive, which is due to the rigid behavior of the specific growth rate functions. By relaxation of the characteristic parameters, we obtain a simpler BVP, which can be solved by using the predicted control structure (Lim et al., 1986). Now, by path continuation methods, the parameters are changed up to the original values. Thus, we obtain a solution which satisfies all first-order and second-order necessary conditions of optimal control theory. The solution is similar to the one obtained by direct methods, but in addition it contains certain very small bang-bang subarcs of the control. Earlier results on the maximal output of penicillin are improved.     

On Modeling Change Points in Non-Homogeneous Poisson Processes

Failures in repairable systems are often described by means of non-homogeneous Poisson processes, identified by their intensity and mean value functions. Intervention on the systems are likely to modify their reliability, and changes in intensities and mean value functions are therefore induced. We consider different scenarios in which interventions take places and propose models describing each of them. Bayesian analyses, relying on Markov-chain Monte Carlo methods, are illustrated along with applications to simulated and real, widely-known, data.     

多刚性奇异摄动问题Rosenbrock方法的定量误差分析

本文获得了Rosenbrock方法关于一类多刚性奇异摄动问题的定量收敛结果．这是对Strehmel等人于1991年所获的单刚性奇异摄动问题相应结果的推广和发展．     

Multiplicity results for Sturm–Liouville boundary value problems

Multiplicity results for Sturm–Liouville boundary value problems are obtained. Proofs are based on variational methods.     

Nash Equilibria for the Multiobjective Control of Linear Partial Differential Equations

This article is concerned with the numerical solution of multiobjective control problems associated with linear partial differential equations. More precisely, for such problems, we look for the Nash equilibrium, which is the solution to a noncooperative game. First, we study the continuous case. Then, to compute the solution of the problem, we combine finite-difference methods for the time discretization, finite-element methods for the space discretization, and conjugate-gradient algorithms for the iterative solution of the discrete control problems. Finally, we apply the above methodology to the solution of several tests problems.