MoochoPack : Framework for Large-Scale Optimization Algorithms Version of the Day
MoochoPack_SetDBoundsStd_AddedStep.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 // Redistribution and use in source and binary forms, with or without
00011 // modification, are permitted provided that the following conditions are
00012 // met:
00013 //
00014 // 1. Redistributions of source code must retain the above copyright
00015 // notice, this list of conditions and the following disclaimer.
00016 //
00017 // 2. Redistributions in binary form must reproduce the above copyright
00018 // notice, this list of conditions and the following disclaimer in the
00019 // documentation and/or other materials provided with the distribution.
00020 //
00021 // 3. Neither the name of the Corporation nor the names of the
00022 // contributors may be used to endorse or promote products derived from
00023 // this software without specific prior written permission.
00024 //
00025 // THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY
00026 // EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
00027 // IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
00028 // PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE
00029 // CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
00030 // EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
00031 // PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
00032 // PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
00033 // LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
00034 // NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
00035 // SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
00036 //
00037 // Questions? Contact Roscoe A. Bartlett (rabartl@sandia.gov) 
00038 // 
00039 // ***********************************************************************
00040 // @HEADER
00041 
00042 #include <ostream>
00043 
00044 #include "MoochoPack_SetDBoundsStd_AddedStep.hpp"
00045 #include "MoochoPack_moocho_algo_conversion.hpp"
00046 #include "IterationPack_print_algorithm_step.hpp"
00047 #include "AbstractLinAlgPack_LinAlgOpPack.hpp"
00048 #include "AbstractLinAlgPack_VectorOut.hpp"
00049 
00050 namespace MoochoPack {
00051 
00052 SetDBoundsStd_AddedStep::SetDBoundsStd_AddedStep()
00053   :dl_iq_(dl_name)
00054   ,du_iq_(du_name)
00055   {}
00056 
00057 bool SetDBoundsStd_AddedStep::do_step(
00058   Algorithm& _algo, poss_type step_poss, IterationPack::EDoStepType type
00059   ,poss_type assoc_step_poss
00060   )
00061 {
00062   NLPAlgo &algo = rsqp_algo(_algo);
00063   NLPAlgoState &s = algo.rsqp_state();
00064 
00065   EJournalOutputLevel olevel = algo.algo_cntr().journal_output_level();
00066   EJournalOutputLevel ns_olevel = algo.algo_cntr().null_space_journal_output_level();
00067   std::ostream &out = algo.track().journal_out();
00068 
00069   // print step header.
00070   if( static_cast<int>(olevel) >= static_cast<int>(PRINT_ALGORITHM_STEPS) ) {
00071     using IterationPack::print_algorithm_step;
00072     print_algorithm_step( algo, step_poss, type, assoc_step_poss, out );
00073   }
00074 
00075   const Range1D
00076     var_dep = s.var_dep(),
00077     var_indep = s.var_indep();
00078 
00079   const Vector
00080     &x_k = s.x().get_k(0),
00081     &xl  = algo.nlp().xl(),
00082     &xu  = algo.nlp().xu();
00083   VectorMutable
00084     &dl  = dl_iq_(s).set_k(0),
00085     &du  = du_iq_(s).set_k(0);
00086   
00087   // dl = xl - x_k
00088   LinAlgOpPack::V_VmV( &dl, xl, x_k );  
00089 
00090   // du = xu - x_k
00091   LinAlgOpPack::V_VmV( &du, xu, x_k );  
00092 
00093   if( static_cast<int>(ns_olevel) >= static_cast<int>(PRINT_VECTORS) ) {
00094     if(var_indep.size()) {
00095       out << "\ndl(var_indep)_k = \n" << *dl.sub_view(var_indep);
00096       out << "\ndu(var_indep)_k = \n" << *du.sub_view(var_indep);
00097     }
00098   }
00099 
00100   if( static_cast<int>(olevel) >= static_cast<int>(PRINT_VECTORS) ) {
00101     if(var_dep.size()) {
00102       out << "\ndl(var_dep)_k = \n" << *dl.sub_view(var_dep);
00103       out << "\ndu(var_dep)_k = \n" << *du.sub_view(var_dep);
00104     }
00105     out << "\ndl_k = \n" << dl;
00106     out << "\ndu_k = \n" << du;
00107   }
00108 
00109   return true;
00110 }
00111 
00112 void SetDBoundsStd_AddedStep::print_step(
00113   const Algorithm& algo, poss_type step_poss, IterationPack::EDoStepType type
00114   ,poss_type assoc_step_poss, std::ostream& out, const std::string& L
00115   ) const
00116 {
00117   out
00118     << L << "*** Set the bounds on d\n"
00119     << L << "d_bounds_k.l = xl - x_k\n"
00120     << L << "d_bounds_k.u = xu - x_k\n"
00121     ;
00122 }
00123 
00124 } // end namespace MoochoPack
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends