ipopt-src 0.2.3+3.14.16

Redistribution of Coin-OR Ipopt as a crate
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144

// Copyright (C) 2005, 2009 International Business Machines and others.
// All Rights Reserved.
// This code is published under the Eclipse Public License.
//
// Authors:  Andreas Waechter          IBM    2005-08-15

#include "IpSolveStatistics.hpp"
#include "IpIpoptCalculatedQuantities.hpp"
#include "IpIpoptNLP.hpp"
#include "IpIpoptData.hpp"

namespace Ipopt
{

SolveStatistics::SolveStatistics(
   const SmartPtr<IpoptNLP>&                  ip_nlp,
   const SmartPtr<IpoptData>&                 ip_data,
   const SmartPtr<IpoptCalculatedQuantities>& ip_cq
)
   : num_iters_(ip_data->iter_count()),
     total_cpu_time_(ip_data->TimingStats().OverallAlgorithm().TotalCpuTime()),
     total_sys_time_(ip_data->TimingStats().OverallAlgorithm().TotalSysTime()),
     total_wallclock_time_(ip_data->TimingStats().OverallAlgorithm().TotalWallclockTime()),
     num_obj_evals_(ip_nlp->f_evals()),
     num_constr_evals_(Max(ip_nlp->c_evals(), ip_nlp->d_evals())),
     num_obj_grad_evals_(ip_nlp->grad_f_evals()),
     num_constr_jac_evals_(Max(ip_nlp->jac_c_evals(), ip_nlp->jac_d_evals())),
     num_hess_evals_(ip_nlp->h_evals()),
     scaled_obj_val_(ip_cq->curr_f()),
     obj_val_(ip_cq->unscaled_curr_f()),
     scaled_dual_inf_(ip_cq->curr_dual_infeasibility(NORM_MAX)),
     dual_inf_(ip_cq->unscaled_curr_dual_infeasibility(NORM_MAX)),
     scaled_constr_viol_(ip_cq->curr_nlp_constraint_violation(NORM_MAX)),
     constr_viol_(ip_cq->unscaled_curr_nlp_constraint_violation(NORM_MAX)),
     scaled_bound_viol_(ip_cq->curr_orig_bounds_violation(NORM_MAX)),
     bound_viol_(ip_cq->unscaled_curr_orig_bounds_violation(NORM_MAX)),
     scaled_compl_(ip_cq->curr_complementarity(0., NORM_MAX)),
     compl_(ip_cq->unscaled_curr_complementarity(0., NORM_MAX)),
     scaled_kkt_error_(ip_cq->curr_nlp_error()),
     kkt_error_(ip_cq->unscaled_curr_nlp_error())
{ }

Index SolveStatistics::IterationCount() const
{
   return num_iters_;
}

Number SolveStatistics::TotalCpuTime() const
{
   return total_cpu_time_;
}

Number SolveStatistics::TotalSysTime() const
{
   return total_sys_time_;
}

Number SolveStatistics::TotalWallclockTime() const
{
   return total_wallclock_time_;
}

void SolveStatistics::NumberOfEvaluations(
   Index& num_obj_evals,
   Index& num_constr_evals,
   Index& num_obj_grad_evals,
   Index& num_constr_jac_evals,
   Index& num_hess_evals
) const
{
   num_obj_evals        = num_obj_evals_;
   num_constr_evals     = num_constr_evals_;
   num_obj_grad_evals   = num_obj_grad_evals_;
   num_constr_jac_evals = num_constr_jac_evals_;
   num_hess_evals       = num_hess_evals_;
}

void SolveStatistics::Infeasibilities(
   Number& dual_inf,
   Number& constr_viol,
   Number& complementarity,
   Number& kkt_error
) const
{
   dual_inf        = dual_inf_;
   constr_viol     = constr_viol_;
   complementarity = compl_;
   kkt_error       = kkt_error_;
}

void SolveStatistics::Infeasibilities(
   Number& dual_inf,
   Number& constr_viol,
   Number& varbounds_viol,
   Number& complementarity,
   Number& kkt_error
) const
{
   dual_inf        = dual_inf_;
   constr_viol     = constr_viol_;
   varbounds_viol  = bound_viol_;
   complementarity = compl_;
   kkt_error       = kkt_error_;
}

void SolveStatistics::ScaledInfeasibilities(
   Number& scaled_dual_inf,
   Number& scaled_constr_viol,
   Number& scaled_complementarity,
   Number& scaled_kkt_error
) const
{
   scaled_dual_inf        = scaled_dual_inf_;
   scaled_constr_viol     = scaled_constr_viol_;
   scaled_complementarity = scaled_compl_;
   scaled_kkt_error       = scaled_kkt_error_;
}

void SolveStatistics::ScaledInfeasibilities(
   Number& scaled_dual_inf,
   Number& scaled_constr_viol,
   Number& scaled_varbound_viol,
   Number& scaled_complementarity,
   Number& scaled_kkt_error
) const
{
   scaled_dual_inf        = scaled_dual_inf_;
   scaled_constr_viol     = scaled_constr_viol_;
   scaled_varbound_viol   = scaled_bound_viol_;
   scaled_complementarity = scaled_compl_;
   scaled_kkt_error       = scaled_kkt_error_;
}

Number SolveStatistics::FinalObjective() const
{
   return obj_val_;
}

Number SolveStatistics::FinalScaledObjective() const
{
   return scaled_obj_val_;
}

} // namespace Ipopt