新非单调线搜索规则的Lampariello修正对角稀疏拟牛顿算法

本文设计了求解无约束最优化问题的新的非单调线搜索规则的Lampariello修正对角稀疏拟牛顿算法.新的步长规则类似于Grippo非单调线搜索规则并包含Grippo非单调线搜索规则作为特例.新的步长规则在每一次线搜索时得到一个相对于Grippo非单调线搜索规则的较大步长,同时保证算法的全局收敛性.数值例子表明算法是有效的,适合求解大规模问题.     

新的非单调线搜索规则BFGS算法的全局收敛性

本文在Zhang H.C.的非单调线搜索规则的基础上,设计了求解无约束最优化问题的新的非单调线搜索BFGS算法,在一定 的条件下证明了算法的线性收敛性和超线性收敛性分析.数值例子表明算法是有效的.     

B-convergence of the implicit midpoint rule and the trapezoidal rule

We present upper bounds for the global discretization error of the implicit midpoint rule and the trapezoidal rule for the case of arbitrary variable stepsizes. Specializing our results for the case of constant stepsizes they easily prove second order optimal B-convergence for both methods.1980 AMS Subject Classification: 65L05, 65L20.     

Higher-order Newton–Cotes rules with end corrections

We present higher-order quadrature rules with end corrections for general Newton–Cotes quadrature rules. The construction is based on the Euler–Maclaurin formula for the trapezoidal rule. We present examples with 6 well-known Newton–Cotes quadrature rules. We analyze modified end corrected quadrature rules, which consist on a simple modification of the Newton–Cotes quadratures with end corrections. Numerical tests and stability estimates show the superiority of the corrected rules based on the trapezoidal and the midpoint rules.     

A Pieri rule for skew shapes

The Pieri rule expresses the product of a Schur function and a single row Schur function in terms of Schur functions. We extend the classical Pieri rule by expressing the product of a skew Schur function and a single row Schur function in terms of skew Schur functions. Like the classical rule, our rule involves simple additions of boxes to the original skew shape. Our proof is purely combinatorial and extends the combinatorial proof of the classical case.     

A High-Order Piecewise Quartic Spline Rule for Hadamard Integral and Its Application of the Cavity Scattering

We develop a fourth-order piecewise quartic spline rule for Hadamard integral. The quadrature formula of Hadamard integral is obtained by replacing the integrand function with the piecewise quartic spline interpolation function. We establish corresponding error estimates and analyze the numerical stability. The rule can achieve fourth-order convergence at any point in the interval, even when the singular point coincides with the grid point. Since the derivative information of the integrand is not required, the rule can be easily applied to solve many practical problems. Finally, the quadrature formula is applied to solve the electromagnetic scattering from cavities with different wave numbers, which improves the whole accuracy of the solution. Numerical experiments are presented to show the efficiency and accuracy of the theoretical analysis.     

一些厂商实行特殊定价时的均衡存在性

在这篇文章里,我们将重新考察基于Dierker等人的混合生产经济的均衡存在性问题,提出一个由非凸技术生产厂商制定的更符合实际的定价规则.此外,我们在增加一个标准条件下证得均衡存在,而不仅是自由处置均衡的存在性.     

Implicit iterative algorithms of the split common fixed point problem for Bregman quasi-nonexpansive mapping in Banach spaces

In this paper, we study a modified implicit rule for finding a solution of split common fixed point problem of a Bregman quasi-nonexpansive mapping in Banach spaces. We propose a new iterative algorithm and prove the strong convergence theorem under appropriate conditions. As an application, the results are applied to solving the zero problem and the equilibrium problem.     

Dempster's rule of combination

The theory of belief functions is a generalization of probability theory; a belief function is a set function more general than a probability measure but whose values can still be interpreted as degrees of belief. Dempster's rule of combination is a rule for combining two or more belief functions; when the belief functions combined are based on distinct or “independent” sources of evidence, the rule corresponds intuitively to the pooling of evidence. As a special case, the rule yields a rule of conditioning which generalizes the usual rule for conditioning probability measures. The rule of combination was studied extensively, but only in the case of finite sets of possibilities, in the author's monograph A Mathematical Theory of Evidence. The present paper describes the rule for general, possibly infinite, sets of possibilities. We show that the rule preserves the regularity conditions of continuity and condensability, and we investigate the two distinct generalizations of probabilistic independence which the rule suggests.     

Armijo搜索下的记忆梯度法及其收敛性

本文提出一种新的无约束优化记忆梯度算法,在Armijo搜索下,该算法在每步迭代时利用了前面迭代点的信息,增加了参数选择的自由度,适于求解大规模无约束优化问题。分析了算法的全局收敛性。     

A Littlewood-Richardson rule for factorial Schur functions

We give a combinatorial rule for calculating the coefficients in the expansion of a product of two factorial Schur functions. It is a special case of a more general rule which also gives the coefficients in the expansion of a skew factorial Schur function. Applications to Capelli operators and quantum immanants are also given.

     

On the convergence of the random arrival rule in large claims problems

We study the behavior of the random arrival rule in claims problems with a large number of claimants. We assume that the amount to divide is not too “small” compared with total claims, and each claim is not too “large” compared with any other positive claims. Then, the random arrival rule behaves like the proportional rule as the number of claimants increases. We are grateful to Yuki Funaki, William Thomson, and three referees for their comments. This work was supported by the Brain Korea 21 Project in 2003     

Efficient nested pricing in the simplex algorithm

We report a remarkable success of nested pricing rules over major pivot rules commonly used in practice, such as Dantzig’s original rule as well as the steepest-edge rule and Devex rule.     

On a Constrained Optimal Rule for Classification with Unknown Prior Individual Group Membership

We describe a formal approach to constructing the optimal classification rule for classification analysis with unknown prior probabilities ofKmultivariate normal populations membership. This is done by suggesting a balanced design for the classification experiment and by constructing the optimal rule under the balanced design condition. The rule is characterized by a constrained minimization of total risk of misclassification; the constraint of the rule is constructed by a process of equalization among expected utilities ofKpopulation conditional densities. The efficacy of the suggested rule is examined through numerical studies. This indicates that dramatic gains in the accuracy of classification result can be achieved in the case where little is known about the relative population sizes.     

ON THE SUSTAINABLE PROGRAM IN SOLOW'S MODEL

ABSTRACT. We show that our general result (Withagen and Asheim [1998]) on the converse of Hartwick's rule also applies for the special case of Solow's model with one capital good and one exhaustible resource. Hence, the criticism by Cairns and Yang [2000] of our paper is unfounded.     

An aggregation framework based on coherent lower previsions: Application to Zadeh’s paradox and sensor networks

The problem of aggregating two or more sources of information containing knowledge about a common domain is considered. We propose an aggregation framework for the case where the available information is modelled by coherent lower previsions, corresponding to convex sets of probability mass functions. The consistency between aggregated beliefs and sources of information is discussed. A closed formula, which specializes our rule to a particular class of models, is also derived. Two applications consisting in a possible explanation of Zadeh’s paradox and an algorithm for estimation fusion in sensor networks are finally reported.     

Exploring the VCG mechanism in combinatorial auctions: The threshold revenue and the threshold-price rule

We explore interesting potential extensions of the Vickrey–Clarke–Groves (VCG) rule under the assumption of players with independent and private valuations and no budget constraints. First, we apply the VCG rule to a coalition of bidders in order to compute the second price of the coalition. Then, we introduce and formulate the problem of determining that partition of players into coalitions which maximize the auctioneer’s revenue in the case whereby such coalitions take part to a VCG auction each one as a single agent; in particular, we provide an integer linear formulation of this problem. We also generalize this issue by allowing players to simultaneously belong to distinct coalitions in the case that players’ valuation functions are separable. Finally, we propose some applications of these theoretical results. For instance, we exploit them to provide a class of new payment rules and to decide which bids should be defined as the highest losing ones in combinatorial auctions.     

An experimental study of voting rules and polls in three-candidate elections

We report the results of elections conducted in a laboratory setting, modelled on a threecandidate example due to Borda. By paying subjects conditionally on election outcomes, we create electorates with (publicly) known preferences. We compare the results of experiments with and without non-binding pre-election polls under plurality rule, approval voting, and Borda rule. We also refer to a theory of voting “equilibria,” which makes sharp predictions concerning individual voter behavior and election outcomes. We find that Condorcet losers occasionally win regardless of the voting rule or presence of polls. Duverger's law (which asserts the predominance of two candidates) appears to hold under plurality rule, but close three-way races often arise under approval voting and Borda rule. Voters appear to poll and vote strategically. In elections, voters usually cast votes that are consistent with some strategic equilibrium. By the end of an election series, most votes are consistent with a single equilibrium, although that equilibrium varies by experimental group and voting rule.     

The number of extremal components of a rigid measure

The Littlewood-Richardson rule can be expressed in terms of measures, and the fact that the Littlewood-Richardson coefficient is one amounts to a rigidity property of some measure. We show that the number of extremal components of such a rigid measure can be related to easily calculated geometric data. We recover, in particular, a characterization of those extremal measures whose (appropriately defined) duals are extremal as well. This result is instrumental in writing explicit solutions of Schubert intersection problems in the rigid case.     

On simplex method with most-obtuse-angle rule and cosine rule

A class of simplex methods for solving linear programming (LP) problems, with cosine pivot rule, have been presented in some recent papers. In this paper we show that the cosine rule used in this class is equivalent to the most-obtuse-angle pivot rule, proposed by Pan (1990) [6]. The relation between the direct method for LP and the most-obtuse-angle rule is discussed.