void ColumnsToBlocks::Transform(const arma::mat& maximalInputs,
arma::mat& output)
{
if (!IsPerfectSquare(maximalInputs.n_rows))
{
throw std::runtime_error("maximalInputs.n_rows should be perfect square");
}
if (blockHeight == 0 || blockWidth == 0)
{
size_t const squareRows =
static_cast<size_t>(std::sqrt(maximalInputs.n_rows));
blockHeight = squareRows;
blockWidth = squareRows;
}
if (blockHeight * blockWidth != maximalInputs.n_rows)
{
throw std::runtime_error("blockHeight * blockWidth should "
"equal to maximalInputs.n_rows");
}
const size_t rowOffset = blockHeight+bufSize;
const size_t colOffset = blockWidth+bufSize;
output.ones(bufSize + rows * rowOffset,
bufSize + cols * colOffset);
output *= bufValue;
size_t k = 0;
const size_t maxSize = std::min(rows * cols, (size_t) maximalInputs.n_cols);
for (size_t i = 0; i != rows; ++i)
{
for (size_t j = 0; j != cols; ++j)
{
// Now, copy the elements of the row to the output submatrix.
const size_t minRow = bufSize + i * rowOffset;
const size_t minCol = bufSize + j * colOffset;
const size_t maxRow = i * rowOffset + blockHeight;
const size_t maxCol = j * colOffset + blockWidth;
output.submat(minRow, minCol, maxRow, maxCol) =
arma::reshape(maximalInputs.col(k++), blockHeight, blockWidth);
if (k >= maxSize)
break;
}
}
if (scale)
{
const double max = output.max();
const double min = output.min();
if ((max - min) != 0)
{
output = (output - min) / (max - min) * (maxRange - minRange) + minRange;
}
}
}
void AugLagrangianTestFunction::GradientConstraint(const size_t index,
const arma::mat& /* coordinates */,
arma::mat& gradient)
{
// If the user passed an invalid index (not 0), we will return a zero
// gradient.
gradient.zeros(2, 1);
if (index == 0)
{
// c'_x1(x) = 1
// c'_x2(x) = 1
gradient.ones(2, 1); // Use a shortcut instead of assigning individually.
}
}