MOOCHO (Single Doxygen Collection)  Version of the Day
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages
MoochoPack_LineSearchFailureNewDecompositionSelection_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_FAILURE_NEW_DECOMPOSITION_SELECTION_H
43 #define LINE_SEARCH_FAILURE_NEW_DECOMPOSITION_SELECTION_H
44 
48 
49 namespace MoochoPack {
50 
59  : public IterationPack::AlgorithmStep // doxygen needs full path
60 {
61 public:
62 
65 
68 
71  const line_search_step_ptr_t &line_search_step
72  ,const new_decomp_strategy_ptr_t &new_decomp_strategy
73  );
74 
78  bool do_step(Algorithm& algo, poss_type step_poss, IterationPack::EDoStepType type
79  , poss_type assoc_step_poss);
81  void print_step( const Algorithm& algo, poss_type step_poss, IterationPack::EDoStepType type
82  , poss_type assoc_step_poss, std::ostream& out, const std::string& leading_str ) const;
84 
85 private:
86 
88 
89  // not defined and not to be called
95 
96 }; // end class LineSearchFailureNewDecompositionSelection_Step
97 
98 } // end namespace MoochoPack
99 
100 #endif // LINE_SEARCH_FAILURE_NEW_DECOMPOSITION_SELECTION_H
Base type for all objects that perform steps in an Algorithm.
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
LineSearchFailureNewDecompositionSelection_Step & operator=(const LineSearchFailureNewDecompositionSelection_Step &)
Directs the selection of a new decomposition if the line search fails.
STANDARD_COMPOSITION_MEMBERS(IterationPack::AlgorithmStep, line_search_step)
<<std comp>="">> members for LineSearch object.
std::ostream * out
bool do_step(Algorithm &algo, poss_type step_poss, IterationPack::EDoStepType type, poss_type assoc_step_poss)
Abstract interface for an object that directs the selection of a new decomposition.
Acts as the central hub for an iterative algorithm.