搜索资源列表
SQP
- 非线性回归问题SQP解法-nonlinear regression problems SQP Solution
SQP
- 非线性回归问题SQP解法-nonlinear regression problems SQP Solution
donlp2_ansi_c.tar
- sqp程序包。用sqp算法实现非线性约束的优化求解，内有帮助文档-sqp package. Sqp used algorithm of nonlinear constrained optimization, help documentation within
oldSQP__
- an old method of SQP to make the matrix much more easy to handle,especially in large-scale problems
SQP__
- an modern SQP method to make the original matrix more concise
Fletcher_R_Practical_methods_of_optimization_Volu
- SQP Algo and Optimisation explained
An_SQP_Augmented_Lagrangian_BFGS_Algorithm_for_Co
- An SQP Augmented Lagrangian BFGS Algorithm for Constrained Optimization
wanggehuafen
- SQP优化方法设计磁体程序中的网格划分模块-SQP optimization design of magnet programs meshing module
BVP_tutorial
- SQP算法的使用例子，采用Matlab语言编写-an modern SQP method of Matlab
CFSQP
- SQP程序包，功能非常强大，很实用，内有帮助文档-SQP package is very powerful
sqp_npsol
- Fortran Optimisation sqp
sqp
- SQP方法详细介绍，好东西啊，想认真学习matlab的认真看下-Details SQP method, a good thing, ah, would like to study matlab serious look. .
SQP
- 基于active-set 的SQP算法，用于求解非线性不等约束-SQP algorithm used to find a constrained minimum of a function of several variables based on active-set algorithm, subject to the nonlinear inequalities.
LAGSQP
- 功能: 用基于拉格朗日函数Hesse阵的SQP方法求解约束优化问题:-Function: Hesse matrix based on Lagrangian SQP method for solving constrained optimization problems:
SQP
- 这是基本的二次规划算法，能够帮助初学者很好的掌握二次规划的基本概念，深入理解优化设计的程序。-This is the basic quadratic programming algorithm that can help beginners a good grasp of the basic concepts of quadratic programming, in-depth understanding of optimal desi
SQP
- SQP算法的matlab实现，包括子程序的实现和整个的大问题，配合使用-The sub-problem of SQP programing
SQP
- 实现基于拉格朗日函数的hesse矩阵的SQP方法以及基于修正Hesse矩阵的SQP方法-Hesse matrix of the SQP method based on the Lagrangian function and the SQP method based on correction Hesse matrix
SQP-method
- SQP方法是求解约束优化问题最有效的算法之一-SQP method is one of the most effective algorithm for solving constrained optimization problems
SQP方法
- 序列二次规划(SQP)方法被认为是解决非线性约束优化最有效的方法之一，传统的SQP算法每一步迭代都要求解QP子问题。 (Sequential two times programming (SQP) is considered to be one of the most effective ways to solve nonlinear constrained optimization. The traditional SQP al
SQP方法
- 用sqp方法求最优化问题，改程序给出了SQP方法的详细matlab程序(Using the SQP method to aolve the optimation problem)