Description: 上述算法的终止准则为H终止准则。
编写通用程序。：
直线搜索所计算的函数自己任选。①计算一个正定二次函数（至少是4元函数）；②至少计算一个非二次函数（至少是5元函数）。
非线性最小二乘问题的修正Gauss-Newton法所计算的函数：至少计算一个非线性函数（至少是5元函数）。
乘子法所计算的问题：等式约束、不等式约束要求至少各有一个。问题可在教材或其它参考书中任意选取。
程序自行编写（禁止采用调用现成软件的方式），编程语言自选。从独立完成所有实验内容的学生中遴选出-above algorithm criteria for the termination of H termination criteria. Preparation of common procedures. : Linear search function by calculating their options. calculate a definite quadratic function (at least four yuan function); calculated at least one non-quadratic function (at least five yuan functions). The nonlinear least squares problems that Gauss-Newton method by calculating function : at least a nonlinear function computing (at least five yuan functions). Multiplier Method calculation problem : identity bound inequality constraints have required at least one. Problems in reference books or other materials were selected at random. Self-preparation procedure (called ban on the use of existing software), on-demand programming language. From an experimental content complete all of Platform: |
Size: 14358 |
Author:洪男 |
Hits:
Description: 上述算法的终止准则为H终止准则。要求编写通用程序。
关于函数的要求：
直线搜索所计算的函数自己任选。
共轭梯度法所计算的函数：①计算一个正定二次函数（至少是4元函数）；②至少计算一个非二次函数（至少是5元函数）。
非线性最小二乘问题的修正Gauss-Newton法所计算的函数：至少计算一个非线性函数（至少是5元函数）。
乘子法所计算的问题：等式约束、不等式约束要求至少各有一个。问题可在教材或其它参考书中任意选取。
程序自行编写（禁止采用调用现成软件的方式），编程语言自选。
-above algorithm criteria for the termination of H termination criteria. Requests for common procedures. The demands on function : linear search function by calculating their options. The conjugate gradient method by calculating function : calculate a definite quadratic function (at least four yuan function); calculated at least one non-quadratic function (at least five yuan functions). The nonlinear least squares problems that Gauss-Newton method by calculating function : at least a nonlinear function computing (at least five yuan functions). Multiplier Method calculation problem : identity bound inequality constraints have required at least one. Problems in reference books or other materials were selected at random. Self-preparation procedure (called ban on the use of existing software) Platform: |
Size: 9632 |
Author:洪男 |
Hits:
Description: LINDO用于求解线性规划和二次规划问题，LINGO除了具有LINDO的全部功能外，还可以用于求解非线性规划问题，也可以用于一些线性和非线性方程(组)的求解，等等。-LINDO for solving linear programming and quadratic programming problems, LINDO LINGO addition to the full functionality, but also can be used for nonlinear programming problem some also can be used for linear and nonlinear equations (Group I) solution, and so on. Platform: |
Size: 2730408 |
Author:十分 |
Hits:
Description: 上述算法的终止准则为H终止准则。
编写通用程序。：
直线搜索所计算的函数自己任选。①计算一个正定二次函数（至少是4元函数）；②至少计算一个非二次函数（至少是5元函数）。
非线性最小二乘问题的修正Gauss-Newton法所计算的函数：至少计算一个非线性函数（至少是5元函数）。
乘子法所计算的问题：等式约束、不等式约束要求至少各有一个。问题可在教材或其它参考书中任意选取。
程序自行编写（禁止采用调用现成软件的方式），编程语言自选。从独立完成所有实验内容的学生中遴选出-above algorithm criteria for the termination of H termination criteria. Preparation of common procedures. : Linear search function by calculating their options. calculate a definite quadratic function (at least four yuan function); calculated at least one non-quadratic function (at least five yuan functions). The nonlinear least squares problems that Gauss-Newton method by calculating function : at least a nonlinear function computing (at least five yuan functions). Multiplier Method calculation problem : identity bound inequality constraints have required at least one. Problems in reference books or other materials were selected at random. Self-preparation procedure (called ban on the use of existing software), on-demand programming language. From an experimental content complete all of Platform: |
Size: 14336 |
Author:洪男 |
Hits:
Description: 上述算法的终止准则为H终止准则。要求编写通用程序。
关于函数的要求：
直线搜索所计算的函数自己任选。
共轭梯度法所计算的函数：①计算一个正定二次函数（至少是4元函数）；②至少计算一个非二次函数（至少是5元函数）。
非线性最小二乘问题的修正Gauss-Newton法所计算的函数：至少计算一个非线性函数（至少是5元函数）。
乘子法所计算的问题：等式约束、不等式约束要求至少各有一个。问题可在教材或其它参考书中任意选取。
程序自行编写（禁止采用调用现成软件的方式），编程语言自选。
-above algorithm criteria for the termination of H termination criteria. Requests for common procedures. The demands on function : linear search function by calculating their options. The conjugate gradient method by calculating function : calculate a definite quadratic function (at least four yuan function); calculated at least one non-quadratic function (at least five yuan functions). The nonlinear least squares problems that Gauss-Newton method by calculating function : at least a nonlinear function computing (at least five yuan functions). Multiplier Method calculation problem : identity bound inequality constraints have required at least one. Problems in reference books or other materials were selected at random. Self-preparation procedure (called ban on the use of existing software) Platform: |
Size: 9216 |
Author:洪男 |
Hits:
Description: 离散二次线性系统最优控制问题的MAtlab
原程序代码-Discrete linear systems with quadratic optimal control problem of the original Matlab code Platform: |
Size: 1024 |
Author:刘璐 |
Hits:
Description: 用matlab解决线性回归问题，在约束条件下求解二次回归问题的极小值-Using matlab to solve linear regression problems, in the constraint solving quadratic regression under the condition of the minimum problem Platform: |
Size: 1024 |
Author:淡茶 |
Hits:
Description: 通过对经典的lemke互补转轴算法求解含有等式约束的凸二次规划问题的分析，发现所得到的线性互补问题(lcp)可能是退化的．由lemke算法求解(lcp)问题的迭代过程，通过六个命题说明了含有等式约束的凸二次规划问题对应的(lcp)问题退化的原因，并对经典的lemke算法的迭代过程进行修正，提出了一种改进的lemke算法，这种算法能有效地搜索到含等式约束凸二次规划问题的最优解．-Through the classic Lemke complementarity algorithm shaft containing the convex equality constrained quadratic programming problem of the analysis, we found by the linear complementarity problem (lcp) may be degraded. Algorithm by Lemke (lcp) of the iterative process of questions, through the six propositions that contain equality constraints of convex quadratic programming problem corresponding to (lcp) questions the reasons for degradation of the classic Lemke algorithm iterative process amendments put forward an improved Lemke algorithm can effectively containing english convex equality constrained quadratic programming problem of the optimal solution. Platform: |
Size: 6144 |
Author:王旭 |
Hits:
Description: The Kalman filter is an efficient recursive filter that estimates the state of a linear dynamic system from a series of noisy measurements. It is used in a wide range of engineering applications from radar to computer vision, and is an important topic in control theory and control systems engineering. Together with the linear-quadratic regulator (LQR), the Kalman filter solves the linear-quadratic-Gaussian control problem (LQG). The Kalman filter, the linear-quadratic regulator and the linear-quadratic-Gaussian controller are solutions to what probably are the most fundamental problems in control theory. Platform: |
Size: 306176 |
Author:vignesh |
Hits:
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:
Description: 这是龚纯《精通MATLAB最优化计算》随书源码(M文件)。基于MATLAB优化工具箱，代码包含的内容有：牛顿法等无约束一维极值问题、单纯形搜索法等无约束多维极值问题、Rosen梯度投影法等约束优化问题、L-M法等非线性最小二乘优化问题、线性规划、整数规划、二次规划、粒子群优化、遗传算法。-This is pure Gong " Mastering MATLAB optimization calculations," with the book source (M file). Based on MATLAB Optimization Toolbox, the content code contains: Newton and other non-binding one-dimensional extremum problems, such as simplex search method for unconstrained multi-dimensional extremum problems, Rosen gradient projection method and other constrained optimization problems, LM non-linear law least squares optimization problem, linear programming, integer programming, quadratic programming, particle swarm optimization, genetic algorithm. Platform: |
Size: 41984 |
Author:吴 |
Hits:
Description: 鲁棒控制与鲁棒控制器设计:
1、线性二次型 Gauss 控制
2、鲁棒控制问题的一般描述
3、鲁棒控制器的计算机辅助设计
4、新鲁棒控制工具箱及应用
5、分数阶控制系统分析与设计-Robust control and robust controller design: linear quadratic Gauss control, a general description of the robust control problem, the computer-aided design of robust controller 4 new Robust Control Toolbox and Application 5 Fractional Control System Analysis and Design Platform: |
Size: 2184192 |
Author:王华 |
Hits:
Description: 二次规划师非线性优化中的一种特殊情形，它的目标函数是二次实函数，约束函数都是线性函数。由于二次规划比较简单，便于求解（仅次于线性规划），并且一些非线性优化问题可以转化为求解一些列的二次规划问题，因此二次规划的求解方法较早引起人们的重视，称为求解非线性优化的一个重要途径。二次规划的算法较多，本文仅介绍求解等式约束凸二尺规划的拉格朗日方法以及求解一般约束凸二次规划的有效集方法。-Quadratic nonlinear optimization planners in a special case, its real objective function is a quadratic function, constraint functions are linear functions. Because of quadratic programming is relatively simple and easy to solve (after linear programming), and some non-linear optimization problem can be transformed into solving quadratic programming problems some columns, solving quadratic programming method therefore attracted attention earlier, saying an important way for solving nonlinear optimization. More quadratic programming algorithm, this paper describes only two feet Solving the Equality Constrained Convex Programming effective Lagrangian method and set method for solving general constrained convex quadratic programming. Platform: |
Size: 100352 |
Author:王彭 |
Hits:
Description: 最优控制中的LQR程序，利用这个程序可以解决一些线性二次型问题-LQR optimal control procedures, the use of this program can solve some linear quadratic problem Platform: |
Size: 1024 |
Author:瑞 |
Hits:
Description: olve the deterministic finite-horizon optimal control problem with the iLQG (iterative Linear Quadratic Gaussian) or modified DDP (Differential Dynamic Programming) algorithm. Includes two demos, a linear control-constrained problem and a car-parking problem. For details see
Tassa, Mansard and Todorov, Control-Limited Differential Dynamic Programming , ICRA 2014-olve the deterministic finite-horizon optimal control problem with the iLQG (iterative Linear Quadratic Gaussian) or modified DDP (Differential Dynamic Programming) algorithm. Includes two demos, a linear control-constrained problem and a car-parking problem. For details see
Tassa, Mansard and Todorov, Control-Limited Differential Dynamic Programming , ICRA 2014 Platform: |
Size: 14336 |
Author:saljoga22 |
Hits:
Description: Kalman Filter是一个高效的递归滤波器，它可以实现从一系列的噪声测量中，估 计动态系统的状态。广泛应用于包含Radar、计算机视觉在内的等工程应用领域，在控制理论和控制系统工程中也是一个非常重要的课题。连同线性均方规划，卡尔曼滤波器可以用于解决LQG(Linear-quadratic-Gaussian control)问题。卡尔曼滤波器，线性均方归化及线性均方高斯控制器，是大部分控制领域基础难题的主要解决途径。(Kalman Filter is an efficient recursive filter that can estimate the state of a dynamic system from a range of noise measurements. It is widely used in engineering applications such as Radar and computer vision, and it is also a very important subject in control theory and control system engineering. Along with linear mean square programming, the Calman filter can be used to solve the LQG (Linear-quadratic-Gaussian, control) problem. Calman filter, linear mean square adaptation and linear mean square Gauss controller are the main solutions to the basic problems in most control fields.) Platform: |
Size: 3906560 |
Author:lwzzwl
|
Hits:
Description: 在MATLAB仿真软件中实现卡尔曼滤波器，包含一些示例与案例，可供需要卡尔曼滤波的下载( The Kalman Filter is an estimator for what is called the linear-quadratic problem, which is the problem of estimating the instantaneous "state".) Platform: |
Size: 36864 |
Author:hanzb
|
Hits:
Search - linear quadratic problem