This file is indexed.

/usr/include/trilinos/NLPInterfacePack_NLPSecondOrder.hpp is in libtrilinos-dev 10.4.0.dfsg-1ubuntu2.

This file is owned by root:root, with mode 0o644.

The actual contents of the file can be viewed below.

  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
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
// @HEADER
// ***********************************************************************
// 
// Moocho: Multi-functional Object-Oriented arCHitecture for Optimization
//                  Copyright (2003) Sandia Corporation
// 
// Under terms of Contract DE-AC04-94AL85000, there is a non-exclusive
// license for use of this work by or on behalf of the U.S. Government.
// 
// This library is free software; you can redistribute it and/or modify
// it under the terms of the GNU Lesser General Public License as
// published by the Free Software Foundation; either version 2.1 of the
// License, or (at your option) any later version.
//  
// This library is distributed in the hope that it will be useful, but
// WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
// Lesser General Public License for more details.
//  
// You should have received a copy of the GNU Lesser General Public
// License along with this library; if not, write to the Free Software
// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307
// USA
// Questions? Contact Roscoe A. Bartlett (rabartl@sandia.gov) 
// 
// ***********************************************************************
// @HEADER

#ifndef NLP_SECOND_ORDER_INFO_H
#define NLP_SECOND_ORDER_INFO_H

#include "NLPInterfacePack_NLPFirstOrder.hpp"

namespace NLPInterfacePack {

/** \brief NLP second order information interface class {abstract}.
 *
 * <b>Overview:</b>
 *
 * This class adds second order inforamtion to the first order information
 * and basic information given in the <tt>NLPFirstOrder</tt> and base interfaces.
 *
 * Specifically the Hesssian of the Lagrangian is defined as:
 \verbatim

 HL = Hf + sum( Hc(j) * lambda(j), j = 1...m )
 \endverbatim
 * Where: <ul>
 * <li> \c Hf is the hessian of the objective function \a f(x)
 * <li> \c Hc(j) is the hessian of the \c jth equality constriant <i>c<sub>j</sub>(x)</i>
 * <li> \c lambda is the vector of lagrange multipliers for the equality
 *      constraints \a c(x) 
 * </ul>
 *
 * <b>Client Usage:</b>
 *
 * ToDo: Finish Documentation!
 * 
 * <b>Subclass developer's notes:</b>
 *
 * ToDo: Finish Documentation!
 *
 */
class NLPSecondOrder : virtual public NLPFirstOrder {
public:

  /** \brief . */
  typedef Teuchos::RCP<
    const Teuchos::AbstractFactory<MatrixSymOp> >    mat_sym_fcty_ptr_t;

  /** @name Constructors */
  //@{

  /// Initialize to no reference set to calculation quanities
  NLPSecondOrder();

  //@}

  /** @name NLP initialization */
  //@{
  
  /** \brief Initialize the NLP for its first use.
   *
   * This function implementation should be called by subclass implementations
   * in order to reset counts for \c f(x), \c c(x), \c h(x), \c Gf(x), \c Gc(x),
   * \c Gh(x) and \c HL(x) evaluations.  This implementation calls
   * <tt>this->NLPFirstOrder::initialize()</tt>
    *
   * Postconditions:<ul>
   * <li> See <tt>NLPFirstOrder::initialize()</tt>
   * <li> <tt>this->num_HL_evals() == 0</tt>
   * </ul>
   */
  void initialize(bool test_setup);

  //@}

  /** @name Matrix factory objects */
  //@{

  /** \brief Return a matrix factory object for creating <tt>HL</tt>.
   *
   * The returned matrix object may not support the creation of any
   * sub-matrix spaces (i.e. <tt>return->sub_space(rrng,crng).get() == NULL</tt>
   * for all <tt>rrng</tt> and <tt>crng</tt>).
   */
  virtual const mat_sym_fcty_ptr_t factory_HL() const = 0;

  //@}

  /** @name <<std aggr>> members for the Hessian of the Lagrangian HL */
  //@{

  /** \brief Set a pointer to a matrix object to be updated when <tt>this->calc_HL()</tt> is called.
   *
   * @param  HL  [in] Pointer to Hessian of the Lagrangian matrix.  May be \c NULL.
   *
   * Preconditions:<ul>
   * <li> <tt>this->is_initialized() == true</tt> (throw <tt>NotInitialized</tt>)
   * </ul>
   *
   * Postconditions:<ul>
   * <li> <tt>this->get_HL() == HL</tt>
   * </ul>
   */
  virtual void set_HL(MatrixSymOp* HL);
  /** \brief Return pointer passed to <tt>this->set_HL()</tt>.
   *
   * Preconditions:<ul>
   * <li> <tt>this->is_initialized() == true</tt> (throw <tt>NotInitialized</tt>)
   * </ul>
   */
  virtual MatrixSymOp* get_HL();
  /** \brief Returns non-<tt>const</tt> <tt>*this->get_HL()</tt>.
   *
   * Preconditions:<ul>
   * <li> <tt>this->is_initialized() == true</tt> (throw <tt>NotInitialized</tt>)
   * <li> <tt>this->get_HL() != NULL</tt> (throw <tt>NoRefSet</tt>)
   * </ul>
   */
  virtual MatrixSymOp& HL();
  /** \brief Returns <tt>const</tt> <tt>*this->get_HL()</tt>.
   *
   * Preconditions:<ul>
   * <li> <tt>this->is_initialized() == true</tt> (throw <tt>NotInitialized</tt>)
   * <li> <tt>this->get_HL() != NULL</tt> (throw <tt>NoRefSet</tt>)
   * </ul>
   */
  virtual const MatrixSymOp& HL() const;

  //@}

  /** @name Unset calculation quantities */
  //@{
  
  /** \brief Call to unset all storage quantities (both in this class and all subclasses).
   *
   * Preconditions:<ul>
   * <li> <tt>this->is_initialized() == true</tt> (throw <tt>NotInitialized</tt>)
   * </ul>
   *
   * Postconditions:<ul>
   * <li> See <tt>NLPFirstOrder::unset_quantities()</tt>
   * <li> <tt>this->get_HL() == NULL</tt>
   * </ul>
   *
   * This method must be called by all subclasses that override it.
   */
  void unset_quantities();

  //@}

  /** @name Calculation Members */
  //@{

  /** \brief Update the matrix for <tt>HL</tt> at the point <tt>x</tt>, <tt>lambda</tt>,
   * <tt>lambdaI</tt> and put it in the stored reference.
   *
   * The referenced storage for <tt>f</tt>, <tt>c</tt>, <tt>Gf</tt> and <tt>Gc</tt>
   * may also be changed but are not guarentied to be.
   * But no other quanities from possible subclasses are allowed to be updated as a side effect.
   *
   * @param  x        [in] Unknown primal variables
   * @param  lambda   [in] Lagrange muitipliers for equality constriants.
   *                  If <tt>m() == 0</tt> then <tt>lambda</tt> must be <tt>NULL</tt>.  However, if
   *                  <tt>m() > 0</tt> then <tt>lambda == NULL</tt> is still allowed and is treated
   *                  as <tt>lambda = 0</tt>.
   * @param  newpoint [in] (default \c true) If \c false, the values in \c x, \c lambda and \c lambdaI
   *                  are the same as the last call to <tt>this->calc_HL()</tt>.
   *                  If \c true, then this is a new point.
   *
   * Preconditions:<ul>
   * <li> <tt>this->is_initialized() == true</tt> (throw <tt>NotInitialized</tt>)
   * <li> <tt>x.space().is_compatible(*this->space_x()) == true</tt> (throw <tt>VectorSpace::IncompatibleVectorSpaces</tt>)
   * <li> <tt>this->get_HL() != NULL</tt> (throw <tt>NoRefSet</tt>)
   * <li> [<tt>this->m() == 0</tt>] <tt>lambda == NULL</tt> (throw <tt>std::invalid_argument</tt>)
   * <li> [<tt>this->m() != 0 && lambda != 0</tt>] <tt>lambda->space().is_compatible(*this->space_c()) == true)</tt>
   *      (throw <tt>std::invalid_argument</tt>)
   * </ul>
   *
   * Postconditions:<ul>
   * <li> <tt>this->HL()</tt> is updated to \c HL(x)
   * </ul>
   */ 
  virtual void calc_HL(
    const Vector& x, const Vector* lambda, bool newpoint = true) const;

  //@}

  /** @name Number of function evaluations */
  //@{

  /** \brief Number of Hessian evaluations.
    *
    * This function can be called to find out how many evaluations
    * the client requested since \c initialize() was called.
    */
  virtual size_type num_HL_evals() const;

  //@}

protected:

  /** \brief Struct for zero, first and second order quantities (pointers)
   */
  struct SecondOrderInfo {
    /** \brief . */
    SecondOrderInfo()
      : HL(NULL), Gc(NULL), Gf(NULL), f(NULL), c(NULL)
      {}
    /** \brief . */
    SecondOrderInfo( MatrixSymOp* HL_in, const FirstOrderInfo& first_order_info )
      :HL(HL_in), Gc(first_order_info.Gc), Gf(first_order_info.Gf)
      ,f(first_order_info.f), c(first_order_info.c)
      {}
    /// Pointer to Hessiand of the Lagrangian <tt>HL</tt>) (may be NULL is not set)
    MatrixSymOp*        HL;
    /// Pointer to Hessian of the equality constraints <tt>Gc</tt> (may be NULL if not set)
    MatrixOp*           Gc;
    /// Pointer to gradient of objective function <tt>Gf</tt> (may be NULL if not set)
    VectorMutable*      Gf;
    /// Pointer to objective function <tt>f</tt> (may be NULL if not set)
    value_type*         f;
    /// Pointer to equality constraints residule <tt>c</tt> (may be NULL if not set)
    VectorMutable*      c;
  }; // end struct SecondOrderInfo

  /// Return objective gradient and zero order information.
  const SecondOrderInfo second_order_info() const;

  /** @name Protected methods to be overridden by subclasses */
  //@{

  /** \brief Overridden to compute <tt>Gc(x)</tt> and perhaps <tt>Gf(x)</tt>, <tt>f(x)</tt> and <tt>c(x)</tt>.
   *
   * @param x                     [in] Unknown vector (size n).
   * @param lambda                [in] Lagrange multipliers for equality constraints c(x).
   *                              Must be <tt>NULL</tt> if <tt>m() == 0</tt>.  If \c NULL, then
   *                              treated as <tt>lambda = 0</tt>.
   * @param  newpoint             [in] (default \c true) If \c false, the values in \c x, \c lambda and \c lambdaI
   *                              are the same as the last call to <tt>this->calc_HL()</tt>.
   *                              If \c true, then this is a new point.
   * @param second_order_info     [out] Pointers to \c HL, \c Gc, \c Gh, \c Gf, \c f, \c c and \c h
   *                              On output <tt>*second_order_info.HL</tt> is updated to \a HL(x).
   *                              Any of the other objects pointed to in \c second_order_info may
   *                              also be updated but are not guaranteed to be.
   *
   * Preconditions:<ul>
   * <li> <tt>x.space().is_compatible(*this->space_x())</tt> (throw <tt>IncompatibleType</tt>)
   * <li> <tt>second_order_info.HL != NULL</tt> (throw <tt>std::invalid_argument</tt>)
   * </ul>
   *
   * Postconditions:<ul>
   * <li> <tt>*second_order_info.HL</tt> is updated to \a HL(x).
   * </ul>
   */
  virtual void imp_calc_HL(
    const Vector& x, const Vector* lambda, bool newpoint
    ,const SecondOrderInfo& second_order_info
    ) const = 0;

  //@}

private:

#ifdef DOXYGEN_COMPILE
  Teuchos::AbstractFactory<AbstractLinAlgPack::MatrixSymOp>  *factory_HL;
#endif
  mutable MatrixSymOp   *HL_;
  mutable bool          num_HL_evals_;

};	// end class NLPSecondOrder

// //////////////////
// Inline members

inline
const NLPSecondOrder::SecondOrderInfo NLPSecondOrder::second_order_info() const
{
  return SecondOrderInfo(HL_,first_order_info());
}

}	// end namespace NLPInterfacePack 

#endif // NLP_SECOND_ORDER_INFO_H