#include <GondzioSolver.h>
Inheritance diagram for GondzioSolver:
Public Methods | |
virtual int | solve (Data *prob, Variables *iterate, Residuals *resid) |
virtual void | reset_parameters () |
virtual void | defaultMonitor (Data *data, Variables *vars, Residuals *resids, double alpha, double sigma, int i, double mu, int status_code, int level) |
Protected Attributes | |
int | printlevel |
double | tsig |
int | maximum_correctors |
int | NumberGondzioCorrections |
double | StepFactor0 |
double | StepFactor1 |
double | AcceptTol |
double | beta_min |
double | beta_max |
Variables * | corrector_step |
Variables * | step |
Residuals * | corrector_resid |
|
default monitor: prints out one line of information on each interior-point iteration Implements Solver. |
|
reset parameters to their default values |
|
implements the interior-point method for solving the QP Implements Solver. |
|
various parameters associated with Gondzio correction |
|
various parameters associated with Gondzio correction |
|
various parameters associated with Gondzio correction |
|
storage for residual vectors |
|
storage for step vectors |
|
maximum number of Gondzio corrector steps |
|
actual number of Gondzio corrections needed |
|
parameter in range [0,100] determines verbosity. (Higher value => more verbose.) |
|
storage for step vectors |
|
various parameters associated with Gondzio correction |
|
various parameters associated with Gondzio correction |
|
exponent in Mehrotra's centering parameter, which is usually chosen to me (muaff/mu)^tsig, where muaff is the predicted complementarity gap obtained from an affine-scaling step, while mu is the current complementarity gap |