ROOT 6.13/01 Reference Guide |
Definition at line 56 of file TGondzioSolver.h.
Public Member Functions | |
TGondzioSolver () | |
Default constructor. More... | |
TGondzioSolver (TQpProbBase *of, TQpDataBase *prob, Int_t verbose=0) | |
Constructor. More... | |
TGondzioSolver (const TGondzioSolver &another) | |
Copy constructor. More... | |
virtual | ~TGondzioSolver () |
Deconstructor. More... | |
virtual void | DefMonitor (TQpDataBase *data, TQpVar *vars, TQpResidual *resids, Double_t alpha, Double_t sigma, Int_t i, Double_t mu, Int_t status_code, Int_t level) |
Print information about the optimization process and monitor the convergence status of thye algorithm. More... | |
TGondzioSolver & | operator= (const TGondzioSolver &source) |
Assignment operator. More... | |
virtual void | Reset_parameters () |
virtual Int_t | Solve (TQpDataBase *prob, TQpVar *iterate, TQpResidual *resid) |
Solve the quadratic programming problem as formulated through prob, store the final solution in iterate->fX . More... | |
Public Member Functions inherited from TQpSolverBase | |
TQpSolverBase () | |
Default constructor. More... | |
TQpSolverBase (const TQpSolverBase &another) | |
Copy constructor. More... | |
virtual | ~TQpSolverBase () |
Deconstructor. More... | |
Double_t | DataNorm () |
virtual void | DefStart (TQpProbBase *formulation, TQpVar *iterate, TQpDataBase *prob, TQpResidual *resid, TQpVar *step) |
Default starting point. More... | |
virtual Int_t | DefStatus (TQpDataBase *data, TQpVar *vars, TQpResidual *resids, Int_t i, Double_t mu, Int_t level) |
Default status method. More... | |
virtual void | DoMonitor (TQpDataBase *data, TQpVar *vars, TQpResidual *resids, Double_t alpha, Double_t sigma, Int_t i, Double_t mu, Int_t stop_code, Int_t level) |
Monitor progress / convergence aat each interior-point iteration. More... | |
virtual Int_t | DoStatus (TQpDataBase *data, TQpVar *vars, TQpResidual *resids, Int_t i, Double_t mu, Int_t level) |
Tests for termination. More... | |
virtual void | DumbStart (TQpProbBase *formulation, TQpVar *iterate, TQpDataBase *prob, TQpResidual *resid, TQpVar *step) |
Alternative starting point heuristic: sets the "complementary" variables to a large positive value (based on the norm of the problem data) and the remaining variables to zero . More... | |
virtual Double_t | FinalStepLength (TQpVar *iterate, TQpVar *step) |
Implements a version of Mehrotra starting point heuristic, modified to ensure identical steps in the primal and dual variables. More... | |
Double_t | GetArTol () |
TQpLinSolverBase * | GetLinearSystem () |
Double_t | GetMuTol () |
TQpSolverBase & | operator= (const TQpSolverBase &source) |
Assignment operator. More... | |
void | SetArTol (Double_t ar) |
void | SetMuTol (Double_t m) |
virtual void | Start (TQpProbBase *formulation, TQpVar *iterate, TQpDataBase *prob, TQpResidual *resid, TQpVar *step) |
Implements a default starting-point heuristic. More... | |
virtual void | SteveStart (TQpProbBase *formulation, TQpVar *iterate, TQpDataBase *prob, TQpResidual *resid, TQpVar *step) |
Starting point algoritm according to Stephen Wright. More... | |
Protected Attributes | |
Double_t | fAcceptTol |
Double_t | fBeta_max |
Double_t | fBeta_min |
TQpResidual * | fCorrector_resid |
TQpVar * | fCorrector_step |
TQpProbBase * | fFactory |
Int_t | fMaximum_correctors |
Int_t | fNumberGondzioCorrections |
Int_t | fPrintlevel |
TQpVar * | fStep |
Double_t | fStepFactor0 |
Double_t | fStepFactor1 |
Double_t | fTsig |
Protected Attributes inherited from TQpSolverBase | |
Double_t | fArtol |
Double_t | fDnorm |
Double_t | fGamma_a |
Double_t | fGamma_f |
Int_t | fMaxit |
Double_t * | fMu_history |
Double_t | fMutol |
Double_t | fPhi |
Double_t * | fPhi_history |
Double_t * | fPhi_min_history |
Double_t * | fRnorm_history |
TQpLinSolverBase * | fSys |
Additional Inherited Members | |
Public Attributes inherited from TQpSolverBase | |
Int_t | fIter |
#include <TGondzioSolver.h>
TGondzioSolver::TGondzioSolver | ( | ) |
Default constructor.
Definition at line 63 of file TGondzioSolver.cxx.
TGondzioSolver::TGondzioSolver | ( | TQpProbBase * | of, |
TQpDataBase * | prob, | ||
Int_t | verbose = 0 |
||
) |
Constructor.
Definition at line 86 of file TGondzioSolver.cxx.
TGondzioSolver::TGondzioSolver | ( | const TGondzioSolver & | another | ) |
Copy constructor.
Definition at line 118 of file TGondzioSolver.cxx.
|
virtual |
Deconstructor.
Definition at line 326 of file TGondzioSolver.cxx.
|
virtual |
Print information about the optimization process and monitor the convergence status of thye algorithm.
Implements TQpSolverBase.
Definition at line 276 of file TGondzioSolver.cxx.
TGondzioSolver & TGondzioSolver::operator= | ( | const TGondzioSolver & | source | ) |
Assignment operator.
Definition at line 337 of file TGondzioSolver.cxx.
|
inlinevirtual |
Definition at line 95 of file TGondzioSolver.h.
|
virtual |
Solve the quadratic programming problem as formulated through prob, store the final solution in iterate->fX .
Monitor the residuals during the iterations through resid . The status is returned as defined in TQpSolverBase::ETerminationCode .
Implements TQpSolverBase.
Definition at line 129 of file TGondzioSolver.cxx.
|
protected |
Definition at line 74 of file TGondzioSolver.h.
|
protected |
Definition at line 76 of file TGondzioSolver.h.
|
protected |
Definition at line 75 of file TGondzioSolver.h.
|
protected |
Definition at line 81 of file TGondzioSolver.h.
|
protected |
Definition at line 78 of file TGondzioSolver.h.
|
protected |
Definition at line 83 of file TGondzioSolver.h.
|
protected |
Definition at line 68 of file TGondzioSolver.h.
|
protected |
Definition at line 70 of file TGondzioSolver.h.
|
protected |
Definition at line 61 of file TGondzioSolver.h.
|
protected |
Definition at line 79 of file TGondzioSolver.h.
|
protected |
Definition at line 72 of file TGondzioSolver.h.
|
protected |
Definition at line 73 of file TGondzioSolver.h.
|
protected |
Definition at line 63 of file TGondzioSolver.h.