MoochoPack : Framework for Large-Scale Optimization Algorithms  Version of the Day
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Groups Pages
MoochoPack_QuasiNormalStepStd_Step.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_QuasiNormalStepStd_Step.hpp"
45 #include "MoochoPack_moocho_algo_conversion.hpp"
46 #include "IterationPack_print_algorithm_step.hpp"
47 #include "AbstractLinAlgPack_VectorMutable.hpp"
48 #include "AbstractLinAlgPack_VectorOut.hpp"
49 #include "AbstractLinAlgPack_MatrixOpNonsing.hpp"
50 #include "AbstractLinAlgPack_LinAlgOpPack.hpp"
51 
52 namespace MoochoPack {
53 
55  Algorithm& _algo, poss_type step_poss, IterationPack::EDoStepType type
56  ,poss_type assoc_step_poss
57  )
58 {
59  using BLAS_Cpp::no_trans;
62  using LinAlgOpPack::V_StV;
63  using LinAlgOpPack::V_MtV;
64 
65  NLPAlgo &algo = rsqp_algo(_algo);
66  NLPAlgoState &s = algo.rsqp_state();
67  const Range1D equ_decomp = s.equ_decomp();
68 
69  EJournalOutputLevel olevel = algo.algo_cntr().journal_output_level();
70  std::ostream& out = algo.track().journal_out();
71 
72  // print step header.
73  if( static_cast<int>(olevel) >= static_cast<int>(PRINT_ALGORITHM_STEPS) ) {
74  using IterationPack::print_algorithm_step;
75  print_algorithm_step( algo, step_poss, type, assoc_step_poss, out );
76  }
77 
78  // Get iteration quantities
79  IterQuantityAccess<VectorMutable>
80  &c_iq = s.c(),
81  &py_iq = s.py(),
82  &Ypy_iq = s.Ypy();
83  IterQuantityAccess<MatrixOpNonsing>
84  &R_iq = s.R();
85  IterQuantityAccess<MatrixOp>
86  &Y_iq = s.Y();
87 
88  // Solve the system py = - inv(R) * c(equ_decomp)
89  VectorMutable &py_k = py_iq.set_k(0);
90  V_InvMtV( &py_k, R_iq.get_k(0), no_trans, *c_iq.get_k(0).sub_view(equ_decomp) );
91  Vt_S( &py_k, -1.0 );
92 
93  // Ypy = Y * py
94  V_MtV( &Ypy_iq.set_k(0), Y_iq.get_k(0), no_trans, py_k );
95 
96  if( static_cast<int>(olevel) >= static_cast<int>(PRINT_ALGORITHM_STEPS) ) {
97  out << "\n||py|| = " << py_iq.get_k(0).norm_inf() << std::endl
98  << "\n||Ypy||2 = " << Ypy_iq.get_k(0).norm_2() << std::endl;
99  }
100 
101  if( static_cast<int>(olevel) >= static_cast<int>(PRINT_VECTORS) ) {
102  out << "\npy_k =\n" << py_iq.get_k(0);
103  out << "\nYpy_k =\n" << Ypy_iq.get_k(0);
104  }
105 
106  return true;
107 }
108 
110  const Algorithm& algo, poss_type step_poss, IterationPack::EDoStepType type
111  ,poss_type assoc_step_poss, std::ostream& out, const std::string& L
112  ) const
113 {
114  out
115  << L << "*** Calculate the range space step\n"
116  << L << "py_k = - inv(R_k) * c_k(equ_decomp)\n"
117  << L << "Ypy_k = Y_k * py_k\n";
118 }
119 
120 } // end namespace MoochoPack
void Vt_S(VectorMutable *v_lhs, const value_type &alpha)
rSQP Algorithm control class.
void V_StV(VectorMutable *v_lhs, value_type alpha, const V &V_rhs)
virtual std::ostream & journal_out() const
Reduced space SQP state encapsulation interface.
void V_InvMtV(VectorMutable *v_lhs, const MatrixNonsing &M_rhs1, BLAS_Cpp::Transp trans_rhs1, const Vector &v_rhs2)
AlgorithmTracker & track()
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
NLPAlgoState & rsqp_state()
<<std aggr>="">> members for algo_cntr
bool do_step(Algorithm &algo, poss_type step_poss, IterationPack::EDoStepType type, poss_type assoc_step_poss)