Fix typos

Change-Id: I04d1bc3a9f38ff7871d3192563cd1f649fdc6cea
Reviewed-on: https://gerrit.libreoffice.org/18960
Reviewed-by: Samuel Mehrbrodt <Samuel.Mehrbrodt@cib.de>
Tested-by: Samuel Mehrbrodt <Samuel.Mehrbrodt@cib.de>

nlpsolver/ThirdParty/EvolutionarySolver/src/net/adaptivebox/goodness/ACRComparator.java

@@ -3,7 +3,7 @@
  *  which varied adaptively according to the social information.
  *
  * Applied domain: efficiently for ridge class feasible space (SF), such as
- *  the problem with eqaulity constraints
+ *  the problem with equality constraints
  *
  * Author          Create/Modi     Note
  * Xiaofeng Xie    Jun 24, 2003     Created

nlpsolver/ThirdParty/EvolutionarySolver/src/net/adaptivebox/goodness/BCHComparator.java

@@ -28,7 +28,7 @@ package net.adaptivebox.goodness;
 
 public class BCHComparator implements IGoodnessCompareEngine {
 
-/* check the magnitude of two array, the frontial is more important
+/* check the magnitude of two array, the frontal is more important
  **/
   private static int compareArray(double[] fit1, double[] fit2) {
     for (int i=0; i<fit1.length; i++) {

nlpsolver/ThirdParty/EvolutionarySolver/src/net/adaptivebox/sco/SCAgent.java

@@ -76,7 +76,7 @@ public class SCAgent {
   public SearchPoint generatePoint() {
     //generate a new point
     generatePoint(trailPoint);
-    //evalute the generated point
+    //evaluete the generated point
     problemEncoder.evaluate(trailPoint);
     return trailPoint;
   }