ConstrainedOptPack: C++ Tools for Constrained (and Unconstrained) Optimization  Version of the Day
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Groups Pages
ConstrainedOptPack_ComputeMinMult.cpp
1 // @HEADER
2 // ***********************************************************************
3 //
4 // Moocho: Multi-functional Object-Oriented arCHitecture for Optimization
5 // Copyright (2003) Sandia Corporation
6 //
7 // Under terms of Contract DE-AC04-94AL85000, there is a non-exclusive
8 // license for use of this work by or on behalf of the U.S. Government.
9 //
10 // Redistribution and use in source and binary forms, with or without
11 // modification, are permitted provided that the following conditions are
12 // met:
13 //
14 // 1. Redistributions of source code must retain the above copyright
15 // notice, this list of conditions and the following disclaimer.
16 //
17 // 2. Redistributions in binary form must reproduce the above copyright
18 // notice, this list of conditions and the following disclaimer in the
19 // documentation and/or other materials provided with the distribution.
20 //
21 // 3. Neither the name of the Corporation nor the names of the
22 // contributors may be used to endorse or promote products derived from
23 // this software without specific prior written permission.
24 //
25 // THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY
26 // EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
27 // IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
28 // PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE
29 // CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
30 // EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
31 // PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
32 // PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
33 // LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
34 // NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
35 // SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
36 //
37 // Questions? Contact Roscoe A. Bartlett (rabartl@sandia.gov)
38 //
39 // ***********************************************************************
40 // @HEADER
41 
42 #include <limits>
43 
44 #include "ConstrainedOptPack_ComputeMinMult.hpp"
45 #include "AbstractLinAlgPack_SpVectorClass.hpp"
46 #include "DenseLinAlgPack_DVectorClass.hpp"
47 
48 namespace {
49 template< class T >
50 inline
51 T my_min( const T& v1, const T& v2 ) { return v1 < v2 ? v1 : v2; }
52 } // end namespace
53 
54 ConstrainedOptPack::value_type
55 ConstrainedOptPack ::min_abs( const DVectorSlice& mu )
56 {
57  if( !mu.dim() )
58  return 0.0;
59  value_type min = std::fabs(mu(1));
60  for( DVectorSlice::const_iterator itr = mu.begin() + 1; itr != mu.end(); )
61  min = my_min( min, std::fabs(*itr++) );
62  return min;
63 }
64 
65 ConstrainedOptPack::value_type
66 ConstrainedOptPack ::min_abs( const SpVectorSlice& mu )
67 {
68  if( !mu.dim() )
69  return 0.0;
70  if( !mu.nz() )
71  return 0.0;
72  value_type min = std::fabs(mu.begin()->value());
73  for( SpVectorSlice::const_iterator itr = mu.begin() + 1; itr != mu.end(); ++itr )
74  min = my_min( min, std::fabs(itr->value()) );
75  return min;
76 }