ROOT 6.13/01 Reference Guide |
Definition at line 72 of file TQpSolverBase.h.
Public Member Functions | |
TQpSolverBase () | |
Default constructor. More... | |
TQpSolverBase (const TQpSolverBase &another) | |
Copy constructor. More... | |
virtual | ~TQpSolverBase () |
Deconstructor. More... | |
Double_t | DataNorm () |
virtual void | DefMonitor (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)=0 |
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 Int_t | Solve (TQpDataBase *prob, TQpVar *iterate, TQpResidual *resids)=0 |
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... | |
Public Attributes | |
Int_t | fIter |
Protected Attributes | |
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 |
#include <TQpSolverBase.h>
TQpSolverBase::TQpSolverBase | ( | ) |
Default constructor.
Definition at line 62 of file TQpSolverBase.cxx.
TQpSolverBase::TQpSolverBase | ( | const TQpSolverBase & | another | ) |
Copy constructor.
Definition at line 92 of file TQpSolverBase.cxx.
|
virtual |
Deconstructor.
Definition at line 101 of file TQpSolverBase.cxx.
|
inline |
Definition at line 160 of file TQpSolverBase.h.
|
pure virtual |
Implemented in TGondzioSolver, and TMehrotraSolver.
|
virtual |
Default starting point.
Definition at line 128 of file TQpSolverBase.cxx.
|
virtual |
Default status method.
Definition at line 278 of file TQpSolverBase.cxx.
|
virtual |
Monitor progress / convergence aat each interior-point iteration.
Definition at line 255 of file TQpSolverBase.cxx.
|
virtual |
Tests for termination.
Unless the user supplies a specific termination routine, this method calls another method defaultStatus, which returns a code indicating the current convergence status.
Definition at line 268 of file TQpSolverBase.cxx.
|
virtual |
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 .
Definition at line 202 of file TQpSolverBase.cxx.
Implements a version of Mehrotra starting point heuristic, modified to ensure identical steps in the primal and dual variables.
Definition at line 218 of file TQpSolverBase.cxx.
|
inline |
Definition at line 159 of file TQpSolverBase.h.
|
inline |
Definition at line 154 of file TQpSolverBase.h.
|
inline |
Definition at line 156 of file TQpSolverBase.h.
TQpSolverBase & TQpSolverBase::operator= | ( | const TQpSolverBase & | source | ) |
Assignment operator.
Definition at line 330 of file TQpSolverBase.cxx.
|
inline |
Definition at line 158 of file TQpSolverBase.h.
|
inline |
Definition at line 155 of file TQpSolverBase.h.
|
pure virtual |
Implemented in TGondzioSolver, and TMehrotraSolver.
|
virtual |
Implements a default starting-point heuristic.
While interior-point theory places fairly loose restrictions on the choice of starting point, the choice of heuristic can significantly affect the robustness and efficiency of the algorithm.
Definition at line 118 of file TQpSolverBase.cxx.
|
virtual |
Starting point algoritm according to Stephen Wright.
Definition at line 154 of file TQpSolverBase.cxx.
|
protected |
Definition at line 81 of file TQpSolverBase.h.
|
protected |
Definition at line 78 of file TQpSolverBase.h.
|
protected |
Definition at line 84 of file TQpSolverBase.h.
|
protected |
Definition at line 83 of file TQpSolverBase.h.
Int_t TQpSolverBase::fIter |
Definition at line 97 of file TQpSolverBase.h.
|
protected |
Definition at line 87 of file TQpSolverBase.h.
|
protected |
Definition at line 89 of file TQpSolverBase.h.
|
protected |
Definition at line 80 of file TQpSolverBase.h.
|
protected |
Definition at line 85 of file TQpSolverBase.h.
|
protected |
Definition at line 91 of file TQpSolverBase.h.
|
protected |
Definition at line 93 of file TQpSolverBase.h.
|
protected |
Definition at line 90 of file TQpSolverBase.h.
|
protected |
Definition at line 76 of file TQpSolverBase.h.