MoochoPack_CalcDFromYPYZPZ_Step.cpp

00001 // @HEADER
00002 // ***********************************************************************
00003 // 
00004 // Moocho: Multi-functional Object-Oriented arCHitecture for Optimization
00005 //                  Copyright (2003) Sandia Corporation
00006 // 
00007 // Under terms of Contract DE-AC04-94AL85000, there is a non-exclusive
00008 // license for use of this work by or on behalf of the U.S. Government.
00009 // 
00010 // This library is free software; you can redistribute it and/or modify
00011 // it under the terms of the GNU Lesser General Public License as
00012 // published by the Free Software Foundation; either version 2.1 of the
00013 // License, or (at your option) any later version.
00014 //  
00015 // This library is distributed in the hope that it will be useful, but
00016 // WITHOUT ANY WARRANTY; without even the implied warranty of
00017 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
00018 // Lesser General Public License for more details.
00019 //  
00020 // You should have received a copy of the GNU Lesser General Public
00021 // License along with this library; if not, write to the Free Software
00022 // Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307
00023 // USA
00024 // Questions? Contact Roscoe A. Bartlett (rabartl@sandia.gov) 
00025 // 
00026 // ***********************************************************************
00027 // @HEADER
00028 
00029 #include <limits>
00030 #include <ostream>
00031 
00032 #include "MoochoPack_CalcDFromYPYZPZ_Step.hpp"
00033 #include "MoochoPack_moocho_algo_conversion.hpp"
00034 #include "IterationPack_print_algorithm_step.hpp"
00035 //#include "ConstrainedOptPack_print_vector_change_stats.hpp"
00036 #include "AbstractLinAlgPack_MatrixOpOut.hpp"
00037 #include "AbstractLinAlgPack_VectorMutable.hpp"
00038 #include "AbstractLinAlgPack_VectorStdOps.hpp"
00039 #include "AbstractLinAlgPack_VectorOut.hpp"
00040 #include "AbstractLinAlgPack_LinAlgOpPack.hpp"
00041 #include "Teuchos_implicit_cast.hpp"
00042 
00043 namespace LinAlgOpPack {
00044   using AbstractLinAlgPack::Vp_StMtV;
00045 }
00046 
00047 bool MoochoPack::CalcDFromYPYZPZ_Step::do_step(Algorithm& _algo
00048   , poss_type step_poss, IterationPack::EDoStepType type, poss_type assoc_step_poss)
00049 {
00050 
00051   using Teuchos::implicit_cast;
00052   using AbstractLinAlgPack::dot;
00053   using LinAlgOpPack::V_VpV;
00054 
00055   NLPAlgo &algo = rsqp_algo(_algo);
00056   NLPAlgoState &s = algo.rsqp_state();
00057 
00058   EJournalOutputLevel olevel = algo.algo_cntr().journal_output_level();
00059   EJournalOutputLevel ns_olevel = algo.algo_cntr().null_space_journal_output_level();
00060   std::ostream& out = algo.track().journal_out();
00061 
00062   // print step header.
00063   if( implicit_cast<int>(olevel) >= implicit_cast<int>(PRINT_ALGORITHM_STEPS) ) {
00064     using IterationPack::print_algorithm_step;
00065     print_algorithm_step( algo, step_poss, type, assoc_step_poss, out );
00066   }
00067 
00068   // d = Ypy + Zpz
00069   VectorMutable &d_k = s.d().set_k(0);
00070   const Vector &Ypy_k = s.Ypy().get_k(0);
00071   const Vector &Zpz_k = s.Zpz().get_k(0);
00072   V_VpV( &d_k, Ypy_k, Zpz_k );
00073 
00074   Range1D
00075     var_dep = s.var_dep(),
00076     var_indep = s.var_indep();
00077   
00078   if( implicit_cast<int>(olevel) >= implicit_cast<int>(PRINT_ALGORITHM_STEPS) ) {
00079     const value_type very_small = std::numeric_limits<value_type>::min();
00080     out
00081       << "\n(Ypy_k'*Zpz_k)/(||Ypy_k||2 * ||Zpz_k||2 + eps)\n"
00082       << "  = ("<<dot(Ypy_k,Zpz_k)<<")/("<<Ypy_k.norm_2()<<" * "<<Zpz_k.norm_2()<<" + "<<very_small<<")\n"
00083       << "  = " << dot(Ypy_k,Zpz_k) / ( Ypy_k.norm_2() * Zpz_k.norm_2() + very_small ) << "\n";
00084 /*
00085   ConstrainedOptPack::print_vector_change_stats(
00086   s.x().get_k(0), "x", s.d().get_k(0), "d", out );
00087 */
00088     // ToDo: Replace the above with a reduction operator!
00089   }
00090 
00091   if( implicit_cast<int>(olevel) >= implicit_cast<int>(PRINT_ALGORITHM_STEPS) ) {
00092     out << "\n||d_k||inf            = " << d_k.norm_inf();
00093     if( var_dep.size() )
00094       out << "\n||d(var_dep)_k||inf   = " << d_k.sub_view(var_dep)->norm_inf();
00095     if( var_indep.size() )
00096       out << "\n||d(var_indep)_k||inf = " << d_k.sub_view(var_indep)->norm_inf();
00097     out << std::endl;
00098   }
00099   if( implicit_cast<int>(olevel) >= implicit_cast<int>(PRINT_VECTORS) ) {
00100     out << "\nd_k = \n" << d_k;
00101     if( var_dep.size() )
00102       out << "\nd(var_dep)_k = \n" << *d_k.sub_view(var_dep);
00103   }
00104   if( implicit_cast<int>(ns_olevel) >= implicit_cast<int>(PRINT_VECTORS) ) {
00105     if( var_indep.size() )
00106       out << "\nd(var_indep)_k = \n" << *d_k.sub_view(var_indep);
00107   }
00108   
00109   return true;
00110 
00111 }
00112 
00113 void MoochoPack::CalcDFromYPYZPZ_Step::print_step( const Algorithm& algo
00114   , poss_type step_poss, IterationPack::EDoStepType type, poss_type assoc_step_poss
00115   , std::ostream& out, const std::string& L ) const
00116 {
00117   out
00118     << L << "*** Calculates the search direction d from Ypy and Zpz\n"
00119     << L << "d_k = Ypy_k + Zpz_k \n";
00120 }

Generated on Wed May 12 21:32:12 2010 for MoochoPack : Framework for Large-Scale Optimization Algorithms by  doxygen 1.4.7