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
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
// 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 2009-11-05
// (based on IpLowRankAugSystemSolver.hpp rev 1324)
#ifndef __IP_LOWRANKSSAUGSYSTEMSOLVER_HPP__
#define __IP_LOWRANKSSAUGSYSTEMSOLVER_HPP__
#include "IpAugSystemSolver.hpp"
#include "IpDiagMatrix.hpp"
#include "IpCompoundMatrix.hpp"
#include "IpCompoundVector.hpp"
#include "IpExpandedMultiVectorMatrix.hpp"
namespace Ipopt
{
/** Solver for the augmented system with LowRankUpdateSymMatrix
* Hessian matrices.
*
* This version works with only one backsolve
* (so it is better for iterative linear solvers), by augmenting
* the regular augmented system.
*/
class LowRankSSAugSystemSolver: public AugSystemSolver
{
public:
/**@name Constructors / Destructors */
///@{
/** Constructor using an existing augmented system solver. */
LowRankSSAugSystemSolver(
AugSystemSolver& aug_system_solver, /**< augmented system solver to copy */
Index max_rank /**< maximal rank that can appear */
);
/** Destructor */
virtual ~LowRankSSAugSystemSolver();
///@}
bool InitializeImpl(
const OptionsList& options,
const std::string& prefix
);
/** Set up the augmented system and solve it for a given right hand side. */
virtual ESymSolverStatus Solve(
const SymMatrix* W,
Number W_factor,
const Vector* D_x,
Number delta_x,
const Vector* D_s,
Number delta_s,
const Matrix* J_c,
const Vector* D_c,
Number delta_c,
const Matrix* J_d,
const Vector* D_d,
Number delta_d,
const Vector& rhs_x,
const Vector& rhs_s,
const Vector& rhs_c,
const Vector& rhs_d,
Vector& sol_x,
Vector& sol_s,
Vector& sol_c,
Vector& sol_d,
bool check_NegEVals,
Index numberOfNegEVals
);
/** Number of negative eigenvalues detected during last
* solve.
*
* This must not be called if the linear solver does not
* compute this quantities (@see ProvidesInertia).
*
* @return the number of negative eigenvalues of the most recent factorized matrix
*/
virtual Index NumberOfNegEVals() const;
/** Query whether inertia is computed by linear solver.
*
* @return true, if linear solver provides inertia
*/
virtual bool ProvidesInertia() const;
/** Request to increase quality of solution for next solve.
*
* Ask underlying linear solver to increase quality of solution for
* the next solve (e.g. increase pivot tolerance).
*
* @return false, if this is not possible (e.g. maximal pivot tolerance already used)
*/
virtual bool IncreaseQuality();
private:
/**@name 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.
*/
///@{
/** Default constructor. */
LowRankSSAugSystemSolver();
/** Copy Constructor */
LowRankSSAugSystemSolver(
const LowRankSSAugSystemSolver&
);
void operator=(
const LowRankSSAugSystemSolver&
);
///@}
/** The augmented system solver object that should be used for the
* factorization of the augmented system without the low-rank
* update.
*/
SmartPtr<AugSystemSolver> aug_system_solver_;
/** Maximal rank of low rank Hessian update */
Index max_rank_;
/**@name Tags and values to track in order to decide whether the
matrix has to be updated compared to the most recent call of
the Set method.
*/
///@{
/** Tag for W matrix.
*
* If W has been given to Set as NULL, then this tag is set to 0.
*/
TaggedObject::Tag w_tag_;
/** Most recent value of W_factor */
Number w_factor_;
/** Tag for D_x vector, representing the diagonal matrix D_x.
*
* If D_x has been given to Set as NULL, then this tag is set to 0.
*/
TaggedObject::Tag d_x_tag_;
/** Most recent value of delta_x from Set method */
Number delta_x_;
/** Tag for D_s vector, representing the diagonal matrix D_s.
* If D_s has been given to Set as NULL, then this tag is set to 0.
*/
TaggedObject::Tag d_s_tag_;
/** Most recent value of delta_s from Set method */
Number delta_s_;
/** Tag for J_c matrix.
*
* If J_c has been given to Set as NULL, then this tag is set to 0.
*/
TaggedObject::Tag j_c_tag_;
/** Tag for D_c vector, representing the diagonal matrix D_c.
*
* If D_c has been given to Set as NULL, then this tag is set to 0.
*/
TaggedObject::Tag d_c_tag_;
/** Most recent value of delta_c from Set method */
Number delta_c_;
/** Tag for J_d matrix.
*
* If J_d has been given to Set as NULL, then this tag is set to 0.
*/
TaggedObject::Tag j_d_tag_;
/** Tag for D_d vector, representing the diagonal matrix D_d.
*
* If D_d has been given to Set as NULL, then this tag is set to 0.
*/
TaggedObject::Tag d_d_tag_;
/** Most recent value of delta_d from Set method */
Number delta_d_;
///@}
/** Flag indicating if this is the first call */
bool first_call_;
/** @name Information to be stored in order to resolve for the
* same matrix with a different right hand side. */
///@{
/** Hessian Matrix passed to the augmented system solver solving
* the matrix without the low-rank update.
*/
SmartPtr<DiagMatrix> Wdiag_;
/** Artificial rows for Jac_c part for low rank data */
SmartPtr<ExpandedMultiVectorMatrix> expanded_vu_;
/** Extended Jac_c to include expanded_vu_ */
SmartPtr<CompoundMatrix> J_c_ext_;
/** Extended D_c diagonal */
SmartPtr<CompoundVector> D_c_ext_;
/** Extended vector space for y_c */
SmartPtr<CompoundVectorSpace> y_c_ext_space_;
/** Number of components in V, so that it can be used to correct
* the inertia */
Index negEvalsCorrection_;
///@}
/** Stores the number of negative eigenvalues detected during most
* recent factorization.
*
* This is what is returned by NumberOfNegEVals() of this class.
* It usually is the number of
* negative eigenvalues returned from the aug_system_solver solve,
* but if a Cholesky factorization could not be performed, the
* returned value is one more than this what the
* aug_system_solver returned.
*/
Index num_neg_evals_;
/** @name Internal functions */
///@{
/** Method for updating the factorization, including J1_, J2_,
* Vtilde1_, Utilde2, Wdiag_, compound_sol_vecspace_.
*/
ESymSolverStatus UpdateExtendedData(
const SymMatrix* W,
Number W_factor,
const Vector* D_x,
Number delta_x,
const Vector* D_s,
Number delta_s,
const Matrix& J_c,
const Vector* D_c,
Number delta_c,
const Matrix& J_d,
const Vector* D_d,
Number delta_d,
const Vector& proto_rhs_x,
const Vector& proto_rhs_s,
const Vector& proto_rhs_c,
const Vector& proto_rhs_d
);
/** Method that compares the tags of the data for the matrix with
* those from the previous call.
*
* @return true, if there was a change and the factorization has to be updated
*/
bool AugmentedSystemRequiresChange(
const SymMatrix* W,
Number W_factor,
const Vector* D_x,
Number delta_x,
const Vector* D_s,
Number delta_s,
const Matrix& J_c,
const Vector* D_c,
Number delta_c,
const Matrix& J_d,
const Vector* D_d,
Number delta_d
);
///@}
};
} // namespace Ipopt
#endif