ROL
ROL_TypeB_SpectralGradientAlgorithm.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_TYPEB_SPECTRALGRADIENTALGORITHM_HPP
45 #define ROL_TYPEB_SPECTRALGRADIENTALGORITHM_HPP
46 
47 #include "ROL_TypeB_Algorithm.hpp"
48 
53 namespace ROL {
54 namespace TypeB {
55 
56 template<typename Real>
58 private:
63 
67 
68  void initialize(Vector<Real> &x,
69  const Vector<Real> &g,
70  Objective<Real> &obj,
72  std::ostream &outStream = std::cout);
73 
74 public:
75 
76  SpectralGradientAlgorithm(ParameterList &list);
77 
79  void run( Vector<Real> &x,
80  const Vector<Real> &g,
81  Objective<Real> &obj,
83  std::ostream &outStream = std::cout) override;
84 
85  void writeHeader( std::ostream& os ) const override;
86 
87  void writeName( std::ostream &os ) const override;
88 
89  void writeOutput( std::ostream &os, const bool write_header = false ) const override;
90 
91 }; // class ROL::TypeB::SpectralGradientAlgorithm
92 
93 } // namespace TypeB
94 } // namespace ROL
95 
97 
98 #endif
Provides the interface to evaluate objective functions.
Defines the linear algebra or vector space interface.
Definition: ROL_Vector.hpp:80
void writeOutput(std::ostream &os, const bool write_header=false) const override
Print iterate status.
void writeName(std::ostream &os) const override
Print step name.
Provides an interface to run bound constrained optimization algorithms.
void run(Vector< Real > &x, const Vector< Real > &g, Objective< Real > &obj, BoundConstraint< Real > &bnd, std::ostream &outStream=std::cout) override
Run algorithm on bound constrained problems (Type-B). This general interface supports the use of dual...
Provides an interface to run the spectral projected gradient algorithm.
void initialize(Vector< Real > &x, const Vector< Real > &g, Objective< Real > &obj, BoundConstraint< Real > &bnd, std::ostream &outStream=std::cout)
void writeHeader(std::ostream &os) const override
Print iterate header.
Provides the interface to apply upper and lower bound constraints.