/usr/include/trilinos/ConstrainedOptPack_QPSolverRelaxedQPKWIK.hpp is in libtrilinos-dev 10.4.0.dfsg-1ubuntu2.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 | // @HEADER
// ***********************************************************************
//
// Moocho: Multi-functional Object-Oriented arCHitecture for Optimization
// Copyright (2003) Sandia Corporation
//
// Under terms of Contract DE-AC04-94AL85000, there is a non-exclusive
// license for use of this work by or on behalf of the U.S. Government.
//
// This library is free software; you can redistribute it and/or modify
// it under the terms of the GNU Lesser General Public License as
// published by the Free Software Foundation; either version 2.1 of the
// License, or (at your option) any later version.
//
// This library is distributed in the hope that it will be useful, but
// WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
// Lesser General Public License for more details.
//
// You should have received a copy of the GNU Lesser General Public
// License along with this library; if not, write to the Free Software
// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307
// USA
// Questions? Contact Roscoe A. Bartlett (rabartl@sandia.gov)
//
// ***********************************************************************
// @HEADER
#ifndef QP_SOLVER_RELAXED_QPKWIK_H
#define QP_SOLVER_RELAXED_QPKWIK_H
#include <vector>
#include "ConstrainedOptPack_QPSolverRelaxed.hpp"
#include "DenseLinAlgPack_DVectorClass.hpp"
#include "DenseLinAlgPack_DMatrixClass.hpp"
#include "Teuchos_StandardMemberCompositionMacros.hpp"
#include "Teuchos_F77_wrappers.h"
namespace ConstrainedOptPack {
/** \brief Solves Quadratic Programming (QP) problem using the primal-dual active-set
* solver QPKWIK.
*
* In this implementation it is required that G support the \Ref{MatrixExtractInvCholFactor}
* interface and is therefore quite restrictive on the likes of QPs it can solve.
*/
class QPSolverRelaxedQPKWIK : public QPSolverRelaxed
{
public:
/** @name Initialization */
//@{
/// Set the maximum number of QP iterations as max_itr = max_qp_iter_frac * n.
STANDARD_MEMBER_COMPOSITION_MEMBERS( value_type, max_qp_iter_frac );
/// Set the value of an infinite bound.
STANDARD_MEMBER_COMPOSITION_MEMBERS( value_type, infinite_bound );
/** \brief . */
QPSolverRelaxedQPKWIK(
value_type max_qp_iter_frac = 10.0
,value_type infinite_bound = 1e+20
);
/** \brief . */
~QPSolverRelaxedQPKWIK();
//@}
/** @name Overridden from QPSolverRelaxed */
//@{
/** \brief . */
QPSolverStats get_qp_stats() const;
/** \brief . */
void release_memory();
//@}
protected:
/** @name Overridden from QPSolverRelaxed */
//@{
/** \brief . */
QPSolverStats::ESolutionType imp_solve_qp(
std::ostream* out, EOutputLevel olevel, ERunTests test_what
,const Vector& g, const MatrixSymOp& G
,value_type etaL
,const Vector* dL, const Vector* dU
,const MatrixOp* E, BLAS_Cpp::Transp trans_E, const Vector* b
,const Vector* eL, const Vector* eU
,const MatrixOp* F, BLAS_Cpp::Transp trans_F, const Vector* f
,value_type* obj_d
,value_type* eta, VectorMutable* d
,VectorMutable* nu
,VectorMutable* mu, VectorMutable* Ed
,VectorMutable* lambda, VectorMutable* Fd
);
//@}
private:
// //////////////////////////////////////////////////////////////
// Private types
/** \brief . */
typedef FortranTypes::f_int f_int;
/** \brief . */
typedef std::vector<f_int> IBND_t;
/** \brief . */
typedef std::vector<f_int> IACTSTORE_t;
/** \brief . */
typedef std::vector<f_int> IACT_t;
/** \brief . */
typedef std::vector<f_int> ISTATE_t;
// //////////////////////////////////////////////////////////////
// Private Data Members.
QPSolverStats qp_stats_;
// Inverse mapping for IBND_INV(j) == k <-> IBND(k) == j
IBND_t IBND_INV_;
// Parameters to QPKWIK
/** \brief . */
f_int N_;
/** \brief . */
f_int M1_;
/** \brief . */
f_int M2_;
/** \brief . */
f_int M3_;
/** \brief . */
DVector GRAD_;
/** \brief . */
DMatrix UINV_AUG_;
/** \brief . */
f_int LDUINV_AUG_;
/** \brief . */
IBND_t IBND_;
/** \brief . */
DVector BL_;
/** \brief . */
DVector BU_;
/** \brief . */
DMatrix A_;
/** \brief . */
f_int LDA_;
/** \brief . */
DVector YPY_;
/** \brief . */
f_int IYPY_;
/** \brief . */
f_int WARM_;
/** \brief . */
value_type NUMPARAM_[3];
/** \brief . */
f_int MAX_ITER_;
// Input / Output
/** \brief . */
DVector X_;
/** \brief . */
f_int NACTSTORE_;
/** \brief . */
IACTSTORE_t IACTSTORE_;
/** \brief . */
f_int INF_;
// Output
/** \brief . */
f_int NACT_;
/** \brief . */
IACT_t IACT_;
/** \brief . */
DVector UR_;
/** \brief . */
value_type EXTRA_;
/** \brief . */
f_int ITER_;
/** \brief . */
f_int NUM_ADDS_;
/** \brief . */
f_int NUM_DROPS_;
// Internal state
/** \brief . */
ISTATE_t ISTATE_;
// Workspace
/** \brief . */
f_int LRW_;
/** \brief . */
DVector RW_;
}; // end class QPSolverRelaxedQPKWIK
} // end namespace ConstrainedOptimizationPackTypes
#endif // QP_SOLVER_RELAXED_QPKWIK_H
|