Quantitative error estimates for coefficient idealization in linear elliptic problems

We give a thorough quantitative error analysis for the effect of coefficient idealization on solutions of linear elliptic boundary value problems. The a posteriori error estimate is derived by a tactful application of the duality theory in convex analysis. The estimate involves an auxiliary function subject to certain constraint. We discuss in detail the selection of a good auxiliary function for various cases. Numerical examples show the effectiveness of our a posteriori error estimate.     

Moving averages of ordinary differential equations via convolution

We introduce an averaging framework, where the solution of a time-varying equation with a small amplitude is approximated by the solution of a slowly-varying auxiliary system, generated by convolving the original equation with a kernel function. The effect of the convolution is smoothing of the equation, thus, making it more amenable to numerical computations. We present tight results on the approximation error for general classes of vector fields and kernels.     

相依非线性回归系统中的附加信息Bayes拟似然

对多个相依统计模型的研究,现有成果主要集中在相依线性回归系统.本文则首次提出多个相依非线性回归系统中的附加信息Bayes拟似然,给出误差相关信息和先验信息在拟似然中的迭加方法,在较弱的条件下得到附加信息Bayes拟似然的一些性质,在Bayes风险准则下。讨论了其估计函数和参数估计的最优性,证明了附加信息Bayes拟似然的渐近 Bayes风险随着相依信息的增力。而逐步减少.     

一类关于正规三角函数基的标准模糊系统逼近误差公式的讨论

在标准模糊系统的基础上提出了以正规三角函数为基函数的一类模糊系统.通过采用数值分析中的余项与辅助函数方法,对该类模糊系统进行了逼近误差精度的分析,给出了从SISO到MISO的误差界公式.最后,指出了这些公式在模糊系统的理论研究与实际应用的意义.     

Generalized synchronization of chaotic systems by pure error dynamics and elaborate Lyapunov function

The generalized synchronization is studied by applying pure error dynamics and elaborate Lyapunov function in this paper. Generalized synchronization can be obtained by pure error dynamics without auxiliary numerical simulation, instead of current mixed error dynamics in which master state variables and slave state variables are presented. The elaborate Lyapunov function is applied rather than the current plain square sum Lyapunov function, deeply weakening the power of Lyapunov direct method. The scheme is successfully applied to both autonomous and nonautonomous double Mathieu systems with numerical simulations.     

Properties and numerical testing of a parallel global optimization algorithm

In the present paper, we have considered three methods with which to control the error in the homotopy analysis of elliptic differential equations and related boundary value problems, namely, control of residual errors, minimization of error functionals, and optimal homotopy selection through appropriate choice of auxiliary function H(x). After outlining the methods in general, we consider three applications. First, we apply the method of minimized residual error in order to determine optimal values of the convergence control parameter to obtain solutions exhibiting central symmetry for the Yamabe equation in three or more spatial dimensions. Secondly, we apply the method of minimizing error functionals in order to obtain optimal values of the convergnce control parameter for the homotopy analysis solutions to the Brinkman?CForchheimer equation. Finally, we carefully selected the auxiliary function H(x) in order to obtain an optimal homotopy solution for Liouville??s equation.     

Nonlinear generalized synchronization of chaotic systems by pure error dynamics and elaborate nondiagonal Lyapunov function

By applying pure error dynamics and elaborate nondiagonal Lyapunov function, the nonlinear generalized synchronization is studied in this paper. Instead of current mixed error dynamics in which master state variables and slave state variables are presented, the nonlinear generalized synchronization can be obtained by pure error dynamics without auxiliary numerical simulation. The elaborate nondiagonal Lyapunov function is applied rather than current monotonous square sum Lyapunov function deeply weakening the powerfulness of Lyapunov direct method. Both autonomous and nonautonomous double Mathieu systems are used as examples with numerical simulations.     

A class of regularization methods for ill posed problems

The paper deals with regularization methods for solving ill posed problems with nonselfadjoint bounded linear operators acting on a Hilbert space. A class of methods generated by certain families of functions is considered. In the case of exact data the convergence of approximate solutions to the exact one (provided that it exists) is proved and error estimations are presented. An integral representation of functions of an auxiliary operator is obtained and subsequently used in error estimation.     

泊松回归模型中协变量含误差的经验似然推断

在模型的协变量含有测量误差的情况下,考虑一类泊松回归模型的统计推断问题.通过巧妙地构造辅助随机向量,提出一个工具变量类型的经验似然统计推断方法.证明构造的经验对数似然比函数渐近服从标准卡方分布,进而给出了回归系数的置信区间.所提出的估计方法可以有效地消除测量误差对估计精度的影响,并且具有较好的有限样本性质.     

Approximation algorithms for combinatorial fractional programming problems

We are concerned with a combinatorial optimization problem which has the ratio of two linear functions as the objective function. This type of problems can be solved by an algorithm that uses an auxiliary problem with a parametrized linear objective function. Because of its combinatorial nature, however, it is often difficult to solve the auxiliary problem exactly. In this paper, we propose an algorithm which assumes that the auxiliary problems are solved only approximately, and prove that it gives an approximate solution to the original problem, of which the accuracy is at least as good as that of approximate solutions to the auxiliary problems. It is also shown that the time complexity is bounded by the square of the computation time of the approximate algorithm for the auxiliary problem. As an example of the proposed algorithm, we present a fully polynomial time approximation scheme for the fractional 0–1 knapsack problem.     

A new constructing auxiliary function method for global optimization

A new auxiliary function method based on the idea which executes a two-stage deterministic search for global optimization is proposed. Specifically, a local minimum of the original function is first obtained, and then a stretching function technique is used to modify the objective function with respect to the obtained local minimum. The transformed function stretches the function values higher than the obtained minimum upward while it keeps the ones with lower values unchanged. Next, an auxiliary function is constructed on the stretched function, which always descends in the region where the function values are higher than the obtained minimum, and it has a stationary point in the lower area. We optimize the auxiliary function and use the found stationary point as the starting point to turn to the first step to restart the search. Repeat the procedure until termination. A theoretical analysis is also made. The main feature of the new method is that it relaxes significantly the requirements for the parameters. Numerical experiments on benchmark functions with different dimensions (up to 50) demonstrate that the new algorithm has a more rapid convergence and a higher success rate, and can find the solutions with higher quality, compared with some other existing similar algorithms, which is consistent with the analysis in theory.     

Solving nonlinearly constrained global optimization problem via an auxiliary function method

This paper considers the nonlinearly constrained continuous global minimization problem. Based on the idea of the penalty function method, an auxiliary function, which has approximately the same global minimizers as the original problem, is constructed. An algorithm is developed to minimize the auxiliary function to find an approximate constrained global minimizer of the constrained global minimization problem. The algorithm can escape from the previously converged local minimizers, and can converge to an approximate global minimizer of the problem asymptotically with probability one. Numerical experiments show that it is better than some other well known recent methods for constrained global minimization problems.     

Parametric weighted minimax estimates in Monte Carlo methods

In the similar trajectory method (STM), the numerical-statistical modeling of trajectories of particles (radiation quanta) is implemented by applying an auxiliary radiation model. Weighted estimates of the functionals are calculated simultaneously for a set physical parameters values. Theoretical and numerical aspects of choosing an auxiliary model with the aim of minimizing the parametric maximum of the mean-square error in weighted estimates are discussed. Previously known results concerning minimax STM algorithms are refined, and new assertions are obtained. The STM is used to numerically study the parametric dependence of the “transport approximation” error for the particle transmission, absorption, and reflection probabilities.     

关于两类具有不同基函数的标准模糊系统逼近精度问题的研究

在标准模糊系统的基础上提出了以正规二次多项式和正规三角函数为基函数的两类标准模糊系统.通过采用数值分析中的余项与辅助函数方法,对这两类模糊系统进行了误差精度的分析,给出了从SISO到MISO的误差界公式.同时,对这两类模糊系统误差界进行了比较,指出了两类模糊系统的优劣.最后,通过算例验证了理论结果的正确性.     

全局优化问题的一类积分型最优性条件 (英)

本文通过构造水平集辅助函数对一类积分全局最优性条件进行研究. 所构造的辅助函数仅含有一个参数变量与一个控制变量,该参数变量用以表征对原问题目标函数最优值的估计,而控制变量用以控制积分型全局最优性条件的精度. 对参数变量做极限运算即可得到积分型全局最优性条件.继而给出了用该辅助函数所刻画的全局最优性的充要条件, 从而将原全局优化问题的求解转化为寻找一个非线性方程根的问题.更进一步地,若所取测度为勒贝格测度且积分区域为自然数集合的一个有限子集, 则该积分最优性条件便化为有限极大极小问题中利用凝聚函数对极大值函数进行逼近的近似系统.从而积分型全局最优性条件可以看作是该近似系统从离散到连续的一种推广.     

An external penalty-type method for multicriteria

We propose an extension of the classical real-valued external penalty method to the multicriteria optimization setting. As its single objective counterpart, it also requires an external penalty function for the constraint set, as well as an exogenous divergent sequence of nonnegative real numbers, the so-called penalty parameters, but, differently from the scalar procedure, the vector-valued method uses an auxiliary function, which can be chosen among large classes of “monotonic” real-valued mappings. We analyze the properties of the auxiliary functions in those classes and exhibit some examples. The convergence results are similar to those of the scalar-valued method, and depending on the kind of auxiliary function used in the implementation, under standard assumptions, the generated infeasible sequences converge to weak Pareto or Pareto optimal points. We also propose an implementable local version of the external penalization method and study its convergence results.     

Approximate ADMM algorithms derived from Lagrangian splitting

This paper presents two new approximate versions of the alternating direction method of multipliers (ADMM) derived by modifying of the original “Lagrangian splitting” convergence analysis of Fortin and Glowinski. They require neither strong convexity of the objective function nor any restrictions on the coupling matrix. The first method uses an absolutely summable error criterion and resembles methods that may readily be derived from earlier work on the relationship between the ADMM and the proximal point method, but without any need for restrictive assumptions to make it practically implementable. It permits both subproblems to be solved inexactly. The second method uses a relative error criterion and the same kind of auxiliary iterate sequence that has recently been proposed to enable relative-error approximate implementation of non-decomposition augmented Lagrangian algorithms. It also allows both subproblems to be solved inexactly, although ruling out “jamming” behavior requires a somewhat complicated implementation. The convergence analyses of the two methods share extensive underlying elements.     

Value-Estimation Function Method for Constrained Global Optimization

A novel value-estimation function method for global optimization problems with inequality constraints is proposed in this paper. The value-estimation function formulation is an auxiliary unconstrained optimization problem with a univariate parameter that represents an estimated optimal value of the objective function of the original optimization problem. A solution is optimal to the original problem if and only if it is also optimal to the auxiliary unconstrained optimization with the parameter set at the optimal objective value of the original problem, which turns out to be the unique root of a basic value-estimation function. A logarithmic-exponential value-estimation function formulation is further developed to acquire computational tractability and efficiency. The optimal objective value of the original problem as well as the optimal solution are sought iteratively by applying either a generalized Newton method or a bisection method to the logarithmic-exponential value-estimation function formulation. The convergence properties of the solution algorithms guarantee the identification of an approximate optimal solution of the original problem, up to any predetermined degree of accuracy, within a finite number of iterations.     

Verified bounds for singular values,in particular for the spectral norm of a matrix and its inverse

The singular value decomposition and spectral norm of a matrix are ubiquitous in numerical analysis. They are extensively used in proofs, but usually it is not necessary to compute them. However, there are some important applications in the realm of verified error bounds for the solution of ordinary and partial differential equations where reasonably tight error bounds for the spectral norm of a matrix are mandatory. We present various approaches to this together with some auxiliary useful estimates.     

Auxiliary problem principles for equilibria

The auxiliary problem principle allows solving a given equilibrium problem (EP) through an equivalent auxiliary problem with better properties. The paper investigates two families of auxiliary EPs: the classical auxiliary problems, in which a regularizing term is added to the equilibrium bifunction, and the regularized Minty EPs. The conditions that ensure the equivalence of a given EP with each of these auxiliary problems are investigated exploiting parametric definitions of different kinds of convexity and monotonicity. This analysis leads to extending some known results for variational inequalities and linear EPs to the general case together with new equivalences. Stationarity and convexity properties of gap functions are investigated as well in this framework. Moreover, both new results on the existence of a unique solution and new error bounds based on gap functions with good convexity properties are obtained under weak quasimonotonicity or weak concavity assumptions.