|
ConstrainedOptPack: C++ Tools for Constrained (and Unconstrained) Optimization
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 "ConstrainedOptPack_MeritFuncCalc1DQuadratic.hpp" 00043 #include "ConstrainedOptPack_MeritFuncCalc.hpp" 00044 #include "AbstractLinAlgPack_VectorMutable.hpp" 00045 #include "AbstractLinAlgPack_VectorStdOps.hpp" 00046 #include "Teuchos_Assert.hpp" 00047 00048 namespace ConstrainedOptPack { 00049 00050 MeritFuncCalc1DQuadratic::MeritFuncCalc1DQuadratic( 00051 const MeritFuncCalc& phi 00052 ,size_type p 00053 ,const_VectorWithOp_ptr d[] 00054 ,VectorMutable* x 00055 ) 00056 : phi_(phi), p_(p), x_(x) 00057 { 00058 TEUCHOS_TEST_FOR_EXCEPTION( 00059 !(1 <= p && p <= 2 ), std::invalid_argument 00060 ,"MeritFuncCalc1DQuadratic::MeritFuncCalc1DQuadratic(...) : Error! " 00061 "p = " << p << " must be in the range 1 <= p <= 2" 00062 ); 00063 for( size_type i = 0; i <= p; ++i ) 00064 d_[i] = d[i]; 00065 } 00066 00067 value_type MeritFuncCalc1DQuadratic::operator()(value_type alpha) const 00068 { 00069 using AbstractLinAlgPack::Vp_StV; 00070 *x_ = *d_[0]; 00071 value_type alpha_i = alpha; 00072 for( size_type i = 1; i <= p_; ++i, alpha_i *= alpha ) { 00073 Vp_StV( x_, alpha_i, *d_[i] ); 00074 } 00075 return phi_( *x_ ); 00076 } 00077 00078 value_type MeritFuncCalc1DQuadratic::deriv() const 00079 { 00080 return phi_.deriv(); 00081 } 00082 00083 void MeritFuncCalc1DQuadratic::print_merit_func( 00084 std::ostream& out, const std::string& L 00085 ) const 00086 { 00087 out << L << "*** MeritFuncCalc1DQuadratic\n" 00088 << L << "x = xo + alpha*d[1] + alpha^2*d[2]\n"; 00089 phi_.print_merit_func( out, L ); 00090 } 00091 00092 } // end namespace ConstrainedOptPack
1.7.6.1