|
MoochoPack : Framework for Large-Scale Optimization Algorithms
Version of the Day
|
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 <limits> 00043 #include <ostream> 00044 00045 #include "MoochoPack_MeritFunc_DummyUpdate_Step.hpp" 00046 #include "MoochoPack_moocho_algo_conversion.hpp" 00047 #include "ConstrainedOptPack_MeritFuncNLP.hpp" 00048 #include "ConstrainedOptPack_MeritFuncNLPDirecDeriv.hpp" 00049 #include "IterationPack_print_algorithm_step.hpp" 00050 #include "AbstractLinAlgPack_VectorMutable.hpp" 00051 #include "AbstractLinAlgPack_VectorOut.hpp" 00052 #include "Teuchos_dyn_cast.hpp" 00053 00054 namespace MoochoPack { 00055 00056 bool MeritFunc_DummyUpdate_Step::do_step( 00057 Algorithm& _algo, poss_type step_poss, IterationPack::EDoStepType type, poss_type assoc_step_poss 00058 ) 00059 { 00060 using Teuchos::dyn_cast; 00061 00062 NLPAlgo &algo = rsqp_algo(_algo); 00063 NLPAlgoState &s = algo.rsqp_state(); 00064 00065 EJournalOutputLevel olevel = algo.algo_cntr().journal_output_level(); 00066 std::ostream& out = algo.track().journal_out(); 00067 00068 // print step header. 00069 if( static_cast<int>(olevel) >= static_cast<int>(PRINT_ALGORITHM_STEPS) ) { 00070 using IterationPack::print_algorithm_step; 00071 print_algorithm_step( algo, step_poss, type, assoc_step_poss, out ); 00072 } 00073 00074 IterQuantityAccess<MeritFuncNLP> 00075 &merit_func_nlp_iq = s.merit_func_nlp(); 00076 00077 if(!merit_func_nlp_iq.updated_k(0)) { 00078 const int last_updated_k = merit_func_nlp_iq.last_updated(); 00079 MeritFuncNLP 00080 &merit_func_nlp_k = ( last_updated_k != IterQuantity::NONE_UPDATED 00081 ? merit_func_nlp_iq.set_k(0,last_updated_k) 00082 : merit_func_nlp_iq.set_k(0) ); 00083 MeritFuncNLPDirecDeriv 00084 &direc_deriv = dyn_cast<MeritFuncNLPDirecDeriv>(merit_func_nlp_k); 00085 00086 direc_deriv.calc_deriv( 00087 s.Gf().get_k(0) 00088 ,NULL 00089 ,NULL 00090 ,NULL 00091 ,NULL 00092 ,s.d().get_k(0) 00093 ); 00094 00095 } 00096 00097 return true; 00098 } 00099 00100 void MeritFunc_DummyUpdate_Step::print_step( 00101 const Algorithm& algo, poss_type step_poss, IterationPack::EDoStepType type 00102 ,poss_type assoc_step_poss, std::ostream& out, const std::string& L 00103 ) const 00104 { 00105 out 00106 << L << "*** Simply sets the current merit function value for unconstrained linesearch\n" 00107 << L << "if merit_func_nlp_k not updated set merit_func_nlp_k = merit_func_nlp_k(last_updated)\n"; 00108 } 00109 00110 } // end namespace MoochoPack
1.7.6.1