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_QPSchurInitKKTSystemHessianFull.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 "ConstrainedOptPack_QPSchurInitKKTSystemHessianFull.hpp"
43 #include "AbstractLinAlgPack_MatrixSymOpNonsing.hpp"
44 #include "AbstractLinAlgPack_LinAlgOpPack.hpp"
45 #include "AbstractLinAlgPack_VectorDenseEncap.hpp"
46 #include "DenseLinAlgPack_LinAlgOpPack.hpp"
47 #include "Teuchos_dyn_cast.hpp"
48 
49 namespace ConstrainedOptPack {
50 
52  const Vector &g
53  ,const MatrixOp &G
54  ,value_type etaL
55  ,const Vector *dL
56  ,const Vector *dU
57  ,const MatrixOp *F
58  ,BLAS_Cpp::Transp trans_F
59  ,const Vector *f
60  ,const Vector *d
61  ,const Vector *nu
62  ,size_type *n_R
63  ,i_x_free_t *i_x_free
64  ,i_x_fixed_t *i_x_fixed
65  ,bnd_fixed_t *bnd_fixed
66  ,j_f_decomp_t *j_f_decomp
67  ,DVector *b_X
68  ,Ko_ptr_t *Ko
69  ,DVector *fo
70  ) const
71 {
72  namespace mmp = MemMngPack;
73  using Teuchos::dyn_cast;
74  using LinAlgOpPack::V_mV;
75 
76  // Validate type of and convert G
77  const MatrixSymOpNonsing&
78  G_sym = dyn_cast<const MatrixSymOpNonsing>(G);
79 
80  const size_type nd = g.dim();
81 
82  // n_R
83  *n_R = nd;
84  // i_x_free[i-1] = i, i = 1...nd
85  i_x_free->resize(0);
86  // i_x_fixed[0] = nd+1
87  i_x_fixed->resize(1);
88  (*i_x_fixed)[0] = nd+1;
89  // bnd_fixed[0] = LOWER
90  bnd_fixed->resize(1);
91  (*bnd_fixed)[0] = LOWER;
92  // j_f_decomp[] = empty
93  j_f_decomp->resize(0);
94  // b_X = etaL
95  b_X->resize(1);
96  (*b_X)[0] = etaL;
97  // Ko = G
98  *Ko = Teuchos::rcp(&G_sym,false); // Not dynamically allocated so don't delete!
99  // fo = -g
100  V_mV(fo,VectorDenseEncap(g)());
101 }
102 
103 } // end namesapce ConstrainedOptPack
T_To & dyn_cast(T_From &from)
void V_mV(VectorMutable *v_lhs, const V &V_rhs)
TEUCHOS_DEPRECATED RCP< T > rcp(T *p, Dealloc_T dealloc, bool owns_mem)
size_t size_type
void initialize_kkt_system(const Vector &g, const MatrixOp &G, value_type etaL, const Vector *dL, const Vector *dU, const MatrixOp *F, BLAS_Cpp::Transp trans_F, const Vector *f, const Vector *d, const Vector *nu, size_type *n_R, i_x_free_t *i_x_free, i_x_fixed_t *i_x_fixed, bnd_fixed_t *bnd_fixed, j_f_decomp_t *j_f_decomp, DVector *b_X, Ko_ptr_t *Ko, DVector *fo) const
Initialize the KKT system where all variables (except the relaxation variable) are initially free and...
Transp