MoochoPack : Framework for Large-Scale Optimization Algorithms Version of the Day
MoochoPack_LineSearchFailureNewDecompositionSelection_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 // 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 #include <typeinfo>
00044 
00045 #include "MoochoPack_LineSearchFailureNewDecompositionSelection_Step.hpp"
00046 #include "MoochoPack_MoochoAlgorithmStepNames.hpp"
00047 #include "MoochoPack_moocho_algo_conversion.hpp"
00048 #include "MoochoPack_Exceptions.hpp"
00049 #include "IterationPack_print_algorithm_step.hpp"
00050 
00051 namespace MoochoPack {
00052 
00053 LineSearchFailureNewDecompositionSelection_Step::LineSearchFailureNewDecompositionSelection_Step(
00054   const line_search_step_ptr_t        &line_search_step
00055   ,const new_decomp_strategy_ptr_t    &new_decomp_strategy
00056   )
00057   :line_search_step_(line_search_step)
00058   ,new_decomp_strategy_(new_decomp_strategy)
00059   ,last_ls_failure_k_(-100) // has not failed yet
00060 {}
00061 
00062 bool LineSearchFailureNewDecompositionSelection_Step::do_step(
00063   Algorithm& _algo, poss_type step_poss, IterationPack::EDoStepType type, poss_type assoc_step_poss
00064   )
00065 {
00066   try {
00067     return line_search_step().do_step(_algo,step_poss,type,assoc_step_poss);
00068   }
00069   catch(const LineSearchFailure& lsf_excpt) {
00070     NLPAlgo        &algo = rsqp_algo(_algo);
00071     NLPAlgoState   &s    = algo.rsqp_state();
00072 
00073     EJournalOutputLevel olevel = algo.algo_cntr().journal_output_level();
00074     std::ostream& out = algo.track().journal_out();
00075 
00076     if( static_cast<int>(olevel) >= static_cast<int>(PRINT_BASIC_ALGORITHM_INFO) ) {
00077       out << "\nLine search failed "
00078         << " (k = " << algo.state().k() << ")\n"
00079         << "LineSearchFailure description: " << lsf_excpt.what() << "\n";
00080     }
00081 
00082     if( last_ls_failure_k_ == s.k() - 1 ) {
00083       if( static_cast<int>(olevel) >= static_cast<int>(PRINT_BASIC_ALGORITHM_INFO) ) {
00084         out << "\nThe line search failed again even with a new decomposition!"
00085           << " (k = " << algo.state().k() << ")\n"
00086           << "We quit!\n";
00087       }
00088       throw;
00089     }
00090 
00091     if( static_cast<int>(olevel) >= static_cast<int>(PRINT_BASIC_ALGORITHM_INFO) ) {
00092       out << "\nSelecting a new decomposition..."
00093         << " (k = " << algo.state().k() << ")\n";
00094     }
00095 
00096     last_ls_failure_k_ = s.k();
00097     return new_decomp_strategy().new_decomposition(algo,step_poss,type,assoc_step_poss);
00098   }
00099   return false; // will never be executed.
00100 }
00101 
00102 void LineSearchFailureNewDecompositionSelection_Step::print_step(
00103   const Algorithm& algo
00104   ,poss_type step_poss, IterationPack::EDoStepType type, poss_type assoc_step_poss
00105   ,std::ostream& out, const std::string& L
00106   ) const
00107 {
00108   out
00109     << L << "do line search step : " << typeName(line_search_step()) << std::endl;
00110   line_search_step().print_step(algo,step_poss,type,assoc_step_poss,out,L+"    ");
00111   out
00112     << L << "end line search step\n"
00113     << L << "if thrown line_search_failure then\n"
00114     << L << "  if line search failed at the last iteration also then\n"
00115     << L << "    throw line_search_failure\n"
00116     << L << "  end\n"
00117     << L << "  new decomposition selection : " << typeName(new_decomp_strategy()) << std::endl
00118     ;
00119   new_decomp_strategy().print_new_decomposition(
00120     rsqp_algo(algo),step_poss,type,assoc_step_poss,out, L + "    " );
00121   out
00122     << L << "  end new decomposition selection\n"
00123     << L << "end\n"
00124     ;
00125 }
00126 
00127 } // end namespace MoochoPack
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends