首页 | 本学科首页   官方微博 | 高级检索  
     

A SELF-ADAPTIVE ALGORITHM FOR NONLINEAR LEAST SQUARES WITH LINEAR CONSTRAINTS
引用本文:杨富贵,邹志鸿,盛松柏. A SELF-ADAPTIVE ALGORITHM FOR NONLINEAR LEAST SQUARES WITH LINEAR CONSTRAINTS[J]. 高等学校计算数学学报(英文版), 1995, 0(2)
作者姓名:杨富贵  邹志鸿  盛松柏
作者单位:Tangshan Institute of Technology,Tangshan 063009,PRC,Department of Mathematics,Nanjing University,Nanjing 210093,PRC,Department of Mathematics,Nanjing University,Nanjing 210093,PRC
基金项目: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.


A SELF-ADAPTIVE ALGORITHM FOR NONLINEAR LEAST SQUARES WITH LINEAR CONSTRAINTS
Yang Fu-qui Tangshan Institute of Technology,Tangshan ,PRCZou Zhi-hong. A SELF-ADAPTIVE ALGORITHM FOR NONLINEAR LEAST SQUARES WITH LINEAR CONSTRAINTS[J]. Numerical Mathematics A Journal of Chinese Universities English Series, 1995, 0(2)
Authors:Yang Fu-qui Tangshan Institute of Technology  Tangshan   PRCZou Zhi-hong
Affiliation:Yang Fu-qui Tangshan Institute of Technology,Tangshan 063009,PRCZou Zhi-hong Department of Mathematics,Nanjing University,Nanjing 210093,PRC,Sheng Song-bai Department of Mathematics,Nanjing University,Nanjing 210093,PRC
Abstract: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.
Keywords:nonlinear least squares   linear inequality constraints   quasi-Newton method   trust region method   global convergence.
本文献已被 CNKI 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号