L. Qi, “Superlinearly Convergent Approximate Newton Methods for LC1 Optimization Problems,” Math. Program. 64 , 277–294 (1994). MATHQi, L. , Superlinearly Convergent Approximate Newton Methods for LC 1 Optimiziation Problems , Mathematical Programming, Vol. 64, pp. 277–294, 1994....
M. , Superlinearly Convergent Algorithms for Linearly Constrained Optimization , Nonlinear Programming 2, Edited by O. L. Mangasarian, Academic Press, New York, New York, pp. 101–120, 1975.Superlinearly convergent algorithms for linearly constrained optimization - Garcia--Palomares - 1975...
We present a superlinearly convergent exact penalty method for solving constrained nonlinear least squares problems, in which the projected exact penalty Hessian is approximated by using a structured secant updating scheme. We give general conditions for the two-step superlinear convergence of the algorit...
AnalysisonaSuperlinearlyConvergentAugmentedLagrangianMethod YaXiangYUAN Abstract TheaugmentedLagrangianmethodisaclassica1methodforsolvingconstrained optimization.Recently,theaugmentedLagrangianmethodattractsmuchattentionduetoits applicationstosparseoptimizationincompressivesensingandlOWrankmatrixoptimization ...
A Superlinearly Convergent Primal-Dual Infeasible-Interior-Point Algorithm for Semidefinite Programming A primal-dual infeasible-interior-point path-following algorithm is proposed for solving semidefinite programming (SDP) problems. If the problem has a solu... FA Potra,R Sheng - 《Siam Journal on ...
不详VIP数学学报(中文版)Yuan, Y.: Analysis on a superlinearly convergent augmented Lagrangian method. Acta Math. Sin. Engl. Ser. 30 (1), 1–10 (2014) MATH MathSciNetYaxiang Yuan. Analysis on a superlinearly convergent augmented Lagrangian method. Acta Math. Sinica, 30(1):1-10, 2014....
We present a globally and superlinearly convergent algorithm for solving convex quadratic programs with simple bounds. We develop our algorithm using a n... TF Coleman,LA Hulbert - 《Siam Journal on Optimization》 被引量: 57发表: 1990年 A mixed superlinearly convergent algorithm with nonmonotone ...
1) partial superlinearly convergent 部分超线性收敛性 1. The globally andpartial superlinearly convergentwith respect to thismethod is proved too. 利用拟牛顿(BFGS)法的有关思想,结合Weiszfeld法给出了一个求解形如的算法,并且证明了算法所具有的全局收敛性和部分超线性收敛性。
The proposed method uses the idea of one of the popular robust beamforming techniques named Linearly Constrained Minimum Variance (LCMV), which has been presented in the context of beamforming for signal enhancement. We will show that LCMV can improve performance by building a model ...
It is s hown that this algorithm is super-linearly convergent under certain conditions. This algorithm can overcome some shortages of traditional BP learning algorithm , and has the same order of computation complexity as the traditional BP algorit hm. Finally, two computing examples are given. ...