linear_constraint.cc
Go to the documentation of this file.
1 /******************************************************************************
2 Copyright (c) 2018, Alexander W. Winkler. All rights reserved.
3 
4 Redistribution and use in source and binary forms, with or without
5 modification, are permitted provided that the following conditions are met:
6 
7 * Redistributions of source code must retain the above copyright notice, this
8  list of conditions and the following disclaimer.
9 
10 * Redistributions in binary form must reproduce the above copyright notice,
11  this list of conditions and the following disclaimer in the documentation
12  and/or other materials provided with the distribution.
13 
14 * Neither the name of the copyright holder nor the names of its
15  contributors may be used to endorse or promote products derived from
16  this software without specific prior written permission.
17 
18 THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
19 AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
20 IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
21 DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
22 FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
23 DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
24 SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
25 CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
26 OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
27 OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
28 ******************************************************************************/
29 
31 
32 namespace towr {
33 
34 
36  const Eigen::MatrixXd& M,
37  const Eigen::VectorXd& v,
38  const std::string& variable_name)
39  : ConstraintSet(v.rows(), "linear-equality-" + variable_name)
40 {
41  M_ = M;
42  v_ = v;
43  variable_name_ = variable_name;
44 }
45 
48 {
49  VectorXd x = GetVariables()->GetComponent(variable_name_)->GetValues();
50  return M_*x;
51 }
52 
55 {
56  VecBound bounds;
57 
58  for (int i=0; i<GetRows(); ++i) {
59  ifopt::Bounds bound(-v_[i],-v_[i]);
60  bounds.push_back(bound);
61  }
62 
63  return bounds;
64 }
65 
66 void
67 LinearEqualityConstraint::FillJacobianBlock (std::string var_set, Jacobian& jac) const
68 {
69  // the constraints are all linear w.r.t. the decision variables.
70  // careful, sparseView is only valid when the Jacobian is constant
71  if (var_set == variable_name_)
72  jac = M_.sparseView();
73 }
74 
75 } /* namespace towr */
76 
VecBound GetBounds() const final
const VariablesPtr GetVariables() const
Eigen::VectorXd VectorXd
Eigen::SparseMatrix< double, Eigen::RowMajor > Jacobian
LinearEqualityConstraint(const MatrixXd &M, const VectorXd &v, const std::string &variable_set)
Defines the elements of the linear constraint as g = Mx+v = 0.
void FillJacobianBlock(std::string var_set, Jacobian &) const final
VectorXd GetValues() const final
std::vector< Bounds > VecBound
int GetRows() const
Eigen::VectorXd VectorXd


towr
Author(s): Alexander W. Winkler
autogenerated on Sat Apr 13 2019 02:28:00