MoochoPack : Framework for Large-Scale Optimization Algorithms Version of the Day
MoochoPack_NumFixedDepIndep_AddedStep.cpp
00001 #if 0
00002 
00003 // @HEADER
00004 // ***********************************************************************
00005 // 
00006 // Moocho: Multi-functional Object-Oriented arCHitecture for Optimization
00007 //                  Copyright (2003) Sandia Corporation
00008 // 
00009 // Under terms of Contract DE-AC04-94AL85000, there is a non-exclusive
00010 // license for use of this work by or on behalf of the U.S. Government.
00011 // 
00012 // Redistribution and use in source and binary forms, with or without
00013 // modification, are permitted provided that the following conditions are
00014 // met:
00015 //
00016 // 1. Redistributions of source code must retain the above copyright
00017 // notice, this list of conditions and the following disclaimer.
00018 //
00019 // 2. Redistributions in binary form must reproduce the above copyright
00020 // notice, this list of conditions and the following disclaimer in the
00021 // documentation and/or other materials provided with the distribution.
00022 //
00023 // 3. Neither the name of the Corporation nor the names of the
00024 // contributors may be used to endorse or promote products derived from
00025 // this software without specific prior written permission.
00026 //
00027 // THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY
00028 // EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
00029 // IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
00030 // PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE
00031 // CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
00032 // EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
00033 // PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
00034 // PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
00035 // LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
00036 // NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
00037 // SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
00038 //
00039 // Questions? Contact Roscoe A. Bartlett (rabartl@sandia.gov) 
00040 // 
00041 // ***********************************************************************
00042 // @HEADER
00043 
00044 #include <ostream>
00045 
00046 #include "MoochoPack_NumFixedDepIndep_AddedStep.hpp"
00047 #include "MoochoPack_moocho_algo_conversion.hpp"
00048 #include "IterationPack_print_algorithm_step.hpp"
00049 #include "AbstractLinAlgPack/src/AbstractLinAlgPack_SpVectorClass.hpp"
00050 
00051 bool MoochoPack::NumFixedDepIndep_AddedStep::do_step(Algorithm& _algo
00052   , poss_type step_poss, IterationPack::EDoStepType type, poss_type assoc_step_poss)
00053 {
00054   NLPAlgo &algo = rsqp_algo(_algo);
00055   NLPAlgoState  &s    = algo.rsqp_state();
00056 
00057   EJournalOutputLevel olevel = algo.algo_cntr().journal_output_level();
00058   std::ostream& out = algo.track().journal_out();
00059 
00060   // print step header.
00061   if( static_cast<int>(olevel) >= static_cast<int>(PRINT_ALGORITHM_STEPS) ) {
00062     using IterationPack::print_algorithm_step;
00063     print_algorithm_step( algo, step_poss, type, assoc_step_poss, out );
00064   }
00065 
00066   if( s.nu().updated_k(0) && s.nu().get_k(0).nz() ) {
00067     const Range1D
00068       dep   = s.var_dep(),
00069       indep = s.var_indep();
00070     const SpVector &nu_k  = s.nu().get_k(0);
00071     size_type fixed_dep = 0, fixed_indep = 0;
00072     for( SpVector::const_iterator itr = nu_k.begin(); itr != nu_k.end(); ++itr ) {
00073       if( dep.in_range( itr->indice() + nu_k.offset() ) )
00074         fixed_dep++;
00075       else if( indep.in_range( itr->indice() + nu_k.offset() ) )
00076         fixed_indep++;
00077       else
00078         TEUCHOS_TEST_FOR_EXCEPT(true);  // should never happen
00079     }
00080     if( static_cast<int>(olevel) >= static_cast<int>(PRINT_ALGORITHM_STEPS) ) {
00081       out << "\nnum_dep_fixed = "   << fixed_dep
00082         << "\nnum_indep_fixed = " << fixed_indep << std::endl;
00083     }
00084   }
00085   else {
00086     if( static_cast<int>(olevel) >= static_cast<int>(PRINT_ALGORITHM_STEPS) ) {
00087       out << "\nnu not calculated for the kth iteration\n";
00088     }
00089   }
00090 
00091   return true;
00092 }
00093 
00094 void MoochoPack::NumFixedDepIndep_AddedStep::print_step( const Algorithm& algo
00095   , poss_type step_poss, IterationPack::EDoStepType type, poss_type assoc_step_poss
00096   , std::ostream& out, const std::string& L ) const
00097 {
00098   out
00099     << L << "*** Counts the number of fixed variables from "
00100         "the dependent and independent sets\n";
00101 }
00102 
00103 #endif // 0
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends