Many methods have been put forward to solve unconstrained optimization problems,among which conjugate gradient method(CG)is very important.With the increasing emergence of large⁃scale problems,the subspace technology ...Many methods have been put forward to solve unconstrained optimization problems,among which conjugate gradient method(CG)is very important.With the increasing emergence of large⁃scale problems,the subspace technology has become particularly important and widely used in the field of optimization.In this study,a new CG method was put forward,which combined subspace technology and a cubic regularization model.Besides,a special scaled norm in a cubic regularization model was analyzed.Under certain conditions,some significant characteristics of the search direction were given and the convergence of the algorithm was built.Numerical comparisons show that for the 145 test functions under the CUTEr library,the proposed method is better than two classical CG methods and two new subspaces conjugate gradient methods.展开更多
In this paper,we consider a Cauchy problem of the time fractional diffusion equation(TFDE)in x∈[0,L].This problem is ubiquitous in science and engineering applications.The illposedness of the Cauchy problem is explai...In this paper,we consider a Cauchy problem of the time fractional diffusion equation(TFDE)in x∈[0,L].This problem is ubiquitous in science and engineering applications.The illposedness of the Cauchy problem is explained by its solution in frequency domain.Furthermore,the problem is formulated into a minimization problem with a modified Tikhonov regularization method.The gradient of the regularization functional based on an adjoint problem is deduced and the standard conjugate gradient method is presented for solving the minimization problem.The error estimates for the regularized solutions are obtained under Hp norm priori bound assumptions.Finally,numerical examples illustrate the effectiveness of the proposed method.展开更多
Image restoration is often solved by minimizing an energy function consisting of a data-fidelity term and a regularization term.A regularized convex term can usually preserve the image edges well in the restored image...Image restoration is often solved by minimizing an energy function consisting of a data-fidelity term and a regularization term.A regularized convex term can usually preserve the image edges well in the restored image.In this paper,we consider a class of convex and edge-preserving regularization functions,i.e.,multiplicative half-quadratic regularizations,and we use the Newton method to solve the correspondingly reduced systems of nonlinear equations.At each Newton iterate,the preconditioned conjugate gradient method,incorporated with a constraint preconditioner,is employed to solve the structured Newton equation that has a symmetric positive definite coefficient matrix. The eigenvalue bounds of the preconditioned matrix are deliberately derived,which can be used to estimate the convergence speed of the preconditioned conjugate gradient method.We use experimental results to demonstrate that this new approach is efficient, and the effect of image restoration is reasonably well.展开更多
A class of regularized conjugate gradient methods is presented for solving the large sparse system of linear equations of which the coefficient matrix is an ill-conditioned symmetric positive definite matrix. The conv...A class of regularized conjugate gradient methods is presented for solving the large sparse system of linear equations of which the coefficient matrix is an ill-conditioned symmetric positive definite matrix. The convergence properties of these methods are discussed in depth, and the best possible choices of the parameters involved in the new methods are investigated in detail. Numerical computations show that the new methods are more efficient and robust than both classical relaxation methods and classical conjugate direction methods.展开更多
结构动载荷识别反问题是典型的病态问题,需要应用正则方法克服其病态特性而获得稳定的解。与直接正则化算法Tikhonov方法相比,共轭梯度最小二乘(Conjugate Gradient Least Squares,CGLS)迭代算法在载荷识别反问题的正则化过程有无须对...结构动载荷识别反问题是典型的病态问题,需要应用正则方法克服其病态特性而获得稳定的解。与直接正则化算法Tikhonov方法相比,共轭梯度最小二乘(Conjugate Gradient Least Squares,CGLS)迭代算法在载荷识别反问题的正则化过程有无须对传递矩阵求逆、无须明确正则化参数的优点。提出共轭梯度最小二乘迭代正则化算法和启发式迭代收敛终止准则,用于三自由度仿真模型和壳结构试验模型的冲击载荷识别,并与经典的Landweber迭代正则化算法和直接正则化算法Tikhonov方法比较。仿真和实验结果表明:CGLS迭代正则化算法在识别精度、收敛速度、计算效率和抗噪性方面有明显优势。展开更多
基金Sponsored by the National Natural Science Foundation of China(Grant No.11901561).
文摘Many methods have been put forward to solve unconstrained optimization problems,among which conjugate gradient method(CG)is very important.With the increasing emergence of large⁃scale problems,the subspace technology has become particularly important and widely used in the field of optimization.In this study,a new CG method was put forward,which combined subspace technology and a cubic regularization model.Besides,a special scaled norm in a cubic regularization model was analyzed.Under certain conditions,some significant characteristics of the search direction were given and the convergence of the algorithm was built.Numerical comparisons show that for the 145 test functions under the CUTEr library,the proposed method is better than two classical CG methods and two new subspaces conjugate gradient methods.
基金Supported by the National Natural Science Foundation of China(Grant No.11471253 and No.11571311)
文摘In this paper,we consider a Cauchy problem of the time fractional diffusion equation(TFDE)in x∈[0,L].This problem is ubiquitous in science and engineering applications.The illposedness of the Cauchy problem is explained by its solution in frequency domain.Furthermore,the problem is formulated into a minimization problem with a modified Tikhonov regularization method.The gradient of the regularization functional based on an adjoint problem is deduced and the standard conjugate gradient method is presented for solving the minimization problem.The error estimates for the regularized solutions are obtained under Hp norm priori bound assumptions.Finally,numerical examples illustrate the effectiveness of the proposed method.
基金supported by the National Basic Research Program (No.2005CB321702)the National Outstanding Young Scientist Foundation(No. 10525102)the Specialized Research Grant for High Educational Doctoral Program(Nos. 20090211120011 and LZULL200909),Hong Kong RGC grants and HKBU FRGs
文摘Image restoration is often solved by minimizing an energy function consisting of a data-fidelity term and a regularization term.A regularized convex term can usually preserve the image edges well in the restored image.In this paper,we consider a class of convex and edge-preserving regularization functions,i.e.,multiplicative half-quadratic regularizations,and we use the Newton method to solve the correspondingly reduced systems of nonlinear equations.At each Newton iterate,the preconditioned conjugate gradient method,incorporated with a constraint preconditioner,is employed to solve the structured Newton equation that has a symmetric positive definite coefficient matrix. The eigenvalue bounds of the preconditioned matrix are deliberately derived,which can be used to estimate the convergence speed of the preconditioned conjugate gradient method.We use experimental results to demonstrate that this new approach is efficient, and the effect of image restoration is reasonably well.
基金Subsidized by The Special Funds For Major State Basic Research Projects G1999032803.
文摘A class of regularized conjugate gradient methods is presented for solving the large sparse system of linear equations of which the coefficient matrix is an ill-conditioned symmetric positive definite matrix. The convergence properties of these methods are discussed in depth, and the best possible choices of the parameters involved in the new methods are investigated in detail. Numerical computations show that the new methods are more efficient and robust than both classical relaxation methods and classical conjugate direction methods.
文摘结构动载荷识别反问题是典型的病态问题,需要应用正则方法克服其病态特性而获得稳定的解。与直接正则化算法Tikhonov方法相比,共轭梯度最小二乘(Conjugate Gradient Least Squares,CGLS)迭代算法在载荷识别反问题的正则化过程有无须对传递矩阵求逆、无须明确正则化参数的优点。提出共轭梯度最小二乘迭代正则化算法和启发式迭代收敛终止准则,用于三自由度仿真模型和壳结构试验模型的冲击载荷识别,并与经典的Landweber迭代正则化算法和直接正则化算法Tikhonov方法比较。仿真和实验结果表明:CGLS迭代正则化算法在识别精度、收敛速度、计算效率和抗噪性方面有明显优势。
