#include "stdafx.h"
#include <stdlib.h>
#include <stdio.h>
#include <math.h>
#include "optimization.h"

using namespace alglib;

const double XA = 1, YA = 5;
const double XB = 7, YB = 2;
const double XC = 7, YC = 8;

double pointDist(double x1, double y1, double x2, double y2)
{
    return sqrt(pow(x2 - x1, 2) + pow(y2 - y1, 2));
}

void func(const real_1d_array &x, real_1d_array &fi, void *ptr)
{
    fi[0] = pointDist(x[0], x[1], XA, YA);
    fi[1] = pointDist(x[0], x[1], XB, YB);
    fi[2] = pointDist(x[0], x[1], XC, YC);
}

int main(int argc, char *argv[])
{
    real_1d_array x = "[0,0]";
    double epsg = 0.0000000001;
    double epsf = 0;
    double epsx = 0;
    ae_int_t maxits = 0;
    minlmstate state;
    minlmreport rep;

    minlmcreatev(2, x, 0.0001, state);
    minlmsetcond(state, epsg, epsf, epsx, maxits);
    minlmoptimize(state, func);
    minlmresults(state, x, rep);

    printf("%d\n", int(rep.terminationtype));
    printf("%s\n", x.tostring(2).c_str());
    return 0;
}

void func(const real_1d_array &x, real_1d_array &fi, void *ptr)
{
    fi[0] = x[0] * x[1] - 3;
    fi[1] = 1;
}
...
double epsg = 1e-9;
double epsf = 1e-6;
double epsx = 1e-6;
ae_int_t maxits = 0;

Termination  = Relative function improvement is no more than EpsF
Solution     = [-1.3551,-2.2138]
Iterations   = 4
Calculations = 14
Jacobians    = 2

real_1d_array x = "[-0.5,-2]";

void func2(const real_1d_array &x, double &func, void *ptr)
{
    func = pow(x[0]*x[1] - 3, 2) + 1;
}

real_1d_array x = "[1,1]";
real_1d_array bndl = "[0,0]";
real_1d_array bndu = "[10,10]";
minbleicstate state;
minbleicreport rep;

double epsg = 1e-9;
double epsf = 1e-6;
double epsx = 1e-6;
ae_int_t maxits = 0;
double diffstep = 1.0e-6;

Termination  = Relative function improvement is no more than EpsF
Solution     = [1.7321,1.7321]
Iterations   = 4