GlobiPack  Version of the Day
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Groups Pages
GlobiPack_BrentsLineSearch_decl.hpp
1 /*
2 // @HEADER
3 // ***********************************************************************
4 //
5 // GlobiPack: Collection of Scalar 1D globalizaton utilities
6 // Copyright (2009) Sandia Corporation
7 //
8 // Under terms of Contract DE-AC04-94AL85000, there is a non-exclusive
9 // license for use of this work by or on behalf of the U.S. Government.
10 //
11 // Redistribution and use in source and binary forms, with or without
12 // modification, are permitted provided that the following conditions are
13 // met:
14 //
15 // 1. Redistributions of source code must retain the above copyright
16 // notice, this list of conditions and the following disclaimer.
17 //
18 // 2. Redistributions in binary form must reproduce the above copyright
19 // notice, this list of conditions and the following disclaimer in the
20 // documentation and/or other materials provided with the distribution.
21 //
22 // 3. Neither the name of the Corporation nor the names of the
23 // contributors may be used to endorse or promote products derived from
24 // this software without specific prior written permission.
25 //
26 // THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY
27 // EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
28 // IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
29 // PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE
30 // CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
31 // EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
32 // PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
33 // PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
34 // LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
35 // NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
36 // SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
37 //
38 // Questions? Contact Roscoe A. Bartlett (rabartl@sandia.gov)
39 //
40 // ***********************************************************************
41 // @HEADER
42 */
43 
44 #ifndef GLOBIPACK_BRENTS_LINE_SEARCH_DECL_HPP
45 #define GLOBIPACK_BRENTS_LINE_SEARCH_DECL_HPP
46 
47 
48 #include "GlobiPack_LineSearchBase.hpp"
49 #include "GlobiPack_GoldenQuadInterpBracket.hpp"
50 #include "GlobiPack_Brents1DMinimization.hpp"
51 #include "Teuchos_ParameterListAcceptorDefaultBase.hpp"
52 
53 
54 namespace GlobiPack {
55 
56 
72 template<typename Scalar>
74  : public LineSearchBase<Scalar>,
76 {
77 public:
78 
81 
84 
87 
90 
92 
95 
97  void setParameterList(RCP<ParameterList> const& paramList);
100 
102 
105 
107  virtual bool requiresBaseDeriv() const;
108 
110  virtual bool requiresDerivEvals() const;
111 
113  virtual bool doLineSearch(
114  const MeritFunc1DBase<Scalar> &phi,
115  const PointEval1D<Scalar> &point_k,
116  const Ptr<PointEval1D<Scalar> > &point_kp1,
117  const Ptr<int> &numIters
118  ) const;
119 
121 
122 private:
123 
124  // //////////////////////
125  // Private data members
126 
128  Brents1DMinimization<Scalar> brentsMin_;
129 
130 };
131 
132 
137 template<typename Scalar>
139 {
141 }
142 
143 
144 // Default values are exposed here for unit testing purposes
145 
146 
147 namespace BrentsLineSearchUtils {
148 
149 
150 const std::string bracket_name = "Bracket";
151 
152 const std::string minimize_name = "Minimize";
153 
154 
155 } // namespace BrentsLineSearchUtils
156 
157 
158 
159 } // namespace GlobiPack
160 
161 
162 #endif // GLOBIPACK_BRENTS_LINE_SEARCH_DECL_HPP
virtual bool requiresBaseDeriv() const
Returns true.
void setParameterList(RCP< ParameterList > const &paramList)
Simple concrete class that implements a 1D algorithm to mimimize a 1D function.
Simple concrete class that implements a 1D algorithm to bracket the minimum of a 1D merit function...
virtual bool doLineSearch(const MeritFunc1DBase< Scalar > &phi, const PointEval1D< Scalar > &point_k, const Ptr< PointEval1D< Scalar > > &point_kp1, const Ptr< int > &numIters) const
const Brents1DMinimization< Scalar > & brentsMin() const
For unit testing only .
const RCP< BrentsLineSearch< Scalar > > brentsLineSearch()
Nonmember constructor.
Represents the evaluation point of the merit function phi(alpha) and/or is derivative Dphi(alpha)...
TEUCHOS_DEPRECATED RCP< T > rcp(T *p, Dealloc_T dealloc, bool owns_mem)
Base class for 1D linearsearch algorithms.
Linesearch subclass implementing a function-value-only approximate minimization algorithm using brack...
const GoldenQuadInterpBracket< Scalar > & bracket() const
For unit testing only .
Base class for 1D merit fucntions used in globalization methods.
RCP< const ParameterList > getValidParameters() const
virtual bool requiresDerivEvals() const
Returns false.
BrentsLineSearch()
Construct with default parameters.