/usr/include/trilinos/ROL_LeastSquares.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 | // @HEADER
// ************************************************************************
//
// Rapid Optimization Library (ROL) Package
// Copyright (2014) 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.
//
// 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
/** \file
\brief Contains definitions for least squares function.
\author Created by D. Ridzal and D. Kouri.
*/
#ifndef USE_HESSVEC
#define USE_HESSVEC 1
#endif
#ifndef ROL_LEASTSQUARES_HPP
#define ROL_LEASTSQUARES_HPP
#include "ROL_StdVector.hpp"
#include "ROL_Objective.hpp"
namespace ROL {
namespace ZOO {
/** \brief Least squares function.
*/
template<class Real>
class Objective_LeastSquares : public Objective<Real> {
typedef typename std::vector<Real>::size_type uint;
public:
Real value( const Vector<Real> &x, Real &tol ) {
Teuchos::RCP<const std::vector<Real> > ex
= Teuchos::dyn_cast<const StdVector<Real> >(x).getVector();
uint n = ex->size();
Real h = 1.0/((Real)n+1.0);
Real val = 0.0;
Real res = 0.0;
for (uint i=0; i<n; i++) {
if ( i == 0 ) {
res = 2.0*h*(5.0/6.0) + 1.0/h*((*ex)[i+1]-2.0*(*ex)[i]);
}
else if ( i == n-1 ) {
res = 2.0*h*(5.0/6.0) + 1.0/h*((*ex)[i-1]-2.0*(*ex)[i]);
}
else {
res = 2.0*h + 1.0/h*((*ex)[i-1]-2.0*(*ex)[i]+(*ex)[i+1]);
}
val += 0.5*res*res;
}
return val;
}
void gradient( Vector<Real> &g, const Vector<Real> &x, Real &tol ) {
Teuchos::RCP<std::vector<Real> > eg
= Teuchos::dyn_cast<StdVector<Real> >(g).getVector();
Teuchos::RCP<const std::vector<Real> > ex
= Teuchos::dyn_cast<const StdVector<Real> >(x).getVector();
uint n = ex->size();
Real h = 1.0/((Real)n+1.0);
std::vector<Real> res(n,0.0);
for (uint i=0; i<n; i++) {
if ( i == 0 ) {
res[i] = 2.0*h*(5.0/6.0) + 1.0/h*((*ex)[i+1]-2.0*(*ex)[i]);
}
else if ( i == n-1 ) {
res[i] = 2.0*h*(5.0/6.0) + 1.0/h*((*ex)[i-1]-2.0*(*ex)[i]);
}
else {
res[i] = 2.0*h + 1.0/h*((*ex)[i-1]-2.0*(*ex)[i]+(*ex)[i+1]);
}
}
for (uint i=0; i<n; i++) {
if ( i == 0 ) {
(*eg)[i] = 1.0/h*(res[i+1]-2.0*res[i]);
}
else if ( i == n-1 ) {
(*eg)[i] = 1.0/h*(res[i-1]-2.0*res[i]);
}
else {
(*eg)[i] = 1.0/h*(res[i-1]-2.0*res[i]+res[i+1]);
}
}
}
#if USE_HESSVEC
void hessVec( Vector<Real> &hv, const Vector<Real> &v, const Vector<Real> &x, Real &tol ) {
Teuchos::RCP<std::vector<Real> > ehv
= Teuchos::dyn_cast<StdVector<Real> >(hv).getVector();
Teuchos::RCP<const std::vector<Real> > ev
= Teuchos::dyn_cast<const StdVector<Real> >(v).getVector();
Teuchos::RCP<const std::vector<Real> > ex
= Teuchos::dyn_cast<const StdVector<Real> >(x).getVector();
uint n = ex->size();
Real h = 1.0/((Real)n+1.0);
std::vector<Real> res(n,0.0);
for (uint i=0; i<n; i++) {
if ( i == 0 ) {
res[i] = 1.0/h*((*ev)[i+1]-2.0*(*ev)[i]);
}
else if ( i == n-1 ) {
res[i] = 1.0/h*((*ev)[i-1]-2.0*(*ev)[i]);
}
else {
res[i] = 1.0/h*((*ev)[i-1]-2.0*(*ev)[i]+(*ev)[i+1]);
}
}
for (uint i=0; i<n; i++) {
if ( i == 0 ) {
(*ehv)[i] = 1.0/h*(res[i+1]-2.0*res[i]);
}
else if ( i == n-1 ) {
(*ehv)[i] = 1.0/h*(res[i-1]-2.0*res[i]);
}
else {
(*ehv)[i] = 1.0/h*(res[i-1]-2.0*res[i]+res[i+1]);
}
}
}
#endif
};
template<class Real>
void getLeastSquares( Teuchos::RCP<Objective<Real> > &obj,
Teuchos::RCP<Vector<Real> > &x0,
Teuchos::RCP<Vector<Real> > &x ) {
// Problem dimension
int n = 32;
// Get Initial Guess
Teuchos::RCP<std::vector<Real> > x0p = Teuchos::rcp(new std::vector<Real>(n,0.0));
for ( int i = 0; i < n; i++ ) {
(*x0p)[i] = 0.0;
}
x0 = Teuchos::rcp(new StdVector<Real>(x0p));
// Get Solution
Teuchos::RCP<std::vector<Real> > xp = Teuchos::rcp(new std::vector<Real>(n,0.0));
Real h = 1.0/((Real)n+1.0), pt = 0.0;
for( int i = 0; i < n; i++ ) {
pt = (Real)(i+1)*h;
(*xp)[i] = pt*(1.0-pt);
}
x = Teuchos::rcp(new StdVector<Real>(xp));
// Instantiate Objective Function
obj = Teuchos::rcp(new Objective_LeastSquares<Real>);
}
} // End ZOO Namespace
} // End ROL Namespace
#endif
|