ROL
ROL_ExpUtility.hpp
Go to the documentation of this file.
1 // @HEADER
2 // ************************************************************************
3 //
4 // Rapid Optimization Library (ROL) Package
5 // Copyright (2014) Sandia Corporation
6 //
7 // Under terms of Contract DE-AC04-94AL85000, there is a non-exclusive
8 // license for use of this work by or on behalf of the U.S. Government.
9 //
10 // Redistribution and use in source and binary forms, with or without
11 // modification, are permitted provided that the following conditions are
12 // met:
13 //
14 // 1. Redistributions of source code must retain the above copyright
15 // notice, this list of conditions and the following disclaimer.
16 //
17 // 2. Redistributions in binary form must reproduce the above copyright
18 // notice, this list of conditions and the following disclaimer in the
19 // documentation and/or other materials provided with the distribution.
20 //
21 // 3. Neither the name of the Corporation nor the names of the
22 // contributors may be used to endorse or promote products derived from
23 // this software without specific prior written permission.
24 //
25 // THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY
26 // EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
27 // IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
28 // PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE
29 // CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
30 // EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
31 // PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
32 // PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
33 // LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
34 // NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
35 // SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
36 //
37 // Questions? Contact lead developers:
38 // Drew Kouri (dpkouri@sandia.gov) and
39 // Denis Ridzal (dridzal@sandia.gov)
40 //
41 // ************************************************************************
42 // @HEADER
43 
44 #ifndef ROL_EXPUTILITY_HPP
45 #define ROL_EXPUTILITY_HPP
46 
47 #include "ROL_RiskMeasure.hpp"
48 
49 namespace ROL {
50 
51 template<class Real>
52 class ExpUtility : public RiskMeasure<Real> {
53 private:
54  Teuchos::RCP<Vector<Real> > scaledGradient_;
55  Teuchos::RCP<Vector<Real> > dualVector_;
57 
58 public:
59  ExpUtility(void) : RiskMeasure<Real>(), firstReset_(true) {}
60 
61  void reset(Teuchos::RCP<Vector<Real> > &x0, const Vector<Real> &x) {
63  if ( firstReset_ ) {
64  scaledGradient_ = (x.dual()).clone();
65  dualVector_ = (x.dual()).clone();
66  firstReset_ = false;
67  }
68  scaledGradient_->zero();
69  dualVector_->zero();
70  }
71 
72  void reset(Teuchos::RCP<Vector<Real> > &x0, const Vector<Real> &x,
73  Teuchos::RCP<Vector<Real> > &v0, const Vector<Real> &v) {
74  RiskMeasure<Real>::reset(x0,x,v0,v);
75  if ( firstReset_ ) {
76  scaledGradient_ = (x.dual()).clone();
77  dualVector_ = (x.dual()).clone();
78  firstReset_ = false;
79  }
80  scaledGradient_->zero();
81  dualVector_->zero();
82  }
83 
84  void update(const Real val, const Real weight) {
85  RiskMeasure<Real>::val_ += weight * std::exp(val);
86  }
87 
88  void update(const Real val, const Vector<Real> &g, const Real weight) {
89  Real ev = std::exp(val);
90  RiskMeasure<Real>::val_ += weight * ev;
91  RiskMeasure<Real>::g_->axpy(weight*ev,g);
92  }
93 
94  void update(const Real val, const Vector<Real> &g, const Real gv, const Vector<Real> &hv,
95  const Real weight) {
96  Real ev = std::exp(val);
97  RiskMeasure<Real>::val_ += weight * ev;
98  RiskMeasure<Real>::gv_ -= weight * ev * gv;
99  RiskMeasure<Real>::g_->axpy(weight*ev,g);
100  RiskMeasure<Real>::hv_->axpy(weight*ev,hv);
101  scaledGradient_->axpy(weight*ev*gv,g);
102  }
103 
105  Real val = RiskMeasure<Real>::val_;
106  Real ev = 0.0;
107  sampler.sumAll(&val,&ev,1);
108  return std::log(ev);
109  }
110 
111  virtual void getGradient(Vector<Real> &g, SampleGenerator<Real> &sampler) {
112  Real val = RiskMeasure<Real>::val_;
113  Real ev = 0.0;
114  sampler.sumAll(&val,&ev,1);
115  sampler.sumAll(*(RiskMeasure<Real>::g_),g);
116  g.scale(1.0/ev);
117  }
118 
119  virtual void getHessVec(Vector<Real> &hv, SampleGenerator<Real> &sampler) {
120  Real val = RiskMeasure<Real>::val_;
121  Real ev = 0.0;
122  sampler.sumAll(&val,&ev,1);
123 
124  Real gv = RiskMeasure<Real>::gv_;
125  Real egv = 0.0;
126  sampler.sumAll(&gv,&egv,1);
127 
128  sampler.sumAll(*(RiskMeasure<Real>::hv_),hv);
129 
130  sampler.sumAll(*scaledGradient_,*dualVector_);
131  hv.plus(*dualVector_);
132  hv.scale(1.0/ev);
133 
134  dualVector_->zero();
135  sampler.sumAll(*(RiskMeasure<Real>::g_),*dualVector_);
136  dualVector_->scale(egv/(ev*ev));
137  hv.plus(*dualVector_);
138  }
139 };
140 
141 }
142 
143 #endif
virtual const Vector & dual() const
Return dual representation of , for example, the result of applying a Riesz map, or change of basis...
Definition: ROL_Vector.hpp:213
virtual void scale(const Real alpha)=0
Compute where .
void reset(Teuchos::RCP< Vector< Real > > &x0, const Vector< Real > &x, Teuchos::RCP< Vector< Real > > &v0, const Vector< Real > &v)
virtual void plus(const Vector &x)=0
Compute , where .
void update(const Real val, const Vector< Real > &g, const Real weight)
Teuchos::RCP< Vector< Real > > dualVector_
Defines the linear algebra or vector space interface.
Definition: ROL_Vector.hpp:74
void sumAll(Real *input, Real *output, int dim) const
void reset(Teuchos::RCP< Vector< Real > > &x0, const Vector< Real > &x)
Teuchos::RCP< Vector< Real > > scaledGradient_
virtual void getHessVec(Vector< Real > &hv, SampleGenerator< Real > &sampler)
Real getValue(SampleGenerator< Real > &sampler)
void update(const Real val, const Real weight)
virtual void getGradient(Vector< Real > &g, SampleGenerator< Real > &sampler)
void update(const Real val, const Vector< Real > &g, const Real gv, const Vector< Real > &hv, const Real weight)
virtual void reset(Teuchos::RCP< Vector< Real > > &x0, const Vector< Real > &x)