ROL_TypeP_Algorithm.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_TYPEP_ALGORITHM_H
#define ROL_TYPEP_ALGORITHM_H
 
#include "ROL_CombinedStatusTest.hpp"
#include "ROL_Objective.hpp"
#include "ROL_Problem.hpp"

 
namespace ROL {
namespace TypeP { 
 
template<typename Real>
struct AlgorithmState : public ROL::AlgorithmState<Real> {
  Real searchSize, svalue, nvalue;
  Ptr<Vector<Real>> stepVec, gradientVec;
  int nprox, nsval, nnval;
 
  AlgorithmState()
    : searchSize(1),
      svalue(ROL_INF<Real>()),
      nvalue(ROL_INF<Real>()),
      stepVec(nullPtr),
      gradientVec(nullPtr),
      nprox(0),
      nsval(0),
      nnval(0) {}
 
  void reset() {
    ROL::AlgorithmState<Real>::reset();
    searchSize = static_cast<Real>(1);
    svalue     = ROL_INF<Real>(); 
    nvalue     = ROL_INF<Real>(); 
    if (stepVec != nullPtr)
      stepVec->zero();
    if (gradientVec != nullPtr)
      gradientVec->zero();
    nprox = 0;
    nsval = 0; 
    nnval = 0; 
  }
};
 
template<typename Real>
class Algorithm {
protected:
  const Ptr<CombinedStatusTest<Real>> status_;
  const Ptr<AlgorithmState<Real>>     state_;
 
  void initialize(const Vector<Real> &x, const Vector<Real> &g); 
  void pgstep(Vector<Real>       &pgiter, // pgiter = Prox(x - t dg)
              Vector<Real>       &pgstep, // pgstep = pgiter - x
              Objective<Real>    &nobj,   // nobj   = nonsmooth objective
              const Vector<Real> &x,      // x      = current iterate
              const Vector<Real> &dg,     // dg     = dual of current gradient
              Real                t,      // t      = prox parameter
              Real               &tol) const;
 
public:
 
  virtual ~Algorithm() {}

  Algorithm();
 
  void setStatusTest(const Ptr<StatusTest<Real>> &status,
                     bool combineStatus = false);

  virtual void run( Problem<Real> &problem,
                    std::ostream  &outStream = std::cout );

  virtual void run( Vector<Real>    &x,
                    Objective<Real> &sobj,
                    Objective<Real> &nobj,
                    std::ostream    &outStream = std::cout );

  virtual void run( Vector<Real>       &x,
                    const Vector<Real> &g, 
                    Objective<Real>    &sobj,
                    Objective<Real>    &nobj,
                    std::ostream       &outStream = std::cout) = 0;

  virtual void writeHeader( std::ostream& os ) const;

  virtual void writeName( std::ostream& os ) const;

  virtual void writeOutput( std::ostream& os, bool write_header = false ) const;
 
  virtual void writeExitStatus( std::ostream& os ) const;
 
  //Ptr<const AlgorithmState<Real>>& getState() const;
  Ptr<const AlgorithmState<Real>> getState() const;
 
  void reset();
 
}; // class ROL::TypeP::Algorithm
} // namespace TypeP
} // namespace ROL
 
#include "ROL_TypeP_Algorithm_Def.hpp"
 
#endif