VERSION 0.4.1

lauri-neuvonen · May 4, 2020 · f47c1a5 · f47c1a5
1 parent c238f79
commit f47c1a5
Show file tree

Hide file tree

Showing 4 changed files with 15 additions and 6 deletions.
diff --git a/doc/source/misc/reference_directions.ipynb b/doc/source/misc/reference_directions.ipynb
@@ -15,7 +15,7 @@
    "source": [
     "## Reference Directions\n",
     "\n",
-    "Most evolutionary many-objective optimization (EMaO) algorithms, for instance [NSGA3](../algorithms/nsga3.ipynb) or [MOEAD](../algorithms/moead.ipynb), start with a description of a number of pre-defined set of reference directions on a unit simplex. Reference directions in an $M$-dimensional space are subject to"
+    "Most evolutionary many-objective optimization (EMaO) algorithms, for instance [NSGA3](../algorithms/nsga3.ipynb) or [MOEAD](../algorithms/moead.ipynb), start with a description of a number of predefined set of reference directions on a unit simplex. Reference directions in an $M$-dimensional space are subject to"
    ]
   },
   {
@@ -506,7 +506,7 @@
    "name": "python",
    "nbconvert_exporter": "python",
    "pygments_lexer": "ipython3",
-   "version": "3.7.4"
+   "version": "3.7.3"
   }
  },
  "nbformat": 4,

diff --git a/doc/source/portfolio.html b/doc/source/portfolio.html
@@ -271,7 +271,7 @@ <h4>Performance Indicator</h4>
                     <a href="misc/performance_indicator.html#nb-igd">IGD</a>,
                     <a href="misc/performance_indicator.html#nb-igd-plus">IGD+</a>,
                     <a href="misc/performance_indicator.html#nb-hv">Hypervolume</a>,
-                    <a href="customization/kktpm.html">KKTPM</a>
+                    <a href="misc/kktpm.html">KKTPM</a>
                 </div>
             </div>
         </div>

diff --git a/doc/source/versions.ipynb b/doc/source/versions.ipynb
@@ -31,7 +31,7 @@
    "source": [
     "#### 0.4.1\n",
     "\n",
-    "- New Feature: Riesz s-Energy Method to generate a well-spaced point-set of arbitrary size.\n",
+    "- New Feature: Riesz s-Energy Method to generate a well-spaced point-set on the unit simplex (reference directions) of arbitrary size.\n",
     "- New Algorithm: An implementation of Hooke and Jeeves Pattern Search (well-known single-objective algorithm)\n",
     "- New Documentation: We have re-arranged the documentation and explain now the minimize interface in more detail.\n",
     "- New Feature: The problem can be parallelized by directly providing a starmapping callable (Contribution by Josh Karpel).\n",
@@ -196,8 +196,17 @@
    "nbconvert_exporter": "python",
    "pygments_lexer": "ipython3",
    "version": "3.7.3"
+  },
+  "pycharm": {
+   "stem_cell": {
+    "cell_type": "raw",
+    "source": [],
+    "metadata": {
+     "collapsed": false
+    }
+   }
   }
  },
  "nbformat": 4,
  "nbformat_minor": 4
-}
+}
diff --git a/pymoo/version.py b/pymoo/version.py
@@ -1 +1 @@
-__version__ = "0.4.1.dev"
+__version__ = "0.4.1"