ROL_ChainRuleObjective.hpp

Go to the documentation of this file.

// @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
 
#ifndef ROL_CHAIN_RULE_OBJECTIVE_HPP
#define ROL_CHAIN_RULE_OBJECTIVE_HPP
 
#include "ROL_Objective.hpp"
#include "ROL_Constraint.hpp"

 
 
namespace ROL {
 
template<typename Real>
class ChainRuleObjective : public ROL::Objective<Real> {
public:

  ChainRuleObjective( const Ptr<Objective<Real>>&  obj,
                      const Ptr<Constraint<Real>>& con,
                      const Vector<Real>& x,
                      const Vector<Real>& l ) 
  : obj_(obj), con_(con), g_(l.clone()), y_(l.dual().clone()), Jv_(l.dual().clone()), 
    HJv_(l.clone()), JtHJv_(x.dual().clone()), tol_(0) {}
 
  virtual ~ChainRuleObjective() = default;

  virtual void update( const Vector<Real> &x, UpdateType type, int iter = -1 ) {
    con_->update(x,type,iter);
    con_->value(*y_,x,tol_);
    obj_->update(*y_,type,iter);
  }

  virtual void update( const Vector<Real> &x, bool flag = true, int iter = -1 ) {
    con_->update(x,flag,iter);
    con_->value(*y_,x,tol_);
    obj_->update(*y_,flag,iter);
  }

  virtual Real value( const Vector<Real> &x, Real &tol ) {
    con_->value(*y_,x,tol);
    return obj_->value(*y_,tol);
  }

  virtual void gradient( Vector<Real> &g, const Vector<Real> &x, Real &tol ) {
    con_->value(*y_,x,tol); 
    obj_->gradient(*g_,*y_,tol);
    con_->applyAdjointJacobian(g,*g_,x,tol);
  }

  virtual void hessVec( Vector<Real> &hv, const Vector<Real> &v, const Vector<Real> &x, Real &tol ) {
    con_->value(*y_,x,tol);
    obj_->gradient(*g_,*y_,tol);
    con_->applyJacobian(*Jv_,v,x,tol);
    obj_->hessVec(*HJv_,*Jv_,*y_,tol);
    con_->applyAdjointJacobian(*JtHJv_,*HJv_,x,tol);
    con_->applyAdjointHessian(hv,*g_,v,x,tol);
    hv.plus(*JtHJv_);
  }
 
private:
 
  const Ptr<Objective<Real>>  obj_;
  const Ptr<Constraint<Real>> con_;
  Ptr<Vector<Real>>           g_, y_, Jv_, HJv_, JtHJv_;    
  Real                        tol_;
 
}; // class ChainRuleObjective
 
} // namespace ROL
 
#endif // ROL_CHAIN_RULE_OBJECTIVE_HPP