This file is indexed.

/usr/include/trilinos/ROL_ObjectiveFromBoundConstraint.hpp is in libtrilinos-rol-dev 12.10.1-3.

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
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are
// met:
//
// 1. Redistributions of source code must retain the above copyright
// notice, this list of conditions and the following disclaimer.
//
// 2. Redistributions in binary form must reproduce the above copyright
// notice, this list of conditions and the following disclaimer in the
// documentation and/or other materials provided with the distribution.
//
// 3. Neither the name of the Corporation nor the names of the
// contributors may be used to endorse or promote products derived from
// this software without specific prior written permission.
//
// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY
// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE
// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
//
// Questions? Contact lead developers:
//              Drew Kouri   (dpkouri@sandia.gov) and
//              Denis Ridzal (dridzal@sandia.gov)
//
// ************************************************************************
// @HEADER

#ifndef ROL_OBJECTIVE_FROM_BOUND_CONSTRAINT_H
#define ROL_OBJECTIVE_FROM_BOUND_CONSTRAINT_H

#include "ROL_Objective.hpp"
#include "ROL_BoundConstraint.hpp"

#include "Teuchos_ParameterList.hpp"

namespace ROL {


/** @ingroup func_group
    \class ROL::ObjectiveFromBoundConstraint 
    \brief Create a penalty objective from upper and lower bound vectors
 */

template <class Real> 
class ObjectiveFromBoundConstraint : public Objective<Real> {

  typedef Vector<Real> V;

  typedef Elementwise::Axpy<Real>              Axpy;
  typedef Elementwise::Aypx<Real>              Aypx;
  typedef Elementwise::Scale<Real>             Scale;
  typedef Elementwise::Reciprocal<Real>        Reciprocal;
  typedef Elementwise::Power<Real>             Power;
  typedef Elementwise::Logarithm<Real>         Logarithm;
  typedef Elementwise::Multiply<Real>          Multiply; 
  typedef Elementwise::Heaviside<Real>         Heaviside;
  typedef Elementwise::ThresholdUpper<Real>    ThresholdUpper;
  typedef Elementwise::ThresholdLower<Real>    ThresholdLower;
  typedef Elementwise::ReductionSum<Real>      Sum;
  typedef Elementwise::UnaryFunction<Real>     UnaryFunction;
 


  enum EBarrierType {
    BARRIER_LOGARITHM = 0,
    BARRIER_QUADRATIC,     
    BARRIER_DOUBLEWELL,  
    BARRIER_LAST
  } eBarrierType_; 

  inline std::string EBarrierToString( EBarrierType type ) {
    std::string retString;
    switch(type) {
      case BARRIER_LOGARITHM:
        retString = "Logarithmic"; 
        break;
      case BARRIER_QUADRATIC:
        retString = "Quadratic";
        break;
      case BARRIER_DOUBLEWELL:
        retString = "Double Well";
        break;   
      case BARRIER_LAST:
        retString = "Last Type (Dummy)";
        break;
      default:
        retString = "Invalid EBarrierType";
        break;
    }
    return retString;
  }

  inline EBarrierType StringToEBarrierType( std::string s ) {
    s = removeStringFormat(s);
    EBarrierType type = BARRIER_LOGARITHM;
    for( int to = BARRIER_LOGARITHM; to != BARRIER_LAST; ++to ) {
      type = static_cast<EBarrierType>(to);
      if( !s.compare(removeStringFormat(EBarrierToString(type))) ) {
        return type;
      }
    }
    return type;
  }   




private:
  const Teuchos::RCP<const V> lo_;
  const Teuchos::RCP<const V> up_;
  Teuchos::RCP<V> a_;     // scratch vector
  Teuchos::RCP<V> b_;     // scratch vector
  EBarrierType    btype_;

public:
 
  ObjectiveFromBoundConstraint( const BoundConstraint<Real> &bc,
                                Teuchos::ParameterList &parlist ) :
    lo_( bc.getLowerVectorRCP() ),
    up_( bc.getUpperVectorRCP() ) {

    a_ = lo_->clone();
    b_ = up_->clone();

    std::string bfstring = parlist.sublist("Barrier Function").get("Type","Logarithmic");
    btype_ = StringToEBarrierType(bfstring); 
  }

  ObjectiveFromBoundConstraint( const BoundConstraint<Real> &bc ) :
    lo_( bc.getLowerVectorRCP() ),
    up_( bc.getUpperVectorRCP() )
    { 
      a_ = lo_->clone();
      b_ = up_->clone();
    }


  Real value( const Vector<Real> &x, Real &tol ) {

    Teuchos::RCP<UnaryFunction> func;

    switch(btype_) {
      case BARRIER_LOGARITHM:

        a_->set(*lo_);                         // a = l
        a_->applyBinary(Aypx(-1.0),x);         // a = x-l
        a_->applyUnary(Logarithm());           // a = log(x-l)
        a_->applyUnary(Scale(-1.0));           // a = -log(x-l)  
               
        b_->set(x);                            // b = x
        b_->applyBinary(Aypx(-1.0),*up_);      // b = u-x
        b_->applyUnary(Logarithm());           // b = log(u-x)
        b_->applyUnary(Scale(-1.0));           // b = -log(u-x)

        b_->plus(*a_);                         // b = -log(x-l)-log(u-x)

        break;

      case BARRIER_QUADRATIC:
        
        a_->set(*lo_);                         // a = l
        a_->applyBinary(Aypx(-1.0),x);         // a = x-l
        a_->applyUnary(ThresholdLower(0.0));   // a = min(x-l,0)
        a_->applyUnary(Power(2.0));            // a = min(x-l,0)^2

        b_->set(*up_);                         // b = u
        b_->applyBinary(Aypx(-1.0),x);         // b = x-u
        b_->applyUnary(ThresholdUpper(0.0));   // b = max(x-u,0)
        b_->applyUnary(Power(2.0));            // b = max(x-u,0)^2

        b_->plus(*a_);                         // b = min(x-l,0)^2 + max(x-u,0)^2  
  
        break;

      case BARRIER_DOUBLEWELL:

        a_->set(*lo_);                        // a = l
        a_->applyBinary(Aypx(-1.0),x);        // a = x-l
        a_->applyUnary(Power(2.0));           // a = (x-l)^2

        b_->set(x);                           // b = x
        b_->applyBinary(Aypx(-1.0),*up_);     // b = u-x
        b_->applyUnary(Power(2.0));           // b = (u-x)^2
       
        b_->applyBinary(Multiply(),*a_);      // b = (x-l)^2*(u-x)^2 

        break;

      default:
        TEUCHOS_TEST_FOR_EXCEPTION(true,std::invalid_argument,
          ">>>(ObjectiveFromBoundConstraint::value): Undefined barrier function type!"); 

        break;
    }

    Real result = b_->reduce(Sum()); 
    return result;

  }

  void gradient( Vector<Real> &g, const Vector<Real> &x, Real &tol ) {

    switch(btype_) {
      case BARRIER_LOGARITHM:

        a_->set(*lo_);                     // a = l
        a_->applyBinary(Aypx(-1.0),x);     // a = x-l
        a_->applyUnary(Reciprocal());      // a = 1/(x-l)
        a_->applyUnary(Scale(-1.0));       // a = -1/(x-l)  
               
        b_->set(x);                        // b = x
        b_->applyBinary(Aypx(-1.0),*up_);  // b = u-x
        b_->applyUnary(Reciprocal());      // b = 1/(u-x)

        b_->plus(*a_);                     // b = -1/(x-l)+1/(u-x)

        break;

      case BARRIER_QUADRATIC:

        a_->set(*lo_);                         // a = l
        a_->applyBinary(Aypx(-1.0),x);         // a = x-l
        a_->applyUnary(ThresholdLower(0.0));   // a = min(x-l,0)

        b_->set(*up_);                         // b = u
        b_->applyBinary(Aypx(-1.0),x);         // b = x-u
        b_->applyUnary(ThresholdUpper(0.0));   // b = max(x-u,0)

        b_->plus(*a_);                         // b = max(x-u,0) + min(x-l,0)
        b_->scale(2.0);                        // b = 2*max(x-u,0) + 2*min(x-l,0)
        break;

      case BARRIER_DOUBLEWELL:

        a_->set(*lo_);                     // a = l
        a_->applyBinary(Aypx(-1.0),x);     // a = x-l

        b_->set(x);                        // b = x
        b_->applyBinary(Aypx(-1.0),*up_);  // b = u-x
       
        a_->applyBinary(Aypx(-1.0),*b_);   // a = (u-x)-(x-l)
        a_->applyUnary(Scale(2.0));        // a = 2*[(u-x)-(x-l)]          
 
        b_->set(x);                        // b = x
        b_->applyBinary(Aypx(-1.0),*up_);  // b = u-x

        a_->applyBinary(Multiply(),*b_);   // a = [(u-x)-(x-l)]*(u-x);
         
        
        b_->set(*lo_);                     // b = l
        b_->applyBinary(Aypx(-1.0),x);     // b = x-l
        b_->applyBinary(Multiply(),*a_);   // b = [(u-x)-(x-l)]*(u-x)*(x-l) 

        break;

      default:
        TEUCHOS_TEST_FOR_EXCEPTION(true,std::invalid_argument,
          ">>>(ObjectiveFromBoundConstraint::gradient): Undefined barrier function type!"); 

        break;
    }

    g.set(*b_);

  }

  void hessVec( Vector<Real> &hv, const Vector<Real> &v, const Vector<Real> &x, Real &tol ) {

    switch(btype_) {
      case BARRIER_LOGARITHM:

        a_->set(*lo_);                     // a = l
        a_->applyBinary(Axpy(-1.0),x);     // a = x-l
        a_->applyUnary(Reciprocal());      // a = 1/(x-l)
        a_->applyUnary(Power(2.0));        // a = 1/(x-l)^2  
               
        b_->set(x);                        // b = x
        b_->applyBinary(Axpy(-1.0),*up_);  // b = u-x
        b_->applyUnary(Reciprocal());      // b = 1/(u-x)
        b_->applyUnary(Power(2.0));        // b = 1/(u-x)^2

        b_->plus(*a_);                     // b = 1/(x-l)^2 + 1/(u-x)^2

        break;
  
      case BARRIER_QUADRATIC:
 
        a_->set(*lo_);                     // a = l
        a_->applyBinary(Axpy(-1.0),x);     // a = x-l
        a_->scale(-1.0);                   // a = l-x
        a_->applyUnary(Heaviside());       // a = theta(l-x)

        b_->set(*up_);                     // b = u
        b_->applyBinary(Axpy(-1.0),x);     // b = x-u
        b_->applyUnary(Heaviside());       // b = theta(x-u)
        b_->plus(*a_);                     // b = theta(l-x) + theta(x-u)
        b_->scale(2.0);                    // b = 2*theta(l-x) + 2*theta(x-u)

        break;

      case BARRIER_DOUBLEWELL:

        a_->set(*lo_);                      // a = l
        a_->applyBinary(Axpy(-1.0),x);      // a = x-l

        b_->set(x);                         // b = x
        b_->applyBinary(Axpy(-1.0),*up_);   // b = u-x

        b_->applyBinary(Multiply(),*a_);    // b = (u-x)*(x-l)
        b_->applyUnary(Scale(-8.0));        // b = -8*(u-x)*(x-l)
 
        a_->applyUnary(Power(2.0));         // a = (x-l)^2
        a_->applyUnary(Scale(2.0));         // a = 2*(x-l)^2
        
        b_->applyBinary(Axpy(1.0),*a_);     // b = 2*(x-l)^2-8*(u-x)*(x-l)

        a_->set(x);                         // a = x
        a_->applyBinary(Axpy(-1.0),*up_);   // a = u-x
        a_->applyUnary(Power(2.0));         // a = (u-x)^2
        a_->applyUnary(Scale(2.0));         // a = 2*(u-x)^2

        b_->plus(*a_);                      // b = 2*(u-x)^2-8*(u-x)*(x-l)+2*(x-l)         
         
        
        break;

      default:
        TEUCHOS_TEST_FOR_EXCEPTION(true,std::invalid_argument,
          ">>>(ObjectiveFromBoundConstraint::hessVec): Undefined barrier function type!"); 

        break;
    }
   
    hv.set(v);
    hv.applyBinary(Multiply(),*b_); 
    
  }
  
  // For testing purposes
  Teuchos::RCP<Vector<Real> > getBarrierVector(void) {
    return b_;
  } 


}; // class ObjectiveFromBoundConstraint

}


#endif // ROL_OBJECTIVE_FROM_BOUND_CONSTRAINT_H