Location:
Search - constrained l
Search list
Description: Software for Large-scale Bound-constrained or Unconstrained Optimization
L-BFGS-B is a limited-memory quasi-Newton code for large-scale bound-constrained or unconstrained optimization. The code has been developed at the Optimization Technology Center, a joint venture of Argonne National Laboratory and Northwestern University.
Platform: |
Size: 266240 |
Author: 徐志平 |
Hits:
Description: Constrained LCS. Given two sequences X, Y and a constrained sequence P, a sequence Z is a constrained longest common subsequence for X and Y with respect to P if Z is the longest subsequence of X and Y such that P is a subsequence of Z.
Platform: |
Size: 7168 |
Author: Austin |
Hits:
Description: 给出变量的上下边界、初值和代价函数，能够搜索代价函数最小值时的变量取值。属于带约束的优化算法，可以用来求算非线性方程组。-STRSCNE is a Matlab code for constrained nonlinear systems of equations
F(x)=0 l<=x<=u
where F: R^n--> R^n, l and u are vectors of dimension n. Non-existent lower and upper bounds, i.e.
entries of l and u equal to minus o plus infinity, are allowed.
The algorithm is a globally convergent procedure that combines Newton method and an elliptical trust-region approach. The elliptical trust-region is defined employing a scaling diagonal matrix D
and the trust-region subproblem is approximately solved by the dogleg method. Only strictly feasible iterates are generated.
Various input/output options are provided, and we refer to the code itself for further documentation.
Platform: |
Size: 5120 |
Author: muxihan |
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: Calculates displacement as function of time for a 1D bar subject to uniform body force, constrained so u=0 at x=0 and subjected to prescribed traction at x=L.
Platform: |
Size: 2048 |
Author: lee |
Hits:
Description: Berkeley DB Java Edition (JE)是一个完全用JAVA 写的，它适合于管理海量的，简单的
数据。
l 能够高效率的处理 1 到 1 百万条记录，制约 JE 数据库的往往是硬件系统,而不是
JE 本身。
多线程支持，JE 使用超时的方式来处理线程间的死琐问题。
Database 都采用简单的 key/value对应的形式。
事务支持。
允许创建二级库。这样我们就可以方便的使用一级 key,二级 key 来访问我们的数
据。
支持RAM缓冲，这样就能减少频繁的 IO操作。
支持日志。
数据备份和恢复。
游标支持。-Berkeley DB Java Edition (JE) is a completely written in JAVA, it is suitable for managing the vast amounts of data. l capable of efficient processing 1-1 million records, JE database is often constrained by the hardware system, rather than the JE in itself. Multi-threading support, JE timeout the way to deal with the dead petty issues between threads. Database using simple key/value corresponding form. Transaction support. Allows you to create two libraries. So that we can be convenient to use a key, secondary key to access the data. Support RAM buffer, which can reduce the frequent IO operations. Support logs. Data backup and recovery. Cursor support.
Platform: |
Size: 400384 |
Author: yanjliu |
Hits:
Description: 非负约束最小二乘法丰度反演 NCLS 矩阵运算 EA=X
参考文献：[1]R. Bro, S. D. Jong,"A FAST NON-NEGATIVITY-CONSTRAINED LEAST SQUARES algorithm"
[2]Charles L. Lawson, Richard J. Hanson ,Solving Least Squares Problems (Classics in Applied Mathematics) (Society for Industrial Mathematics,1987)
[3]C.I. Chang, Hyperspectral Imaging: Techniques for Spectral Detection
and Classification, chaper 3.5- 非负约束最小二乘法丰度反演 NCLS 矩阵运算 EA=X
参考文献：[1]R. Bro, S. D. Jong,"A FAST NON-NEGATIVITY-CONSTRAINED LEAST SQUARES algorithm"
[2]Charles L. Lawson, Richard J. Hanson ,Solving Least Squares Problems (Classics in Applied Mathematics) (Society for Industrial Mathematics,1987)
[3]C.I. Chang, Hyperspectral Imaging: Techniques for Spectral Detection
and Classification, chaper 3.5
Platform: |
Size: 1024 |
Author: 庄丽 |
Hits:
Description: L-M(Levenberg—Marquardt)是一种非线性最优化里面最常用的方法之一，改方法能快速而准确的逼近收敛值。本文简述了改方法的操作原理和具体运用，如可以方便的用于有约束与无约束最优化的求解。-L- M (Levenberg- Marquardt) is a kind of nonlinear optimization inside one of the most commonly used method, change method can fast and accurate approximation convergence value.This paper briefly describes the operating principle of change method and concrete application, such as easy to solve constrained and unconstrained optimization.
Platform: |
Size: 167936 |
Author: 徐淼 |
Hits:
Description: L-M(Levenberg—Marquardt)是一种非线性最优化里面最常用的方法之一，改方法能快速而准确的逼近收敛值。本文简述了改方法的操作原理和具体运用，如可以方便的用于有约束与无约束最优化的求解。本文件里面有源码和测试码以及对该方法的具体介绍PDF文件。欢迎下载。-L- M (Levenberg- Marquardt) is a kind of nonlinear optimization inside one of the most commonly used method, change method can fast and accurate approximation convergence value.This paper briefly describes the operating principle of change method and concrete application, such as easy to solve constrained and unconstrained optimization.This document there are source code and test code as well as to the PDF file the detailed introduction of the method.Welcome to download.
Platform: |
Size: 215040 |
Author: 徐淼 |
Hits:
Description: icaam, G. Papandreou and P. Maragos,
Adaptive and Constrained Algorithms for Inverse Compositional Active Appearance Model Fitting,
Proc. IEEE Int l Conf. on Computer Vision and Pattern Recognition (CVPR-2008), Anchorage, AL, June 2008.
Platform: |
Size: 60416 |
Author: Lisa |
Hits: