MOOCHO (Single Doxygen Collection)  Version of the Day
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages
MoochoPack_NumFixedDepIndep_AddedStep.cpp
Go to the documentation of this file.
1 #if 0
2 
3 // @HEADER
4 // ***********************************************************************
5 //
6 // Moocho: Multi-functional Object-Oriented arCHitecture for Optimization
7 // Copyright (2003) Sandia Corporation
8 //
9 // Under terms of Contract DE-AC04-94AL85000, there is a non-exclusive
10 // license for use of this work by or on behalf of the U.S. Government.
11 //
12 // Redistribution and use in source and binary forms, with or without
13 // modification, are permitted provided that the following conditions are
14 // met:
15 //
16 // 1. Redistributions of source code must retain the above copyright
17 // notice, this list of conditions and the following disclaimer.
18 //
19 // 2. Redistributions in binary form must reproduce the above copyright
20 // notice, this list of conditions and the following disclaimer in the
21 // documentation and/or other materials provided with the distribution.
22 //
23 // 3. Neither the name of the Corporation nor the names of the
24 // contributors may be used to endorse or promote products derived from
25 // this software without specific prior written permission.
26 //
27 // THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY
28 // EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
29 // IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
30 // PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE
31 // CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
32 // EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
33 // PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
34 // PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
35 // LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
36 // NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
37 // SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
38 //
39 // Questions? Contact Roscoe A. Bartlett (rabartl@sandia.gov)
40 //
41 // ***********************************************************************
42 // @HEADER
43 
44 #include <ostream>
45 
49 #include "AbstractLinAlgPack/src/AbstractLinAlgPack_SpVectorClass.hpp"
50 
52  , poss_type step_poss, IterationPack::EDoStepType type, poss_type assoc_step_poss)
53 {
54  NLPAlgo &algo = rsqp_algo(_algo);
55  NLPAlgoState &s = algo.rsqp_state();
56 
57  EJournalOutputLevel olevel = algo.algo_cntr().journal_output_level();
58  std::ostream& out = algo.track().journal_out();
59 
60  // print step header.
61  if( static_cast<int>(olevel) >= static_cast<int>(PRINT_ALGORITHM_STEPS) ) {
63  print_algorithm_step( algo, step_poss, type, assoc_step_poss, out );
64  }
65 
66  if( s.nu().updated_k(0) && s.nu().get_k(0).nz() ) {
67  const Range1D
68  dep = s.var_dep(),
69  indep = s.var_indep();
70  const SpVector &nu_k = s.nu().get_k(0);
71  size_type fixed_dep = 0, fixed_indep = 0;
72  for( SpVector::const_iterator itr = nu_k.begin(); itr != nu_k.end(); ++itr ) {
73  if( dep.in_range( itr->indice() + nu_k.offset() ) )
74  fixed_dep++;
75  else if( indep.in_range( itr->indice() + nu_k.offset() ) )
76  fixed_indep++;
77  else
78  TEUCHOS_TEST_FOR_EXCEPT(true); // should never happen
79  }
80  if( static_cast<int>(olevel) >= static_cast<int>(PRINT_ALGORITHM_STEPS) ) {
81  out << "\nnum_dep_fixed = " << fixed_dep
82  << "\nnum_indep_fixed = " << fixed_indep << std::endl;
83  }
84  }
85  else {
86  if( static_cast<int>(olevel) >= static_cast<int>(PRINT_ALGORITHM_STEPS) ) {
87  out << "\nnu not calculated for the kth iteration\n";
88  }
89  }
90 
91  return true;
92 }
93 
95  , poss_type step_poss, IterationPack::EDoStepType type, poss_type assoc_step_poss
96  , std::ostream& out, const std::string& L ) const
97 {
98  out
99  << L << "*** Counts the number of fixed variables from "
100  "the dependent and independent sets\n";
101 }
102 
103 #endif // 0
AbstractLinAlgPack::size_type size_type
SparseVector< SparseElement< index_type, value_type >, std::allocator< SparseElement< index_type, value_type > > > SpVector
EJournalOutputLevel
enum for journal output.
bool do_step(Algorithm &algo, poss_type step_poss, IterationPack::EDoStepType type, poss_type assoc_step_poss)
std::ostream * out
void print_algorithm_step(const Algorithm &algo, Algorithm::poss_type step_poss, EDoStepType type, Algorithm::poss_type assoc_step_poss, std::ostream &out)
Prints to 'out' the algorithm step.
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
NLPAlgo & rsqp_algo(Algorithm &algo)
Convert from a Algorithm to a NLPAlgo.
#define TEUCHOS_TEST_FOR_EXCEPT(throw_exception_test)