<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>https://en.formulasearchengine.com/index.php?action=history&amp;feed=atom&amp;title=Word_lists_by_frequency</id>
	<title>Word lists by frequency - Revision history</title>
	<link rel="self" type="application/atom+xml" href="https://en.formulasearchengine.com/index.php?action=history&amp;feed=atom&amp;title=Word_lists_by_frequency"/>
	<link rel="alternate" type="text/html" href="https://en.formulasearchengine.com/index.php?title=Word_lists_by_frequency&amp;action=history"/>
	<updated>2026-04-22T18:00:44Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.43.0-wmf.28</generator>
	<entry>
		<id>https://en.formulasearchengine.com/index.php?title=Word_lists_by_frequency&amp;diff=26000&amp;oldid=prev</id>
		<title>en&gt;Yug: merge done</title>
		<link rel="alternate" type="text/html" href="https://en.formulasearchengine.com/index.php?title=Word_lists_by_frequency&amp;diff=26000&amp;oldid=prev"/>
		<updated>2014-02-02T12:35:14Z</updated>

		<summary type="html">&lt;p&gt;merge done&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;{{lead too short|date=October 2010}}&lt;br /&gt;
Given a system transforming a set of inputs to output values, described by a [[Function (mathematics)|mathematical function]] &amp;#039;&amp;#039;f&amp;#039;&amp;#039;,&lt;br /&gt;
[[Mathematical optimization|optimization]] refers to the generation and selection of a best solution from some set of available alternatives,&amp;lt;ref&amp;gt;&amp;quot;[http://glossary.computing.society.informs.org/index.php?page=nature.html The Nature of Mathematical Programming],&amp;quot; &amp;#039;&amp;#039;Mathematical Programming Glossary&amp;#039;&amp;#039;, INFORMS Computing Society.&amp;lt;/ref&amp;gt; by systematically choosing input values from within an allowed set, computing the value of the function, and recording the best value found during the process. Many real-world and theoretical problems may be modeled in this general framework. For example,&lt;br /&gt;
the inputs can be design parameters of a motor, the output can be the power consumption, or the inputs&lt;br /&gt;
can be business choices and the output can be the obtained profit, or the inputs can describe the configuration&lt;br /&gt;
of a physical system and the output can be its energy.&lt;br /&gt;
&lt;br /&gt;
An [[optimization problem]] can be represented in the following way&lt;br /&gt;
:&amp;#039;&amp;#039;Given:&amp;#039;&amp;#039; a [[function (mathematics)|function]] &amp;#039;&amp;#039;f&amp;#039;&amp;#039; : &amp;#039;&amp;#039;A&amp;#039;&amp;#039; &amp;lt;math&amp;gt;\to&amp;lt;/math&amp;gt; &amp;#039;&amp;#039;&amp;#039;R&amp;#039;&amp;#039;&amp;#039; from some [[Set (mathematics)|set]] &amp;#039;&amp;#039;A&amp;#039;&amp;#039; to the [[real number]]s&lt;br /&gt;
:&amp;#039;&amp;#039;Search for:&amp;#039;&amp;#039; an element &amp;#039;&amp;#039;x&amp;#039;&amp;#039;&amp;lt;sub&amp;gt;0&amp;lt;/sub&amp;gt; in &amp;#039;&amp;#039;A&amp;#039;&amp;#039; such that &amp;#039;&amp;#039;f&amp;#039;&amp;#039;(&amp;#039;&amp;#039;x&amp;#039;&amp;#039;&amp;lt;sub&amp;gt;0&amp;lt;/sub&amp;gt;) ≤ &amp;#039;&amp;#039;f&amp;#039;&amp;#039;(&amp;#039;&amp;#039;x&amp;#039;&amp;#039;) for all &amp;#039;&amp;#039;x&amp;#039;&amp;#039; in &amp;#039;&amp;#039;A&amp;#039;&amp;#039; (&amp;quot;minimization&amp;quot;).&lt;br /&gt;
&lt;br /&gt;
Typically, &amp;#039;&amp;#039;A&amp;#039;&amp;#039; is some [[subset]] of the [[Euclidean space]] &amp;#039;&amp;#039;&amp;#039;R&amp;#039;&amp;#039;&amp;#039;&amp;lt;sup&amp;gt;&amp;#039;&amp;#039;n&amp;#039;&amp;#039;&amp;lt;/sup&amp;gt;, often specified by a set of &amp;#039;&amp;#039;[[constraint (mathematics)|constraint]]s&amp;#039;&amp;#039;, equalities or inequalities that the members of &amp;#039;&amp;#039;A&amp;#039;&amp;#039; have to satisfy.  &lt;br /&gt;
Maximization can be reduced to minimization by multiplying the function by minus one.&lt;br /&gt;
&lt;br /&gt;
The use of &amp;#039;&amp;#039;&amp;#039;optimization software&amp;#039;&amp;#039;&amp;#039; requires that the function &amp;#039;&amp;#039;f&amp;#039;&amp;#039; is defined in a suitable&lt;br /&gt;
programming language and linked to&lt;br /&gt;
the optimization software. The optimization software will deliver input values in &amp;#039;&amp;#039;A&amp;#039;&amp;#039;, &lt;br /&gt;
the software module realizing &amp;#039;&amp;#039;f&amp;#039;&amp;#039; will deliver the computed value &amp;#039;&amp;#039;f&amp;#039;&amp;#039;(&amp;#039;&amp;#039;x&amp;#039;&amp;#039;).&lt;br /&gt;
In this manner, a clear &amp;#039;&amp;#039;&amp;#039;separation of concerns&amp;#039;&amp;#039;&amp;#039; is obtained: different optimization&lt;br /&gt;
software modules can be easily tested on the same function &amp;#039;&amp;#039;f&amp;#039;&amp;#039;, or a given&lt;br /&gt;
optimization software can be used for different functions &amp;#039;&amp;#039;f&amp;#039;&amp;#039;.&lt;br /&gt;
&lt;br /&gt;
The following tables provide a comparison of optimization software libraries, either specialized or general purpose libraries with significant optimization coverage.&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable sortable&amp;quot; style=&amp;quot;font-size: smaller; text-align: center; width: auto;&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! style=&amp;quot;width: 12em&amp;quot;|&lt;br /&gt;
! Language&lt;br /&gt;
! Latest stable version&lt;br /&gt;
! Academic/noncommercial&amp;lt;br&amp;gt;use is free&lt;br /&gt;
! Can be used in&amp;lt;br&amp;gt;proprietary aps&lt;br /&gt;
! License&lt;br /&gt;
! Notes&lt;br /&gt;
|-&lt;br /&gt;
! [[ALGLIB]]&lt;br /&gt;
| C++, C#, FreePascal, VBA&lt;br /&gt;
| 3.8.0 / August 2013&lt;br /&gt;
| {{yes}}&lt;br /&gt;
| {{yes}}&lt;br /&gt;
| Dual (Commercial, GPL)&lt;br /&gt;
| General purpose library, includes optimization package.&lt;br /&gt;
|-&lt;br /&gt;
! [[AMPL]]&lt;br /&gt;
| C&lt;br /&gt;
| October 2013&lt;br /&gt;
| {{yes}}&lt;br /&gt;
| {{yes}}&lt;br /&gt;
| Dual (Commercial, academic)&lt;br /&gt;
| A popular algebraic modeling language for linear, mixed-integer and nonlinear optimization. Student and AMPL for courses versions are available for free.&lt;br /&gt;
|-&lt;br /&gt;
! [[GNU Scientific Library]]&lt;br /&gt;
| C&lt;br /&gt;
| 1.16 / July 2013 &lt;br /&gt;
| {{yes}}&lt;br /&gt;
| {{no}}&lt;br /&gt;
| GPL&lt;br /&gt;
| Free library provided by GNU project.&lt;br /&gt;
|-&lt;br /&gt;
! [[GNU Linear Programming Kit]]&lt;br /&gt;
| C&lt;br /&gt;
| 4.52 / July 2013&lt;br /&gt;
| {{yes}}&lt;br /&gt;
| {{no}}&lt;br /&gt;
| GPL&lt;br /&gt;
| Free library for linear programming (LP) and mixed integer programming (MIP).&lt;br /&gt;
|-&lt;br /&gt;
! [[IMSL Numerical Libraries]]&lt;br /&gt;
| C, Java, C#, Fortran, Python&lt;br /&gt;
| many components&lt;br /&gt;
| {{no}}&lt;br /&gt;
| {{yes}}&lt;br /&gt;
| Proprietary&lt;br /&gt;
| &lt;br /&gt;
|-&lt;br /&gt;
! [[LIONsolver]]&lt;br /&gt;
| C++, Java &lt;br /&gt;
| 2.0.198 / October 2011&lt;br /&gt;
| {{yes}}&lt;br /&gt;
| {{yes}}&lt;br /&gt;
| Proprietary&lt;br /&gt;
| Support for interactive and learning optimization,&lt;br /&gt;
according to [[Reactive search optimization|RSO]] principles&lt;br /&gt;
.&amp;lt;ref&amp;gt;{{cite book&lt;br /&gt;
|title=Reactive Search and Intelligent Optimization&lt;br /&gt;
|last=Battiti&lt;br /&gt;
|first=Roberto&lt;br /&gt;
|authorlink=&lt;br /&gt;
|coauthors=Mauro Brunato; Franco Mascia&lt;br /&gt;
|year=2008&lt;br /&gt;
|publisher=[[Springer Verlag]]&lt;br /&gt;
|location=&lt;br /&gt;
|isbn=978-0-387-09623-0&lt;br /&gt;
}}&lt;br /&gt;
&amp;lt;/ref&amp;gt;&lt;br /&gt;
|-&lt;br /&gt;
! [[Math Kernel Library|MKL]]&lt;br /&gt;
| C++, Fortran&lt;br /&gt;
| 11.1 / October 2013&lt;br /&gt;
| {{no}}&lt;br /&gt;
| {{yes}}&lt;br /&gt;
| Proprietary&lt;br /&gt;
| Numerical library from Intel. MKL is specialized on linear algebra,&amp;lt;br&amp;gt;but contains some optimization-related functionality.&lt;br /&gt;
|-&lt;br /&gt;
! [[NAG Numerical Libraries]]&lt;br /&gt;
| C, Fortran&lt;br /&gt;
| Mark 24 / October 2013&lt;br /&gt;
| {{no}}&lt;br /&gt;
| {{yes}}&lt;br /&gt;
| Proprietary&lt;br /&gt;
| &lt;br /&gt;
|-&lt;br /&gt;
! [[NMath]]&lt;br /&gt;
| C#&lt;br /&gt;
| 5.3 / May 2013&lt;br /&gt;
| {{no}}&lt;br /&gt;
| {{yes}}&lt;br /&gt;
| Proprietary&lt;br /&gt;
| C# numerical library built on top of MKL.&lt;br /&gt;
|-&lt;br /&gt;
! [[OptaPlanner]]&lt;br /&gt;
| Java&lt;br /&gt;
| 6.0.1.Final / Dec 2013&lt;br /&gt;
| {{yes}}&lt;br /&gt;
| {{yes}}&lt;br /&gt;
| ASL&lt;br /&gt;
| Lightweight optimization solver in Java&lt;br /&gt;
|-&lt;br /&gt;
! [[SciPy]]&lt;br /&gt;
| Python&lt;br /&gt;
| 0.13.1 / November 2013&lt;br /&gt;
| {{yes}}&lt;br /&gt;
| {{yes}}&lt;br /&gt;
| BSD&lt;br /&gt;
| General purpose numerical library from Enthought.&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==References==&lt;br /&gt;
{{Reflist}}&lt;br /&gt;
&lt;br /&gt;
==External links==&lt;br /&gt;
* [http://www.orms-today.org/surveys/LP/LP-survey.html OR/MS Today: 2013 Linear Programming Software Survey]&lt;br /&gt;
* [http://www.orms-today.org/surveys/nlp/nlp.html OR/MS Today: 1998 Nonlinear Programming Software Survey]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Mathematical optimization software}}&lt;br /&gt;
[[Category:Numerical software| ]]&lt;/div&gt;</summary>
		<author><name>en&gt;Yug</name></author>
	</entry>
</feed>