A Quasi-Newton method in Infinite-dimensional Spaces (QNIS) for solving operator equations is presellted and the convergence of a sequence generated by QNIS is also proved in the paper. Next, we suggest a finite-dimen...A Quasi-Newton method in Infinite-dimensional Spaces (QNIS) for solving operator equations is presellted and the convergence of a sequence generated by QNIS is also proved in the paper. Next, we suggest a finite-dimensional implementation of QNIS and prove that the sequence defined by the finite-dimensional algorithm converges to the root of the original operator equation providing that the later exists and that the Frechet derivative of the governing operator is invertible. Finally, we apply QNIS to an inverse problem for a parabolic differential equation to illustrate the efficiency of the finite-dimensional algorithm.展开更多
A quasi-Newton method (QNM) for solving an unconstrained optimization problem in infinite dimensional spaces is presented in this paper. We apply the QNM algorithm to an identification problem for a nonlinear system o...A quasi-Newton method (QNM) for solving an unconstrained optimization problem in infinite dimensional spaces is presented in this paper. We apply the QNM algorithm to an identification problem for a nonlinear system of differential equations, that is, to identify the parameter vector q = q(t) appearing in the following system of differential equations, based on the measurement of the state , where is a measurement operator. We give two examples to show the algorithm.展开更多
An algorithm for solving nonlinear least squares problems with general linear inequality constraints is described.At each step,the problem is reduced to an unconstrained linear least squares problem in a subs pace def...An algorithm for solving nonlinear least squares problems with general linear inequality constraints is described.At each step,the problem is reduced to an unconstrained linear least squares problem in a subs pace defined by the active constraints,which is solved using the quasi-Newton method.The major update formula is similar to the one given by Dennis,Gay and Welsch (1981).In this paper,we state the detailed implement of the algorithm,such as the choice of active set,the solution of subproblem and the avoidance of zigzagging.We also prove the globally convergent property of the algorithm.展开更多
Nonlinear complementarity problems (NCP) are a kind of important problem presenting in mathematical physics and economic management, whose numerical solution has recently been paid more attention to (see Refs. [1—5] ...Nonlinear complementarity problems (NCP) are a kind of important problem presenting in mathematical physics and economic management, whose numerical solution has recently been paid more attention to (see Refs. [1—5] and their references). Newton method and quasi-Newton methods are considerable approaches for solving NCP. There is a perfect semilocal convergence theory of the Newton method and quasi-Newton methods for solving the system of nonlinear equations.展开更多
Trust region (TR) algorithms are a class of recently developed algorithms for nonlinear optimization. A new family of TR algorithms for unconstrained optimization, which is the extension of the usual TR method, is pre...Trust region (TR) algorithms are a class of recently developed algorithms for nonlinear optimization. A new family of TR algorithms for unconstrained optimization, which is the extension of the usual TR method, is presented in this paper. When the objective function is bounded below and continuously, differentiable, and the norm of the Hesse approximations increases at most linearly with the iteration number, we prove the global convergence of the algorithms. Limited numerical results are reported, which indicate that our new TR algorithm is competitive.展开更多
文摘A Quasi-Newton method in Infinite-dimensional Spaces (QNIS) for solving operator equations is presellted and the convergence of a sequence generated by QNIS is also proved in the paper. Next, we suggest a finite-dimensional implementation of QNIS and prove that the sequence defined by the finite-dimensional algorithm converges to the root of the original operator equation providing that the later exists and that the Frechet derivative of the governing operator is invertible. Finally, we apply QNIS to an inverse problem for a parabolic differential equation to illustrate the efficiency of the finite-dimensional algorithm.
基金This research is partially supported by the National Natural Science Foundation of China(No. 69774012).
文摘A quasi-Newton method (QNM) for solving an unconstrained optimization problem in infinite dimensional spaces is presented in this paper. We apply the QNM algorithm to an identification problem for a nonlinear system of differential equations, that is, to identify the parameter vector q = q(t) appearing in the following system of differential equations, based on the measurement of the state , where is a measurement operator. We give two examples to show the algorithm.
基金Supported by The Natural Science Fundations of China and Jiangsu
文摘An algorithm for solving nonlinear least squares problems with general linear inequality constraints is described.At each step,the problem is reduced to an unconstrained linear least squares problem in a subs pace defined by the active constraints,which is solved using the quasi-Newton method.The major update formula is similar to the one given by Dennis,Gay and Welsch (1981).In this paper,we state the detailed implement of the algorithm,such as the choice of active set,the solution of subproblem and the avoidance of zigzagging.We also prove the globally convergent property of the algorithm.
基金Project supported by the National Education Committee Science and Technology Foundation for Doctor Program Group.
文摘Nonlinear complementarity problems (NCP) are a kind of important problem presenting in mathematical physics and economic management, whose numerical solution has recently been paid more attention to (see Refs. [1—5] and their references). Newton method and quasi-Newton methods are considerable approaches for solving NCP. There is a perfect semilocal convergence theory of the Newton method and quasi-Newton methods for solving the system of nonlinear equations.
基金Research partly supported by Chinese NSF grants 19731001 and 19801033. The second author gratefully acknowledges the support of Natoinal 973 Information Fechnology and High-Performance Software Program of China with grant No. G1998030401 and K. C. Wong E
文摘Trust region (TR) algorithms are a class of recently developed algorithms for nonlinear optimization. A new family of TR algorithms for unconstrained optimization, which is the extension of the usual TR method, is presented in this paper. When the objective function is bounded below and continuously, differentiable, and the norm of the Hesse approximations increases at most linearly with the iteration number, we prove the global convergence of the algorithms. Limited numerical results are reported, which indicate that our new TR algorithm is competitive.
