Welcome![Sign In][Sign Up]
Location:
Search - saddle point method

Search list

[Mathimatics-Numerical algorithmsGauss_Constrained_Optimization.ZIP

Description: CO is an applications module written in the GAUSS programming language. It solves the Nonlinear Programming problem, subject to general constraints on the parameters - linear or nonlinear, equality or inequality, using the Sequential Quadratic Programming method in combination with several descent methods selectable by the user - Newton-Raphson, quasi-Newton (BFGS and DFP), and scaled quasi-Newton. There are also several selectable line search methods. A Trust Region method is also available which prevents saddle point solutions. Gradients can be user-provided or numerically calculated. -CO is an applications module written in the GAUSS programming language. It solves the Nonlinear Programming problem, subject to general constraints on the parameters- linear or nonlinear, equality or inequality, using the Sequential Quadratic Programming method in combination with several descent methods selectable by the user- Newton-Raphson, quasi-Newton (BFGS and DFP), and scaled quasi-Newton. There are also several selectable line search methods. A Trust Region method is also available which prevents saddle point solutions. Gradients can be user-provided or numerically calculated.
Platform: | Size: 37888 | Author: 王知章 | Hits:

[Special EffectsSathod

Description: 鞍点搜索粘连对象图像分割方法Saddle point search adhesion object segmentation method-Saddle point search adhesion object segmentation method
Platform: | Size: 975872 | Author: tin99 | Hits:

[matlabsteepdes

Description: In mathematics, the method of steepest descent or stationary phase method or saddle-point method is an extension of Laplace s method for approximating an integral, where one deforms a contour integral in the complex plane to pass near a stationary point (saddle point), in roughly the direction of steepest descent or stationary phase.
Platform: | Size: 1024 | Author: suci ariani | Hits:

[matlabStokes_PIU_Sparse

Description: Stokes 方程的有限元方法求解,利用PIU方法求解离散得到的鞍点方程组-Stokes equations, finite element method for the use of the the PIU method of solving the discrete get saddle point equations
Platform: | Size: 15360 | Author: shs3701001 | Hits:

[Mathimatics-Numerical algorithmsprogamming

Description: 各种算法比如矩阵鞍点,分划,n阶乘,螺旋阵,穿越沙漠,二分法求解方程,百鸡问题,残缺棋盘,贪心法删数,矩阵乘法动态规划。。。等等,亲测可以运行。-Various algorithms such as matrix saddle point, partition, n factorial, spiral array, through the desert, the dichotomy solve the equations, one hundred chicken issue, incomplete chessboard, delete a few greedy method, dynamic programming matrix multiplication. . . And so on, pro-test to run.
Platform: | Size: 247808 | Author: 张潇 | Hits:

CodeBus www.codebus.net