|
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 "MoochoPack_QuasiRangeSpaceStepStd_Strategy.hpp" 00043 #include "MoochoPack_NLPAlgoState.hpp" 00044 #include "AbstractLinAlgPack_MatrixOpNonsing.hpp" 00045 #include "AbstractLinAlgPack_VectorSpace.hpp" 00046 #include "AbstractLinAlgPack_LinAlgOpPack.hpp" 00047 00048 namespace MoochoPack { 00049 00050 bool QuasiRangeSpaceStepStd_Strategy::solve_quasi_range_space_step( 00051 std::ostream& out, EJournalOutputLevel olevel, NLPAlgo *algo, NLPAlgoState *s 00052 ,const Vector& xo, const Vector& c_xo, VectorMutable* v 00053 ) 00054 { 00055 using LinAlgOpPack::V_InvMtV; 00056 using LinAlgOpPack::V_StMtV; 00057 const MatrixOpNonsing 00058 &R_k = s->R().get_k(0); 00059 VectorSpace::vec_mut_ptr_t 00060 vy = R_k.space_rows().create_member(); 00061 // vy = inv(R_k) * c_xo 00062 V_InvMtV( vy.get(), R_k, BLAS_Cpp::no_trans, c_xo ); 00063 // v = -Y_k*vy 00064 V_StMtV( v, -1.0, s->Y().get_k(0), BLAS_Cpp::no_trans, *vy ); 00065 00066 return true; 00067 } 00068 00069 void QuasiRangeSpaceStepStd_Strategy::print_step( std::ostream& out, const std::string& L ) const 00070 { 00071 out << L << "*** Compute the approximate range space step:\n" 00072 << L << "vy = inv(R_k) * c_xo\n" 00073 << L << "v = -Y_k*vy\n"; 00074 } 00075 00076 } // end namespace MoochoPack
1.7.6.1