| 词条 | Artelys Knitro |
| 释义 |
| name = Artelys Knitro | designer = {{ubl|Richard Waltz|Jorge Nocedal|Todd Plantenga|Richard Byrd}} | developer = Artelys | license = Proprietary | website = {{URL|https://www.artelys.com/en/optimization-tools/knitro|Artelys Knitro}} | year = {{Start date|2001}} | latest_release_version = 11.1 | latest_release_date = {{Start date and age|2018|11|01}} | operating_system = Cross-platform | genre = Algebraic Modeling Language (AML) }} Artelys Knitro [1] is a commercial software package for solving large scale nonlinear mathematical optimization problems. KNITRO – (the original solver name) short for "Nonlinear Interior point Trust Region Optimization" (the "K" is silent) – was co-created by Richard Waltz, Jorge Nocedal, Todd Plantenga and Richard Byrd. It was first introduced in 2001, as a derivative of academic research at Northwestern University (through Ziena Optimization LLC), and has since been continually improved by developers at Artelys. Optimization problems must be presented to Knitro in mathematical form, and should provide a way of computing function derivatives using sparse matrices (Knitro can compute derivatives approximation but in most cases providing the exact derivatives is beneficial). An often easier approach is to develop the optimization problem in an algebraic modeling language. The modeling environment computes function derivatives, and Knitro is called as a "solver" from within the environment. Problem classes solved by Artelys KnitroKnitro is specialized for nonlinear optimization but also solves a wide range of optimization problems:
AlgorithmsArtelys Knitro contains a wide range of optimization algorithms. NonLinear Programming (NLP) solverKnitro offers four different optimization algorithms for solving optimization problems[2]. Two algorithms are of the interior point type, and two are of the active set type. These algorithms are known to have fundamentally different characteristics; for example, interior point methods follow a path through the interior of the feasible region while active set methods tend to stay at the boundaries. Knitro provides both types of algorithm for greater flexibility in solving problems, and allows crossover during the solution process from one algorithm to another. The code also provides a multistart option for promoting the computation of the global minimum.
Mixed-Integer NonLinear Programming (MINLP) solverKnitro provides tools for solving optimization models (both linear and nonlinear) with binary or integer variables. The Knitro mixed integer programming (MIP) code offers three algorithms for mixed-integer nonlinear programming (MINLP)[3]:
FeaturesArtelys Knitro supports a variety of programming and modeling languages including[4].
Artelys Knitro also includes a number of key features:
References
External links1. ^[https://www.artelys.com/en/optimization-tools/knitro Artelys Knitro Website] 2. ^[https://www.artelys.com/tools/knitro_doc/2_userGuide/algorithms.html Artelys Knitro NLP algorithms] 3. ^[https://www.artelys.com/tools/knitro_doc/2_userGuide/minlp.html Artelys Knitro MINLP algorithms] 4. ^[https://www.artelys.com/en/optimization-tools/knitro#features-tab Artelys Knitro Features] 5. ^[https://www.artelys.com/tools/knitro_doc/ Artelys Knitro User's Manual]
2 : Numerical software|Mathematical optimization software |
| 随便看 |
|
开放百科全书收录14589846条英语、德语、日语等多语种百科知识，基本涵盖了大多数领域的百科知识，是一部内容自由、开放的电子版国际百科全书。