TrajectoryControlNodesGreek.java

  1. package org.drip.execution.sensitivity;

  2. /*
  3.  * -*- mode: java; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*-
  4.  */

  5. /*!
  6.  * Copyright (C) 2020 Lakshmi Krishnamurthy
  7.  * Copyright (C) 2019 Lakshmi Krishnamurthy
  8.  * Copyright (C) 2018 Lakshmi Krishnamurthy
  9.  * Copyright (C) 2017 Lakshmi Krishnamurthy
  10.  * Copyright (C) 2016 Lakshmi Krishnamurthy
  11.  *
  12.  *  This file is part of DROP, an open-source library targeting analytics/risk, transaction cost analytics,
  13.  *      asset liability management analytics, capital, exposure, and margin analytics, valuation adjustment
  14.  *      analytics, and portfolio construction analytics within and across fixed income, credit, commodity,
  15.  *      equity, FX, and structured products. It also includes auxiliary libraries for algorithm support,
  16.  *      numerical analysis, numerical optimization, spline builder, model validation, statistical learning,
  17.  *      and computational support.
  18.  *  
  19.  *      https://lakshmidrip.github.io/DROP/
  20.  *  
  21.  *  DROP is composed of three modules:
  22.  *  
  23.  *  - DROP Product Core - https://lakshmidrip.github.io/DROP-Product-Core/
  24.  *  - DROP Portfolio Core - https://lakshmidrip.github.io/DROP-Portfolio-Core/
  25.  *  - DROP Computational Core - https://lakshmidrip.github.io/DROP-Computational-Core/
  26.  *
  27.  *  DROP Product Core implements libraries for the following:
  28.  *  - Fixed Income Analytics
  29.  *  - Loan Analytics
  30.  *  - Transaction Cost Analytics
  31.  *
  32.  *  DROP Portfolio Core implements libraries for the following:
  33.  *  - Asset Allocation Analytics
  34.  *  - Asset Liability Management Analytics
  35.  *  - Capital Estimation Analytics
  36.  *  - Exposure Analytics
  37.  *  - Margin Analytics
  38.  *  - XVA Analytics
  39.  *
  40.  *  DROP Computational Core implements libraries for the following:
  41.  *  - Algorithm Support
  42.  *  - Computation Support
  43.  *  - Function Analysis
  44.  *  - Model Validation
  45.  *  - Numerical Analysis
  46.  *  - Numerical Optimizer
  47.  *  - Spline Builder
  48.  *  - Statistical Learning
  49.  *
  50.  *  Documentation for DROP is Spread Over:
  51.  *
  52.  *  - Main                     => https://lakshmidrip.github.io/DROP/
  53.  *  - Wiki                     => https://github.com/lakshmiDRIP/DROP/wiki
  54.  *  - GitHub                   => https://github.com/lakshmiDRIP/DROP
  55.  *  - Repo Layout Taxonomy     => https://github.com/lakshmiDRIP/DROP/blob/master/Taxonomy.md
  56.  *  - Javadoc                  => https://lakshmidrip.github.io/DROP/Javadoc/index.html
  57.  *  - Technical Specifications => https://github.com/lakshmiDRIP/DROP/tree/master/Docs/Internal
  58.  *  - Release Versions         => https://lakshmidrip.github.io/DROP/version.html
  59.  *  - Community Credits        => https://lakshmidrip.github.io/DROP/credits.html
  60.  *  - Issues Catalog           => https://github.com/lakshmiDRIP/DROP/issues
  61.  *  - JUnit                    => https://lakshmidrip.github.io/DROP/junit/index.html
  62.  *  - Jacoco                   => https://lakshmidrip.github.io/DROP/jacoco/index.html
  63.  *
  64.  *  Licensed under the Apache License, Version 2.0 (the "License");
  65.  *      you may not use this file except in compliance with the License.
  66.  *  
  67.  *  You may obtain a copy of the License at
  68.  *      http://www.apache.org/licenses/LICENSE-2.0
  69.  *  
  70.  *  Unless required by applicable law or agreed to in writing, software
  71.  *      distributed under the License is distributed on an "AS IS" BASIS,
  72.  *      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  73.  *  
  74.  *  See the License for the specific language governing permissions and
  75.  *      limitations under the License.
  76.  */

  77. /**
  78.  * <i>TrajectoryControlNodesGreek</i> holds the Point Value, the Jacobian, and the Hessian for a Trajectory
  79.  * to the Holdings Control Nodes. The References are:
  80.  *
  81.  * <br><br>
  82.  *  <ul>
  83.  *      <li>
  84.  *          Almgren, R., and N. Chriss (1999): Value under Liquidation <i>Risk</i> <b>12 (12)</b>
  85.  *      </li>
  86.  *      <li>
  87.  *          Almgren, R., and N. Chriss (2000): Optimal Execution of Portfolio Transactions <i>Journal of
  88.  *              Risk</i> <b>3 (2)</b> 5-39
  89.  *      </li>
  90.  *      <li>
  91.  *          Bertsimas, D., and A. W. Lo (1998): Optimal Control of Execution Costs <i>Journal of Financial
  92.  *              Markets</i> <b>1</b> 1-50
  93.  *      </li>
  94.  *      <li>
  95.  *          Chan, L. K. C., and J. Lakonishak (1995): The Behavior of Stock Prices around Institutional
  96.  *              Trades <i>Journal of Finance</i> <b>50</b> 1147-1174
  97.  *      </li>
  98.  *      <li>
  99.  *          Keim, D. B., and A. Madhavan (1997): Transaction Costs and Investment Style: An Inter-exchange
  100.  *              Analysis of Institutional Equity Trades <i>Journal of Financial Economics</i> <b>46</b>
  101.  *              265-292
  102.  *      </li>
  103.  *  </ul>
  104.  *
  105.  *  <br><br>
  106.  *  <ul>
  107.  *      <li><b>Module </b> = <a href = "https://github.com/lakshmiDRIP/DROP/tree/master/ProductCore.md">Product Core Module</a></li>
  108.  *      <li><b>Library</b> = <a href = "https://github.com/lakshmiDRIP/DROP/tree/master/TransactionCostAnalyticsLibrary.md">Transaction Cost Analytics</a></li>
  109.  *      <li><b>Project</b> = <a href = "https://github.com/lakshmiDRIP/DROP/tree/master/src/main/java/org/drip/execution/README.md">Optimal Impact/Capture Based Trading Trajectories - Deterministic, Stochastic, Static, and Dynamic</a></li>
  110.  *      <li><b>Package</b> = <a href = "https://github.com/lakshmiDRIP/DROP/tree/master/src/main/java/org/drip/execution/sensitivity/README.md">Trajectory Control Nodes Sensitivity Greeks</a></li>
  111.  *  </ul>
  112.  *
  113.  * @author Lakshmi Krishnamurthy
  114.  */

  115. public class TrajectoryControlNodesGreek extends org.drip.execution.sensitivity.ControlNodesGreek {
  116.     private java.util.List<org.drip.execution.sensitivity.ControlNodesGreek> _lsCNGSlice = null;

  117.     /**
  118.      * TrajectoryControlNodesGreek Constructor
  119.      *
  120.      * @param dblValue The Objective Function Penalty Value
  121.      * @param adblJacobian The Objective Function Penalty Jacobian
  122.      * @param aadblHessian The Objective Function Penalty Hessian
  123.      * @param lsCNGSlice The List of the Slice Control Nodes Greek
  124.      *
  125.      * @throws java.lang.Exception Thrown if the Inputs are Invalid
  126.      */

  127.     public TrajectoryControlNodesGreek (
  128.         final double dblValue,
  129.         final double[] adblJacobian,
  130.         final double[][] aadblHessian,
  131.         final java.util.List<org.drip.execution.sensitivity.ControlNodesGreek> lsCNGSlice)
  132.         throws java.lang.Exception
  133.     {
  134.         super (dblValue, adblJacobian, aadblHessian);

  135.         if (null == (_lsCNGSlice = lsCNGSlice) || 0 == _lsCNGSlice.size())
  136.             throw new java.lang.Exception ("TrajectoryControlNodesGreek Constructor => Invalid Inputs");
  137.     }

  138.     /**
  139.      * Retrieve the List of the Slice Control Nodes Greek
  140.      *
  141.      * @return The List of the Slice Control Nodes Greek
  142.      */

  143.     public java.util.List<org.drip.execution.sensitivity.ControlNodesGreek> sliceGreeks()
  144.     {
  145.         return _lsCNGSlice;
  146.     }

  147.     /**
  148.      * Retrieve the Inner Jacobian Array
  149.      *
  150.      * @return The Inner Jacobian Array
  151.      */

  152.     public double[] innerJacobian()
  153.     {
  154.         double[] adblJacobian = jacobian();

  155.         int iNumInnerNode = adblJacobian.length - 2;
  156.         double[] adblInnerJacobian = 0 >= iNumInnerNode ? null : new double[iNumInnerNode];

  157.         if (null == adblInnerJacobian) return null;

  158.         for (int i = 0; i < iNumInnerNode; ++i)
  159.             adblInnerJacobian[i] = adblJacobian[i + 1];

  160.         return adblInnerJacobian;
  161.     }

  162.     /**
  163.      * Retrieve the Inner Hessian Matrix
  164.      *
  165.      * @return The Inner Hessian Matrix
  166.      */

  167.     public double[][] innerHessian()
  168.     {
  169.         double[][] aadblHessian = hessian();

  170.         int iNumInnerNode = aadblHessian.length - 2;
  171.         double[][] aadblInnerHessian = 0 >= iNumInnerNode ? null : new double[iNumInnerNode][iNumInnerNode];

  172.         if (null == aadblInnerHessian) return null;

  173.         for (int i = 0; i < iNumInnerNode; ++i) {
  174.             for (int j = 0; j < iNumInnerNode; ++j)
  175.                 aadblInnerHessian[i][j] = aadblHessian[i + 1][j + 1];
  176.         }

  177.         return aadblInnerHessian;
  178.     }
  179. }