Two types of limit cycles of a resonant converter modelled by a three-dimensional system

In this paper, the long-run dynamics of a resonant converter is studied. The modelling of the resonant converter can be done using various approximations and the long-run dynamics of the two dimensional cases were earlier analysed. In this paper, we discuss results that can be extended to the three dimensional case. It seems that limit cycles describe the long-run dynamics in important situations in the three dimensional case, too. Our objective is to relate the limit cycles found previously in the two-dimensional case to those found now in the three dimensional approximation.     

带有缺失数据的广义半参数模型的均值借补估计

本文在响应变量随机缺失时, 给出了广义半参数模型中响应变量的2个均值拟似然借补估计.证明了它们具有渐近正态性, 给出了估计的渐近偏差与渐近方差, 并进行模拟比较.     

A descent method with inexact linear search for nonsmooth equilibrium problems

A descent method with respect to the gap function is formulated and justified for the nonsmooth equilibrium problem. It uses the procedure of inexact linear search of the Armijo type. The proposed method converges under the same assumptions as the methods with exact linear search.     

Exploiting equalities in polynomial programming

We propose a novel approach for solving polynomial programs over compact domains with equality constraints. By means of a generic transformation, we show that existing solution schemes for the, typically simpler, problem without equalities can be used to address the problem with equalities.     

A modification of a solution concept of the linear programming problem with interval coefficients in the constraints

We propose a modification of a concept of solving a linear programming problem with interval coefficients in the constraints. The original concept imposes the decision maker a way comparing intervals, our modification—which is an interactive approach, comprising the original one as its special case—gives him more freedom in the choice of the preference relation. Thanks to this flexibility he may be able to find a solution which better suits his needs and attitude towards risk. What is more, our modification corrects a serious drawback of the original method.     

A handy proof of Gay's theorem

In 1979, Gay proved that Broyden's methods, when used for n‐square linear systems, terminate in at most 2n iterations (SIAM J. Numer. Anal. 1979; 16 :623–630). Also, the ABS methods were introduced in 1984 (Numer. Math. 1984; 45 :1361–1376). In this paper we show another (handy) proof of Gay's theorem by these algorithms. Copyright © 2008 John Wiley & Sons, Ltd.     

On local convergence of sequential quadratically-constrained quadratic-programming type methods,with an extension to variational problems

We consider the class of quadratically-constrained quadratic-programming methods in the framework extended from optimization to more general variational problems. Previously, in the optimization case, Anitescu (SIAM J. Optim. 12, 949–978, 2002) showed superlinear convergence of the primal sequence under the Mangasarian-Fromovitz constraint qualification and the quadratic growth condition. Quadratic convergence of the primal-dual sequence was established by Fukushima, Luo and Tseng (SIAM J. Optim. 13, 1098–1119, 2003) under the assumption of convexity, the Slater constraint qualification, and a strong second-order sufficient condition. We obtain a new local convergence result, which complements the above (it is neither stronger nor weaker): we prove primal-dual quadratic convergence under the linear independence constraint qualification, strict complementarity, and a second-order sufficiency condition. Additionally, our results apply to variational problems beyond the optimization case. Finally, we provide a necessary and sufficient condition for superlinear convergence of the primal sequence under a Dennis-Moré type condition. Research of the second author is partially supported by CNPq Grants 300734/95-6 and 471780/2003-0, by PRONEX–Optimization, and by FAPERJ.     

Pareto optimal solutions of a cost–time trade-off bulk transportation problem

A cost–time trade-off bulk transportation problem with the objectives to minimize the total cost and duration of bulk transportation without according priorities to them is considered. The entire requirement of each destination is to be met from one source only; however a source can supply to any number of destinations subject to the availability of the commodity at it. Two new algorithms are provided to obtain the set of Pareto optimal solutions of this problem. This work extends and generalizes the work related to single-objective and prioritized two-objective bulk transportation problems done in the past while providing flexibility in decision making.     

Noncommutative versions of the Singer-Wermer conjecture with linear left ϑ-derivations

The noncommutative Singer-Wermer conjecture states that every linear （possibly unbounded） derivation on a （possibly noncommutative） Banach algebra maps into its Jacobson radical. This conjecture is still an open question for more than thirty years. In this paper we approach this question via linear left θ-derivations.     

Spectra of Continuous Linear Operators on Separable Fréchet Spaces

Mathematical Notes -