Java tutorial
/* * Copyright (C) 2012 Grupo Integrado de Ingeniera (<a href="www.gii.udc.es">www.gii.udc.es</a>) * * This program is free software: you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation, either version 3 of the License, or * (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with this program. If not, see <http://www.gnu.org/licenses/>. */ package es.udc.gii.common.eaf.stoptest.cma; import es.udc.gii.common.eaf.algorithm.CMAEvolutionaryAlgorithm; import es.udc.gii.common.eaf.algorithm.EvolutionaryAlgorithm; import es.udc.gii.common.eaf.stoptest.SimpleStopTest; import es.udc.gii.common.eaf.util.ConfWarning; import org.apache.commons.configuration.Configuration; import org.apache.commons.math.stat.StatUtils; /** * * @author Grupo Integrado de Ingeniera (<a href="www.gii.udc.es">www.gii.udc.es</a>) */ public class CMATolXUpStopTest extends SimpleStopTest { private double tol_up_x_factor = 1.0e3; @Override public boolean isReach(EvolutionaryAlgorithm algorithm) { double sigma, maxstartsigma, maxsqrtdiagC; CMAEvolutionaryAlgorithm cma = (CMAEvolutionaryAlgorithm) algorithm; maxstartsigma = StatUtils.max(cma.getStartSigma()); maxsqrtdiagC = Math.sqrt(StatUtils.max(cma.diag(cma.getC()))); sigma = cma.getSigma(); if (sigma * maxsqrtdiagC > this.tol_up_x_factor * maxstartsigma) { return true; } return false; } @Override public void configure(Configuration conf) { if (conf.containsKey("TolXUpFactor")) { this.tol_up_x_factor = conf.getDouble("TolXUpFactor"); } else { ConfWarning w = new ConfWarning("TolXUpFactor", this.tol_up_x_factor); w.warn(); } } }