Ipopt
3.12.12
|
This is the implemetation of the Primal-Dual System, using the full space approach with a direct linear solver. More...
#include <IpPDFullSpaceSolver.hpp>
Public Member Functions | |
bool | InitializeImpl (const OptionsList &options, const std::string &prefix) |
overloaded from AlgorithmStrategyObject More... | |
virtual bool | Solve (Number alpha, Number beta, const IteratesVector &rhs, IteratesVector &res, bool allow_inexact=false, bool improve_solution=false) |
Solve the primal dual system, given one right hand side. More... | |
/Destructor | |
PDFullSpaceSolver (AugSystemSolver &augSysSolver, PDPerturbationHandler &perturbHandler) | |
Constructor that takes in the Augmented System solver that is to be used inside. More... | |
virtual | ~PDFullSpaceSolver () |
Default destructor. More... | |
![]() | |
PDSystemSolver () | |
Default Constructor. More... | |
virtual | ~PDSystemSolver () |
Default destructor. More... | |
![]() | |
bool | Initialize (const Journalist &jnlst, IpoptNLP &ip_nlp, IpoptData &ip_data, IpoptCalculatedQuantities &ip_cq, const OptionsList &options, const std::string &prefix) |
This method is called every time the algorithm starts again - it is used to reset any internal state. More... | |
bool | ReducedInitialize (const Journalist &jnlst, const OptionsList &options, const std::string &prefix) |
Reduced version of the Initialize method, which does not require special Ipopt information. More... | |
AlgorithmStrategyObject () | |
Default Constructor. More... | |
virtual | ~AlgorithmStrategyObject () |
Default Destructor. More... | |
![]() | |
ReferencedObject () | |
virtual | ~ReferencedObject () |
Index | ReferenceCount () const |
void | AddRef (const Referencer *referencer) const |
void | ReleaseRef (const Referencer *referencer) const |
Static Public Member Functions | |
static void | RegisterOptions (SmartPtr< RegisteredOptions > roptions) |
Methods for IpoptType. More... | |
Private Member Functions | |
bool | SolveOnce (bool resolve_unmodified, bool pretend_singular, const SymMatrix &W, const Matrix &J_c, const Matrix &J_d, const Matrix &Px_L, const Matrix &Px_U, const Matrix &Pd_L, const Matrix &Pd_U, const Vector &z_L, const Vector &z_U, const Vector &v_L, const Vector &v_U, const Vector &slack_x_L, const Vector &slack_x_U, const Vector &slack_s_L, const Vector &slack_s_U, const Vector &sigma_x, const Vector &sigma_s, Number alpha, Number beta, const IteratesVector &rhs, IteratesVector &res) |
Internal function for a single backsolve (which will be used for iterative refinement on the outside). More... | |
void | ComputeResiduals (const SymMatrix &W, const Matrix &J_c, const Matrix &J_d, const Matrix &Px_L, const Matrix &Px_U, const Matrix &Pd_L, const Matrix &Pd_U, const Vector &z_L, const Vector &z_U, const Vector &v_L, const Vector &v_U, const Vector &slack_x_L, const Vector &slack_x_U, const Vector &slack_s_L, const Vector &slack_s_U, const Vector &sigma_x, const Vector &sigma_s, Number alpha, Number beta, const IteratesVector &rhs, const IteratesVector &res, IteratesVector &resid) |
Internal function for computing the residual (resid) given the right hand side (rhs) and the solution of the system (res). More... | |
Number | ComputeResidualRatio (const IteratesVector &rhs, const IteratesVector &res, const IteratesVector &resid) |
Internal function for computing the ratio of the residual compared to the right hand side and solution. More... | |
Default Compiler Generated Methods | |
(Hidden to avoid implicit creation/calling). These methods are not implemented and we do not want the compiler to implement them for us, so we declare them private and do not define them. This ensures that they will not be implicitly created/called. | |
PDFullSpaceSolver () | |
Default Constructor. More... | |
PDFullSpaceSolver & | operator= (const PDFullSpaceSolver &) |
Overloaded Equals Operator. More... | |
Auxilliary functions | |
void | SinvBlrmZPTdBr (Number alpha, const Vector &S, const Vector &R, const Vector &Z, const Matrix &P, const Vector &g, Vector &X) |
Compute ![]() | |
Private Attributes | |
Strategy objects to hold on to. | |
SmartPtr< AugSystemSolver > | augSysSolver_ |
Pointer to the Solver for the augmented system. More... | |
SmartPtr< PDPerturbationHandler > | perturbHandler_ |
Pointer to the Perturbation Handler. More... | |
Data about the correction made to the system | |
CachedResults< void * > | dummy_cache_ |
A dummy cache to figure out if the deltas are still up to date. More... | |
bool | augsys_improved_ |
Flag indicating if for the current matrix the solution quality of the augmented system solver has already been increased. More... | |
Parameters | |
Index | min_refinement_steps_ |
Minimal number of iterative refinement performed per backsolve. More... | |
Index | max_refinement_steps_ |
Maximal number of iterative refinement performed per backsolve. More... | |
Number | residual_ratio_max_ |
Maximal allowed ratio of the norm of the residual over the norm of the right hand side and solution. More... | |
Number | residual_ratio_singular_ |
If the residual_ratio is larger than this value after trying to improve the solution, the linear system is assumed to be singular and modified. More... | |
Number | residual_improvement_factor_ |
Factor defining require improvement to consider iterative refinement successful. More... | |
Number | neg_curv_test_tol_ |
Tolernace for heuristic to ignore wrong inertia. More... | |
bool | neg_curv_test_reg_ |
Do curvature test with primal regularization. More... | |
Additional Inherited Members | |
![]() | |
const Journalist & | Jnlst () const |
IpoptNLP & | IpNLP () const |
IpoptData & | IpData () const |
IpoptCalculatedQuantities & | IpCq () const |
bool | HaveIpData () const |
This is the implemetation of the Primal-Dual System, using the full space approach with a direct linear solver.
A note on the iterative refinement: We perform at least min_refinement_steps number of iterative refinement steps. If after one iterative refinement the quality of the solution (defined in ResidualRatio) does not improve or the maximal number of iterative refinement steps is exceeded before the tolerance residual_ratio_max_ is satisfied, we first ask the linear solver to solve the system more accurately (e.g. by increasing the pivot tolerance). If that doesn't help or is not possible, we treat the system, as if it is singular (i.e. increase delta's).
Definition at line 32 of file IpPDFullSpaceSolver.hpp.
Ipopt::PDFullSpaceSolver::PDFullSpaceSolver | ( | AugSystemSolver & | augSysSolver, |
PDPerturbationHandler & | perturbHandler | ||
) |
Constructor that takes in the Augmented System solver that is to be used inside.
|
virtual |
Default destructor.
|
private |
Default Constructor.
|
virtual |
overloaded from AlgorithmStrategyObject
Implements Ipopt::PDSystemSolver.
|
virtual |
Solve the primal dual system, given one right hand side.
Implements Ipopt::PDSystemSolver.
|
static |
Methods for IpoptType.
|
private |
Overloaded Equals Operator.
|
private |
Internal function for a single backsolve (which will be used for iterative refinement on the outside).
This method returns false, if for some reason the linear system could not be solved (e.g. when the regularization parameter becomes too large.)
|
private |
Internal function for computing the residual (resid) given the right hand side (rhs) and the solution of the system (res).
|
private |
Internal function for computing the ratio of the residual compared to the right hand side and solution.
The smaller this value, the better the solution.
|
private |
Compute .
|
private |
Pointer to the Solver for the augmented system.
Definition at line 83 of file IpPDFullSpaceSolver.hpp.
|
private |
Pointer to the Perturbation Handler.
Definition at line 85 of file IpPDFullSpaceSolver.hpp.
|
private |
A dummy cache to figure out if the deltas are still up to date.
Definition at line 91 of file IpPDFullSpaceSolver.hpp.
|
private |
Flag indicating if for the current matrix the solution quality of the augmented system solver has already been increased.
Definition at line 94 of file IpPDFullSpaceSolver.hpp.
|
private |
Minimal number of iterative refinement performed per backsolve.
Definition at line 100 of file IpPDFullSpaceSolver.hpp.
|
private |
Maximal number of iterative refinement performed per backsolve.
Definition at line 102 of file IpPDFullSpaceSolver.hpp.
|
private |
Maximal allowed ratio of the norm of the residual over the norm of the right hand side and solution.
Definition at line 105 of file IpPDFullSpaceSolver.hpp.
|
private |
If the residual_ratio is larger than this value after trying to improve the solution, the linear system is assumed to be singular and modified.
Definition at line 109 of file IpPDFullSpaceSolver.hpp.
|
private |
Factor defining require improvement to consider iterative refinement successful.
Definition at line 112 of file IpPDFullSpaceSolver.hpp.
|
private |
Tolernace for heuristic to ignore wrong inertia.
Definition at line 114 of file IpPDFullSpaceSolver.hpp.
|
private |
Do curvature test with primal regularization.
Definition at line 116 of file IpPDFullSpaceSolver.hpp.