org.um.feri.ears.problems.unconstrained.ProblemBeale.java Source code

Introduction

Here is the source code for org.um.feri.ears.problems.unconstrained.ProblemBeale.java

Source

package org.um.feri.ears.problems.unconstrained;

import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.List;

import org.apache.commons.lang3.ArrayUtils;
import org.um.feri.ears.problems.Problem;

/**
* Problem function!
* <p>
* 
* @author Matej Crepinsek
* @version 1
* 
*          <h3>License</h3>
* 
*          Copyright (c) 2011 by Matej Crepinsek. <br>
*          All rights reserved. <br>
* 
*          <p>
*          Redistribution and use in source and binary forms, with or without
*          modification, are permitted provided that the following conditions
*          are met:
*          <ul>
*          <li>Redistributions of source code must retain the above copyright
*          notice, this list of conditions and the following disclaimer.
*          <li>Redistributions in binary form must reproduce the above
*          copyright notice, this list of conditions and the following
*          disclaimer in the documentation and/or other materials provided with
*          the distribution.
*          <li>Neither the name of the copyright owners, their employers, nor
*          the names of its contributors may be used to endorse or promote
*          products derived from this software without specific prior written
*          permission.
*          </ul>
*          <p>
*          THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
*          "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
*          LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
*          FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
*          COPYRIGHT OWNERS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
*          INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
*          BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
*          LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
*          CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
*          LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
*          ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
*          POSSIBILITY OF SUCH DAMAGE.
* 
*/
public class ProblemBeale extends Problem {
    public ProblemBeale() {
        super(2, 0);

        lowerLimit = new ArrayList<Double>(Collections.nCopies(numberOfDimensions, -4.5));
        upperLimit = new ArrayList<Double>(Collections.nCopies(numberOfDimensions, 4.5));

        name = "Beale function";
    }

    public double eval(double x[]) {
        double y[] = { 1.5, 2.25, 2.625 };
        double v = 0;
        for (int i = 0; i < 3; i++) {
            v += Math.pow(y[i] - x[0] * (1 - Math.pow(x[1], i + 1)), 2);
        }
        return v;
    }

    @Override
    public double eval(Double[] ds) {
        return eval(ArrayUtils.toPrimitive(ds));
    }

    public double getOptimumEval() {
        return 0;
    }

    public double[][] getOptimalVector() {
        double[][] v = new double[1][numberOfDimensions];
        v[0][0] = 3;
        v[0][1] = 0.5;
        return v;
    }

    @Override
    public boolean isFirstBetter(Double[] x, double eval_x, Double[] y, double eval_y) {
        return eval_x < eval_y;
    }
}