/*************************************************************************
BLEIC results
INPUT PARAMETERS:
State - algorithm state
OUTPUT PARAMETERS:
X - array[0..N-1], solution
Rep - optimization report. You should check Rep.TerminationType
in order to distinguish successful termination from
unsuccessful one:
* -8 internal integrity control detected infinite or
NAN values in function/gradient. Abnormal
termination signalled.
* -7 gradient verification failed.
See MinBLEICSetGradientCheck() for more information.
* -3 inconsistent constraints. Feasible point is
either nonexistent or too hard to find. Try to
restart optimizer with better initial approximation
* 1 relative function improvement is no more than EpsF.
* 2 scaled step is no more than EpsX.
* 4 scaled gradient norm is no more than EpsG.
* 5 MaxIts steps was taken
* 8 terminated by user who called minbleicrequesttermination().
X contains point which was "current accepted" when
termination request was submitted.
More information about fields of this structure can be
found in the comments on MinBLEICReport datatype.
-- ALGLIB --
Copyright 28.11.2010 by Bochkanov Sergey
*************************************************************************/
public static void minbleicresults(minbleicstate state,
ref double[] x,
minbleicreport rep)
{
x = new double[0];
minbleicresultsbuf(state, ref x, rep);
}
/*************************************************************************
BLEIC results
Buffered implementation of MinBLEICResults() which uses pre-allocated buffer
to store X[]. If buffer size is too small, it resizes buffer. It is
intended to be used in the inner cycles of performance critical algorithms
where array reallocation penalty is too large to be ignored.
-- ALGLIB --
Copyright 28.11.2010 by Bochkanov Sergey
*************************************************************************/
public static void minbleicresultsbuf(minbleicstate state,
ref double[] x,
minbleicreport rep)
{
int i = 0;
int i_ = 0;
if( alglib.ap.len(x)<state.nmain )
{
x = new double[state.nmain];
}
rep.iterationscount = state.repinneriterationscount;
rep.inneriterationscount = state.repinneriterationscount;
rep.outeriterationscount = state.repouteriterationscount;
rep.nfev = state.repnfev;
rep.varidx = state.repvaridx;
rep.terminationtype = state.repterminationtype;
if( state.repterminationtype>0 )
{
for(i_=0; i_<=state.nmain-1;i_++)
{
x[i_] = state.sas.xc[i_];
}
}
else
{
for(i=0; i<=state.nmain-1; i++)
{
x[i] = Double.NaN;
}
}
rep.debugeqerr = state.repdebugeqerr;
rep.debugfs = state.repdebugfs;
rep.debugff = state.repdebugff;
rep.debugdx = state.repdebugdx;
rep.debugfeasqpits = state.repdebugfeasqpits;
rep.debugfeasgpaits = state.repdebugfeasgpaits;
}
public override alglib.apobject make_copy()
{
minbleicreport _result = new minbleicreport();
_result.iterationscount = iterationscount;
_result.nfev = nfev;
_result.varidx = varidx;
_result.terminationtype = terminationtype;
_result.debugeqerr = debugeqerr;
_result.debugfs = debugfs;
_result.debugff = debugff;
_result.debugdx = debugdx;
_result.debugfeasqpits = debugfeasqpits;
_result.debugfeasgpaits = debugfeasgpaits;
_result.inneriterationscount = inneriterationscount;
_result.outeriterationscount = outeriterationscount;
return _result;
}
