|
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 <ostream> 00043 00044 #include "MoochoPack_QuasiNormalStepStd_Step.hpp" 00045 #include "MoochoPack_moocho_algo_conversion.hpp" 00046 #include "IterationPack_print_algorithm_step.hpp" 00047 #include "AbstractLinAlgPack_VectorMutable.hpp" 00048 #include "AbstractLinAlgPack_VectorOut.hpp" 00049 #include "AbstractLinAlgPack_MatrixOpNonsing.hpp" 00050 #include "AbstractLinAlgPack_LinAlgOpPack.hpp" 00051 00052 namespace MoochoPack { 00053 00054 bool QuasiNormalStepStd_Step::do_step( 00055 Algorithm& _algo, poss_type step_poss, IterationPack::EDoStepType type 00056 ,poss_type assoc_step_poss 00057 ) 00058 { 00059 using BLAS_Cpp::no_trans; 00060 using AbstractLinAlgPack::Vt_S; 00061 using AbstractLinAlgPack::V_InvMtV; 00062 using LinAlgOpPack::V_StV; 00063 using LinAlgOpPack::V_MtV; 00064 00065 NLPAlgo &algo = rsqp_algo(_algo); 00066 NLPAlgoState &s = algo.rsqp_state(); 00067 const Range1D equ_decomp = s.equ_decomp(); 00068 00069 EJournalOutputLevel olevel = algo.algo_cntr().journal_output_level(); 00070 std::ostream& out = algo.track().journal_out(); 00071 00072 // print step header. 00073 if( static_cast<int>(olevel) >= static_cast<int>(PRINT_ALGORITHM_STEPS) ) { 00074 using IterationPack::print_algorithm_step; 00075 print_algorithm_step( algo, step_poss, type, assoc_step_poss, out ); 00076 } 00077 00078 // Get iteration quantities 00079 IterQuantityAccess<VectorMutable> 00080 &c_iq = s.c(), 00081 &py_iq = s.py(), 00082 &Ypy_iq = s.Ypy(); 00083 IterQuantityAccess<MatrixOpNonsing> 00084 &R_iq = s.R(); 00085 IterQuantityAccess<MatrixOp> 00086 &Y_iq = s.Y(); 00087 00088 // Solve the system py = - inv(R) * c(equ_decomp) 00089 VectorMutable &py_k = py_iq.set_k(0); 00090 V_InvMtV( &py_k, R_iq.get_k(0), no_trans, *c_iq.get_k(0).sub_view(equ_decomp) ); 00091 Vt_S( &py_k, -1.0 ); 00092 00093 // Ypy = Y * py 00094 V_MtV( &Ypy_iq.set_k(0), Y_iq.get_k(0), no_trans, py_k ); 00095 00096 if( static_cast<int>(olevel) >= static_cast<int>(PRINT_ALGORITHM_STEPS) ) { 00097 out << "\n||py|| = " << py_iq.get_k(0).norm_inf() << std::endl 00098 << "\n||Ypy||2 = " << Ypy_iq.get_k(0).norm_2() << std::endl; 00099 } 00100 00101 if( static_cast<int>(olevel) >= static_cast<int>(PRINT_VECTORS) ) { 00102 out << "\npy_k =\n" << py_iq.get_k(0); 00103 out << "\nYpy_k =\n" << Ypy_iq.get_k(0); 00104 } 00105 00106 return true; 00107 } 00108 00109 void QuasiNormalStepStd_Step::print_step( 00110 const Algorithm& algo, poss_type step_poss, IterationPack::EDoStepType type 00111 ,poss_type assoc_step_poss, std::ostream& out, const std::string& L 00112 ) const 00113 { 00114 out 00115 << L << "*** Calculate the range space step\n" 00116 << L << "py_k = - inv(R_k) * c_k(equ_decomp)\n" 00117 << L << "Ypy_k = Y_k * py_k\n"; 00118 } 00119 00120 } // end namespace MoochoPack
1.7.6.1