MOOCHO (Single Doxygen Collection) Version of the Day
ConstrainedOptPack_ComputeMinMult.cpp
Go to the documentation of this file.
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 
00044 #include "ConstrainedOptPack_ComputeMinMult.hpp"
00045 #include "AbstractLinAlgPack_SpVectorClass.hpp"
00046 #include "DenseLinAlgPack_DVectorClass.hpp"
00047 
00048 namespace {
00049 template< class T >
00050 inline
00051 T my_min( const T& v1, const T& v2 ) { return v1 < v2 ? v1 : v2; }
00052 } // end namespace
00053 
00054 ConstrainedOptPack::value_type
00055 ConstrainedOptPack ::min_abs( const DVectorSlice& mu )
00056 {
00057   if( !mu.dim() )
00058     return 0.0;
00059   value_type min = std::fabs(mu(1));
00060   for( DVectorSlice::const_iterator itr = mu.begin() + 1; itr != mu.end(); )
00061     min = my_min( min, std::fabs(*itr++) );
00062   return min;
00063 }
00064 
00065 ConstrainedOptPack::value_type
00066 ConstrainedOptPack ::min_abs( const SpVectorSlice& mu )
00067 {
00068   if( !mu.dim() )
00069     return 0.0;
00070   if( !mu.nz() )
00071     return 0.0;
00072   value_type min = std::fabs(mu.begin()->value());
00073   for( SpVectorSlice::const_iterator itr = mu.begin() + 1; itr != mu.end(); ++itr )
00074     min = my_min( min, std::fabs(itr->value()) );
00075   return min;
00076 }
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Defines