MoochoPack : Framework for Large-Scale Optimization Algorithms  Version of the Day
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Groups Pages
MoochoPack_SetDBoundsStd_AddedStep.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 <ostream>
43 
44 #include "MoochoPack_SetDBoundsStd_AddedStep.hpp"
45 #include "MoochoPack_moocho_algo_conversion.hpp"
46 #include "IterationPack_print_algorithm_step.hpp"
47 #include "AbstractLinAlgPack_LinAlgOpPack.hpp"
48 #include "AbstractLinAlgPack_VectorOut.hpp"
49 
50 namespace MoochoPack {
51 
53  :dl_iq_(dl_name)
54  ,du_iq_(du_name)
55  {}
56 
58  Algorithm& _algo, poss_type step_poss, IterationPack::EDoStepType type
59  ,poss_type assoc_step_poss
60  )
61 {
62  NLPAlgo &algo = rsqp_algo(_algo);
63  NLPAlgoState &s = algo.rsqp_state();
64 
65  EJournalOutputLevel olevel = algo.algo_cntr().journal_output_level();
66  EJournalOutputLevel ns_olevel = algo.algo_cntr().null_space_journal_output_level();
67  std::ostream &out = algo.track().journal_out();
68 
69  // print step header.
70  if( static_cast<int>(olevel) >= static_cast<int>(PRINT_ALGORITHM_STEPS) ) {
71  using IterationPack::print_algorithm_step;
72  print_algorithm_step( algo, step_poss, type, assoc_step_poss, out );
73  }
74 
75  const Range1D
76  var_dep = s.var_dep(),
77  var_indep = s.var_indep();
78 
79  const Vector
80  &x_k = s.x().get_k(0),
81  &xl = algo.nlp().xl(),
82  &xu = algo.nlp().xu();
83  VectorMutable
84  &dl = dl_iq_(s).set_k(0),
85  &du = du_iq_(s).set_k(0);
86 
87  // dl = xl - x_k
88  LinAlgOpPack::V_VmV( &dl, xl, x_k );
89 
90  // du = xu - x_k
91  LinAlgOpPack::V_VmV( &du, xu, x_k );
92 
93  if( static_cast<int>(ns_olevel) >= static_cast<int>(PRINT_VECTORS) ) {
94  if(var_indep.size()) {
95  out << "\ndl(var_indep)_k = \n" << *dl.sub_view(var_indep);
96  out << "\ndu(var_indep)_k = \n" << *du.sub_view(var_indep);
97  }
98  }
99 
100  if( static_cast<int>(olevel) >= static_cast<int>(PRINT_VECTORS) ) {
101  if(var_dep.size()) {
102  out << "\ndl(var_dep)_k = \n" << *dl.sub_view(var_dep);
103  out << "\ndu(var_dep)_k = \n" << *du.sub_view(var_dep);
104  }
105  out << "\ndl_k = \n" << dl;
106  out << "\ndu_k = \n" << du;
107  }
108 
109  return true;
110 }
111 
113  const Algorithm& algo, poss_type step_poss, IterationPack::EDoStepType type
114  ,poss_type assoc_step_poss, std::ostream& out, const std::string& L
115  ) const
116 {
117  out
118  << L << "*** Set the bounds on d\n"
119  << L << "d_bounds_k.l = xl - x_k\n"
120  << L << "d_bounds_k.u = xu - x_k\n"
121  ;
122 }
123 
124 } // end namespace MoochoPack
rSQP Algorithm control class.
virtual std::ostream & journal_out() const
Reduced space SQP state encapsulation interface.
AlgorithmTracker & track()
bool do_step(Algorithm &algo, poss_type step_poss, IterationPack::EDoStepType type, poss_type assoc_step_poss)
NLPAlgoState & rsqp_state()
<<std aggr>="">> members for algo_cntr
void V_VmV(VectorMutable *v_lhs, const V1 &V1_rhs1, const V2 &V2_rhs2)
void print_step(const Algorithm &algo, poss_type step_poss, IterationPack::EDoStepType type, poss_type assoc_step_poss, std::ostream &out, const std::string &leading_str) const