求解波场变换反演问题的连续正则化方法

本文研究波场变换反演问题.利用连续正则化方法求解波场变换反演问题,构造展平泛函,基于已经正则化的变分问题用差分法作有限维逼近.利用偏差原理和Newton三阶迭代收敛格式选出最优的正则化参数,实施数值求解.通过对数值计算结果与已知波场函数对比,证明该方法的有效性和可行性.与离散正则化算法相比,本文的连续正则化算法具有保结构和收敛速度快等优点.     

基于迭代正则化高斯-牛顿法的非线性Urysohn积分方程数值解

非线性Urysohn积分方程在许多领域中都有广泛的应用,但由于该方程具有不适定性的特点,数据的微小扰动可能导致解的巨大变化,给数值求解带来很大困难.为了获得稳定的、准确的数值解,本文利用迭代正则化高斯-牛顿法对此方程进行求解,给出了利用Sigmoid-型函数确定迭代正则化参数的方法.对一类重力测定问题进行了数值模拟,将得到的数值解和相应的精确解作比较.结果表明,本文提出的方法在求解非线性Urysohn积分方程时是可行的也是有效的.     

一种基于积分方程的数值微分方法

本文研究了目前一些求解数值微分的方法无法求出端点导数或是求出的端点附近导数不可用的问题.利用构造一类积分方程的方法,将数值微分问题转化为这类积分方程的求解,并用一种加速的迭代正则化方法来求解积分方程. 数值实验结果表明该算法可以有效求出端点的导数,且具有数值稳定、计算简单等优点.     

基于混沌粒子群算法的Tikhonov正则化参数选取

Tikhonov正则化方法是求解不适定问题最为有效的方法之一,而正则化参数的最优选取是其关键.本文将混沌粒子群优化算法与Tikhonov正则化方法相结合,基于Morozov偏差原理设计粒子群的适应度函数,利用混沌粒子群优化算法的优点,为正则化参数的选取提供了一条有效的途径.数值实验结果表明,本文方法能有效地处理不适定问题,是一种实用有效的方法.     

一种磨光微分方法

本文讨论一种利用磨光思想求解微分的正则化方法，并讨论了它在某种条件下的收敛性．这种磨光微分方法结合正则化参数的选取得到了最优的收敛阶，最后给出了一个数值例子，证明该方法是可行的．     

Bakhvalov-Shishkin网格上求解边界层问题的差分进化算法

该文在Bakhvalov-Shishkin网格上求解具有左边界层或右边界层的对流扩散方程,并采用差分进化算法对Bakhvalov-Shishkin网格中的参数进行优化,获得了该网格上具有最优精度的数值解.对三个算例进行了数值模拟,数值结果表明:采用差分进化算法求解具有较高的计算精度和收敛性,特别是边界层的数值解精度明显优于选择固定网格参数时的结果.     

Hull-White模型中参数校准的正则化方法

基于Hull-White模型,研究由零息债券的市场价格进行参数校准的问题.构造函数将问题转化为正则化问题,并利用正则化方法得到解的存在性,稳定性和所满足的必要条件.最后利用必要条件进行数值计算,给出了数值模拟算例和实证分析,数值结果表明了方法中引入正则项的有效性,且改善了其参数的稳定性,具有实际意义.     

求解病态问题的一种改进的Tikhonov正则化--(1)正则化方法的建立

对于带有右端扰动数据的第一类紧算子方程的病态问题 ,本文应用正则化子建立了一类新的正则化求解方法 ,称之为改进的Tikonov正则化 ;通过适当选取正则参数 ,证明了正则解具有最优的渐近收敛阶 .与通常的Tikhonov正则化相比 ,这种改进的正则化可使正则解取到足够高的最优渐近阶     

求解病态问题的一种改进的Tikhonov正则化：⑴正则化方法的建立

对于带有右扰动数据的第一类紧算子方程的病态问题。本文应用正则化子建立了一类新的正则化求解方法,称之为改进的Ｔｉｋｏｎｏｖ正则化;通过适当选取２正则参数,证明了正则解具有最优的渐近收敛阶,与通常的Ｔｉｋｈｏｎｏｖ正则化相比,这种改进的正则化可使正则解取到足够高的最优渐近阶。     

求解非光滑方程组的三次正则化方法

考虑求解非光滑方程组的三次正则化方法及其收敛性分析.利用信赖域方法的技巧,保证该方法是全局收敛的.在子问题非精确求解和BD正则性条件成立的前提下,分析了非光滑三次正则化方法的局部收敛速度.最后,数值实验结果验证了该算法的有效性.     

Half thresholding eigenvalue algorithm for semidefinite matrix completion

The semidefinite matrix completion(SMC) problem is to recover a low-rank positive semidefinite matrix from a small subset of its entries. It is well known but NP-hard in general. We first show that under some cases, SMC problem and S1/2relaxation model share a unique solution. Then we prove that the global optimal solutions of S1/2regularization model are fixed points of a symmetric matrix half thresholding operator. We give an iterative scheme for solving S1/2regularization model and state convergence analysis of the iterative sequence.Through the optimal regularization parameter setting together with truncation techniques, we develop an HTE algorithm for S1/2regularization model, and numerical experiments confirm the efficiency and robustness of the proposed algorithm.     

Adaptive Choice of the Regularization Parameter in Numerical Differentiation

We investigate a novel adaptive choice rule of the Tikhonov regularization parameter in numerical differentiation which is a classic ill-posed problem. By assuming a general unknown Hölder type error estimate derived for numerical differentiation, we choose a regularization parameter in a geometric set providing a nearly optimal convergence rate with very limited a-priori information. Numerical simulation in image edge detection verifies reliability and efficiency of the new adaptive approach.     

A numerical technique for solving IHCPs using Tikhonov regularization method

This study is intended to provide a numerical algorithm for solving a one-dimensional inverse heat conduction problem. The given heat conduction equation, the boundary conditions, and the initial condition are presented in a dimensionless form. The numerical approach is developed based on the use of the solution to the auxiliary problem as a basis function. To regularize the resultant ill-conditioned linear system of equations, we apply the Tikhonov regularization method to obtain the stable numerical approximation to the solution.     

Tikhonov regularization for infeasible absolute value equations

We investigate the optimum correction of an absolute value equation by minimally changing the coefficient matrix and right-hand side vector using Tikhonov regularization. Solving this problem is equivalent to minimizing the sum of fractional quadratic and quadratic functions. The primary difficulty with this problem is its nonconvexity. Nonetheless, we show that a global optimal solution to this problem can be found by solving an equation on a closed interval using the subgradient method. Some examples are provided to illustrate the efficiency and validity of the proposed method.     

An inverse problem of Bilayer textile thickness determination in dynamic heat and moisture transfer

An inverse problem of bilayer textile thickness determination in dynamic heat and moisture transfer is presented satisfying the heat–moisture comfort level of human body. Heat and mass transfer law in bilayer textiles is displayed by proving the existence and uniqueness of solution to the coupled partial differential equations with initial-boundary value conditions. The finite difference method is employed to derive the numerical solution to partial differential equations. The regularized solution of the inverse problem is reformulated into solving function minimum problem through the Tikhonov regularization method. The golden section method is applied to solve the direct search problem and achieve the optimal solution to the inverse problem. Numerical algorithm and its numerical results provide theoretical explanation for textile materials research and development.     

A one-parametric class of smoothing functions and an improved regularization Newton method for the NCP

In this paper, we introduce a one-parametric class of smoothing functions, which enjoys some favourable properties and includes two famous smoothing functions as special cases. Based on this class of smoothing functions, we propose a regularization Newton method for solving the non-linear complementarity problem. The main feature of the proposed method is that it uses a perturbed Newton equation to obtain the direction. This not only allows our method to have global and local quadratic convergences without strict complementarity conditions, but also makes the regularization parameter converge to zero globally Q-linearly. In addition, we use a new non-monotone line search scheme to obtain the step size. Some numerical results are reported which confirm the good theoretical properties of the proposed method.     

Robust Solution to Fuzzy Identification Problem with Uncertain Data by Regularization

This study considers the robust identification of the parameters describing a Sugeno type fuzzy inference system with uncertain data. The objective is to minimize the worst-case residual error using a numerically efficient algorithm. The Sugeno type fuzzy systems are linear in consequent parameters but nonlinear in antecedent parameters. The robust consequent parameters identification problem can be formulated as second-order cone programming problem. The optimal solution of this second-order cone problem can be interpreted as solution of a Tikhonov regularization problem with a special choice of regularization parameter which is optimal for robustness (Ghaoui and Lebret (1997). SAIM Journal of Matrix Analysis and Applications 18, 1035–1064). The final regularized nonlinear optimization problem allowing simultaneous identification of antecedent and consequent parameters is solved iteratively using a generalized Gauss–Newton like method. To illustrate the approach, several simulation studies on numerical examples including the modelling of a spectral data function (one-dimensional benchmark example) is provided. The proposed robust fuzzy identification scheme has been applied to approximate the physical fitness of patients with a fuzzy expert system. The identified fuzzy expert system is shown to be capable of capturing the decisions (experiences) of a medical expert.     

A Joint Tikhonov Regularization and Augmented Lagrange Approach for Ill-Posed State Constrained Control Problems with Sparse Controls

Abstract

We provide a modified augmented Lagrange method coupled with a Tikhonov regularization for solving ill-posed state constrained elliptic optimal control problems with sparse controls. We consider a linear quadratic optimal control problem without any additional L² regularization terms. The sparsity is guaranteed by an additional L¹ term. Here, the modification of the classical augmented Lagrange method guarantees us uniform boundedness of the multiplier that corresponds to the state constraints. We present a coupling between the regularization parameter introduced by the Tikhonov regularization and the penalty parameter from the augmented Lagrange method, which allows us to prove strong convergence of the controls and their corresponding states. Moreover, convergence results proving the weak convergence of the adjoint state and weak*-convergence of the multiplier are provided. Finally, we demonstrate our method in several numerical examples.     

Optimal simulation of nonlinear deterministic dynamic systems

A stable solution of the problem of optimal simulation of nonlinear deterministic dynamic systems is obtained by Tikhonov's regularization method with posterior choice of the regularization parameter for nonlinear problems. This approach ensures convergence of the approximations to the set of exact solutions of the optimal simulation problem. An example demonstrating the possibilities and the numerical implementation of the algorithm is considered.Translated from Nelineinye Dinamicheskie Sistemy: Kachestvennyi Analiz i Upravlenie — Sbornik Trudov, No. 2, pp. 86–91, 1993.