多目标规划的鞍点准则

本文给出多目标规划有效解适应鞍点准则的一个新的判别法 ,它不使用凸性的几何术语及凸分析中的概念。最后给出单目标规划的一个相应的判别法     

Direct and inverse estimates for a new family of linear positive operators

In the present paper we introduce a new family of linear positive operators and study some direct and inverse results in simultaneous approximation.     

Delay-dependent stochastic stability of delayed Hopfield neural networks with Markovian jump parameters

In this paper, the problem of stochastic stability for a class of time-delay Hopfield neural networks with Markovian jump parameters is investigated. The jumping parameters are modeled as a continuous-time, discrete-state Markov process. Without assuming the boundedness, monotonicity and differentiability of the activation functions, some results for delay-dependent stochastic stability criteria for the Markovian jumping Hopfield neural networks (MJDHNNs) with time-delay are developed. We establish that the sufficient conditions can be essentially solved in terms of linear matrix inequalities.     

Analysis of heterojunction resonant cavity-enhanced Schottky photodiodes by using two-valley transport model

The article concerns heterojunction resonant cavity-enhanced (RCE) Schottky photodiodes with GaAs in the absorption layer. The quantum efficiency and linear pulse response have thoroughly been analysed. For the first time, the response of a heterojunction photodiode has been modelled by the phenomenological model for a two-valley semiconductor. The results obtained have shown that the satellite valleys, as well as the parasitic time constant, significantly influence the response and, accordingly, have to be taken into account when analysing and optimizing RCE photodetectors.     

An alternative approach for non-linear optimal control problems based on the method of moments

We propose an alternative method for computing effectively the solution of non-linear, fixed-terminal-time, optimal control problems when they are given in Lagrange, Bolza or Mayer forms. This method works well when the nonlinearities in the control variable can be expressed as polynomials. The essential of this proposal is the transformation of a non-linear, non-convex optimal control problem into an equivalent optimal control problem with linear and convex structure. The method is based on global optimization of polynomials by the method of moments. With this method we can determine either the existence or lacking of minimizers. In addition, we can calculate generalized solutions when the original problem lacks of minimizers. We also present the numerical schemes to solve several examples arising in science and technology.     

Optimal stopping problems by two or more decision makers: a survey

A review of the optimal stopping problem with more than a single decision maker (DM) is presented in this paper. We classify the existing literature according to the arrival of the offers, the utility of the DMs, the length of the sequence of offers, the nature of the game and the number of offers to be selected. We enumerate various definitions for this problem and describe some dynamic approaches. Fouad Ben Abdelaziz is on leave from the Institut Superieur de Gestion, University of Tunis, Tunisia e-mail: foued.benabdelaz@isg.run.tn.     

Solving a class of multiplicative programming problems via c-programming

In this note we show that many classes of global optimization problems can be treated most satisfactorily by classical optimization theory and conventional algorithms. We focus on the class of problems involving the minimization of the product of several convex functions on a convex set which was studied recently by Kunoet al. [3]. It is shown that these problems are typical composite concave programming problems and thus can be handled elegantly by c-programming [4]–[8] and its techniques.     

A combined programming and iteration algorithm for finite element analysis of three-dimensional contact problems

Comparing with two-dimensional contact problems, three-dimensional frictional contact problems are more difficult to deal with, because of the unknown slip direction of the tangential force and enormous computing time. In order to overcome these difficulties, a combined PQP (Parametric Quadratic Programming) and iteration method is derived in this paper. The iteration algorithm, which alleviates the difficulty of unknown slip direction, is used along with the PQP method to cut down computing costs. Numerical example is given to demonstrate the validity of the present algorithm. The project supported by the Machinary and Electronics Ministry of China     

An optimal design of collateralized mortgage obligation with PAC-companion structure using dynamic cash reserve

This paper presents a model for optimally designing a collateralized mortgage obligation (CMO) with a planned amortization class (PAC)-companion structure using dynamic cash reserve. In this structure, the mortgage pool’s cash flow is allocated by rule to the two bond classes such that PAC bondholders receive substantial prepayment protection, that protection being provided by the companion bondholders. The structure we propose provides greater protection to the PAC bondholders than current structures during periods of rising interest rates when this class of bondholders faces greater extension risk. We do so by allowing a portion of the cash flow from the collateral to be reserved to meet the PAC’s scheduled cash flow in subsequent periods. The greater protection is provided by the companion bondholders exposure to interest loss. To tackle this problem, we transform the problem of designing the optimal PAC-companion structure into a standard stochastic linear programming problem which can be solved efficiently. Moreover, we present an extended model by considering the quality of the companion bond and by relaxing the PAC bondholder shortfall constraint. Based on numerical experiments through Monte Carlo simulation, we show the utility of the proposed model.     

Pattern Search Method for Discrete <Emphasis Type="Italic">L</Emphasis><Subscript>1</Subscript>–Approximation

We propose a pattern search method to solve a classical nonsmooth optimization problem. In a deep analogy with pattern search methods for linear constrained optimization, the set of search directions at each iteration is defined in such a way that it conforms to the local geometry of the set of points of nondifferentiability near the current iterate. This is crucial to ensure convergence. The approach presented here can be extended to wider classes of nonsmooth optimization problems. Numerical experiments seem to be encouraging. This work was supported by M.U.R.S.T., Rome, Italy.