linear_constraint.cc
Go to the documentation of this file.
00001 /******************************************************************************
00002 Copyright (c) 2018, Alexander W. Winkler. All rights reserved.
00003 
00004 Redistribution and use in source and binary forms, with or without
00005 modification, are permitted provided that the following conditions are met:
00006 
00007 * Redistributions of source code must retain the above copyright notice, this
00008   list of conditions and the following disclaimer.
00009 
00010 * Redistributions in binary form must reproduce the above copyright notice,
00011   this list of conditions and the following disclaimer in the documentation
00012   and/or other materials provided with the distribution.
00013 
00014 * Neither the name of the copyright holder nor the names of its
00015   contributors may be used to endorse or promote products derived from
00016   this software without specific prior written permission.
00017 
00018 THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
00019 AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
00020 IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
00021 DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
00022 FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
00023 DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
00024 SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
00025 CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
00026 OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
00027 OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
00028 ******************************************************************************/
00029 
00030 #include <towr/constraints/linear_constraint.h>
00031 
00032 namespace towr {
00033 
00034 
00035 LinearEqualityConstraint::LinearEqualityConstraint (
00036   const Eigen::MatrixXd& M,
00037   const Eigen::VectorXd& v,
00038   const std::string& variable_name)
00039     : ConstraintSet(v.rows(), "linear-equality-" + variable_name)
00040 {
00041   M_ = M;
00042   v_ = v;
00043   variable_name_   = variable_name;
00044 }
00045 
00046 LinearEqualityConstraint::VectorXd
00047 LinearEqualityConstraint::GetValues () const
00048 {
00049   VectorXd x = GetVariables()->GetComponent(variable_name_)->GetValues();
00050   return M_*x;
00051 }
00052 
00053 LinearEqualityConstraint::VecBound
00054 LinearEqualityConstraint::GetBounds () const
00055 {
00056   VecBound bounds;
00057 
00058   for (int i=0; i<GetRows(); ++i) {
00059     ifopt::Bounds bound(-v_[i],-v_[i]);
00060     bounds.push_back(bound);
00061   }
00062 
00063   return bounds;
00064 }
00065 
00066 void
00067 LinearEqualityConstraint::FillJacobianBlock (std::string var_set, Jacobian& jac) const
00068 {
00069   // the constraints are all linear w.r.t. the decision variables.
00070   // careful, sparseView is only valid when the Jacobian is constant
00071   if (var_set == variable_name_)
00072     jac = M_.sparseView();
00073 }
00074 
00075 } /* namespace towr */
00076 


towr
Author(s): Alexander W. Winkler
autogenerated on Mon Apr 15 2019 02:42:32