MOOCHO (Single Doxygen Collection)  Version of the Day
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages
MoochoPack_LineSearchFullStepAfterKIter_Step.hpp
Go to the documentation of this file.
1 // @HEADER
2 // ***********************************************************************
3 //
4 // Moocho: Multi-functional Object-Oriented arCHitecture for Optimization
5 // Copyright (2003) 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 Roscoe A. Bartlett (rabartl@sandia.gov)
38 //
39 // ***********************************************************************
40 // @HEADER
41 
42 #ifndef LINE_SEARCH_FULL_STEP_AFTER_K_ITER_STEP_H
43 #define LINE_SEARCH_FULL_STEP_AFTER_K_ITER_STEP_H
44 
45 #include <limits>
46 
47 #include "rSQPAlgo_StepBaseClasses.h"
50 #include "MiStandardAggregationMacros.h"
51 
52 namespace MoochoPack {
53 
57 class LineSearchFullStepAfterKIter_Step : public LineSearch_Step {
58 public:
59 
61  STANDARD_COMPOSITION_MEMBERS(LineSearch_Step,line_search);
62 
65  const line_search_ptr_t& line_search = 0
66  , int full_steps_after_k
68  : line_search_(line_search)
70  {}
71 
77  { return full_steps_after_k_; }
78 
79  // ////////////////////
80  // Overridden
81 
83  bool do_step(Algorithm& algo, poss_type step_poss, IterationPack::EDoStepType type
84  , poss_type assoc_step_poss);
85 
87  void print_step( const Algorithm& algo, poss_type step_poss, IterationPack::EDoStepType type
88  , poss_type assoc_step_poss, std::ostream& out, const std::string& leading_str ) const;
89 
90 private:
92 
93 }; // end class LineSearchFullStepAfterKIter_Step
94 
95 } // end namespace MoochoPack
96 
97 #endif // LINE_SEARCH_FULL_STEP_AFTER_K_ITER_STEP_H
Changes from a line search step to just taking full steps after full_steps_after_k iterations...
LineSearchFullStepAfterKIter_Step(const line_search_ptr_t &line_search=0, int full_steps_after_k=std::numeric_limits< int >::max())
void print_step(const Algorithm &algo, poss_type step_poss, IterationPack::EDoStepType type, poss_type assoc_step_poss, std::ostream &out, const std::string &leading_str) const
std::ostream * out
bool do_step(Algorithm &algo, poss_type step_poss, IterationPack::EDoStepType type, poss_type assoc_step_poss)
STANDARD_COMPOSITION_MEMBERS(LineSearch_Step, line_search)
<<std comp>="">> members for the line search step
AbstractLinAlgPack::value_type value_type
Acts as the central hub for an iterative algorithm.