BarrierFixedPointFinder.java

  1. package org.drip.function.rdtor1solver;

  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>BarrierFixedPointFinder</i> invokes the Iterative Finders for locating the Fixed Point of
  79.  * R<sup>d</sup> To R<sup>1</sup> Convex/Non-Convex Functions Under Inequality Constraints using Barrier
  80.  * Sequences of decaying Strengths.
  81.  *
  82.  *  <br><br>
  83.  *  <ul>
  84.  *      <li><b>Module </b> = <a href = "https://github.com/lakshmiDRIP/DROP/tree/master/NumericalCore.md">Numerical Core Module</a></li>
  85.  *      <li><b>Library</b> = <a href = "https://github.com/lakshmiDRIP/DROP/tree/master/NumericalOptimizerLibrary.md">Numerical Optimizer</a></li>
  86.  *      <li><b>Project</b> = <a href = "https://github.com/lakshmiDRIP/DROP/tree/master/src/main/java/org/drip/feed/README.md">Function</a></li>
  87.  *      <li><b>Package</b> = <a href = "https://github.com/lakshmiDRIP/DROP/tree/master/src/main/java/org/drip/feed/rdtor1solver/README.md">R<sup>d</sup> To R<sup>1</sup> Solver</a></li>
  88.  *  </ul>
  89.  *
  90.  * @author Lakshmi Krishnamurthy
  91.  */

  92. public class BarrierFixedPointFinder
  93. {
  94.     private org.drip.function.definition.RdToR1 _objectiveFunction = null;
  95.     private org.drip.function.rdtor1descent.LineStepEvolutionControl _lineStepEvolutionControl = null;
  96.     private org.drip.function.definition.RdToR1[] _inequalityConstraintMultivariateFunctionArray = null;
  97.     private org.drip.function.rdtor1solver.InteriorPointBarrierControl _interiorPointBarrierControl = null;

  98.     /**
  99.      * BarrierFixedPointFinder Constructor
  100.      *
  101.      * @param objectiveFunction The Objective Function
  102.      * @param inequalityConstraintMultivariateFunctionArray Array of Multivariate Inequality Constraint
  103.      *      Functions
  104.      * @param interiorPointBarrierControl Interior Point Barrier Strength Control Parameters
  105.      * @param lineStepEvolutionControl Line Step Evolution Verifier Control Parameters
  106.      *
  107.      * @throws java.lang.Exception Thrown if the Inputs are Invalid
  108.      */

  109.     public BarrierFixedPointFinder (
  110.         final org.drip.function.definition.RdToR1 objectiveFunction,
  111.         final org.drip.function.definition.RdToR1[] inequalityConstraintMultivariateFunctionArray,
  112.         final org.drip.function.rdtor1solver.InteriorPointBarrierControl interiorPointBarrierControl,
  113.         final org.drip.function.rdtor1descent.LineStepEvolutionControl lineStepEvolutionControl)
  114.         throws java.lang.Exception
  115.     {
  116.         if (null == (_objectiveFunction = objectiveFunction) ||
  117.             null == (_inequalityConstraintMultivariateFunctionArray = inequalityConstraintMultivariateFunctionArray) ||
  118.             null == (_interiorPointBarrierControl = interiorPointBarrierControl))
  119.         {
  120.             throw new java.lang.Exception ("BarrierFixedPointFinder Constructor => Invalid Inputs");
  121.         }

  122.         _lineStepEvolutionControl = lineStepEvolutionControl;
  123.         int constraintCount = _inequalityConstraintMultivariateFunctionArray.length;

  124.         if (0 == constraintCount)
  125.         {
  126.             throw new java.lang.Exception ("BarrierFixedPointFinder Constructor => Invalid Inputs");
  127.         }

  128.         for (int constraintIndex = 0;
  129.             constraintIndex < constraintCount;
  130.             ++constraintIndex)
  131.         {
  132.             if (null == _inequalityConstraintMultivariateFunctionArray[constraintIndex])
  133.             {
  134.                 throw new java.lang.Exception ("BarrierFixedPointFinder Constructor => Invalid Inputs");
  135.             }
  136.         }
  137.     }

  138.     /**
  139.      * Retrieve the Objective Function
  140.      *
  141.      * @return The Objective Function
  142.      */

  143.     public org.drip.function.definition.RdToR1 objectiveFunction()
  144.     {
  145.         return _objectiveFunction;
  146.     }

  147.     /**
  148.      * Retrieve the Array of Inequality Constraints
  149.      *
  150.      * @return The Array of Inequality Constraints
  151.      */

  152.     public org.drip.function.definition.RdToR1[] inequalityConstraintMultivariateFunctionArray()
  153.     {
  154.         return _inequalityConstraintMultivariateFunctionArray;
  155.     }

  156.     /**
  157.      * Retrieve the Line Step Evolution Interior Control Parameters
  158.      *
  159.      * @return The Line Step Evolution Strength Control Parameters
  160.      */

  161.     public org.drip.function.rdtor1descent.LineStepEvolutionControl lineStepEvolutionControl()
  162.     {
  163.         return _lineStepEvolutionControl;
  164.     }

  165.     /**
  166.      * Retrieve the Interior Point Barrier Control Parameters
  167.      *
  168.      * @return The Interior Point Barrier Control Parameters
  169.      */

  170.     public org.drip.function.rdtor1solver.InteriorPointBarrierControl interiorPointBarrierControl()
  171.     {
  172.         return _interiorPointBarrierControl;
  173.     }

  174.     /**
  175.      * Solve for the Optimal Variate-Inequality Constraint Multiplier Tuple using the Barrier Iteration
  176.      *  Parameters provided by the IPBC Instance
  177.      *  
  178.      * @param startingVariateArray The Starting Variate Sequence
  179.      *
  180.      * @return The Optimal Variate-Inequality Constraint Multiplier Tuple
  181.      */

  182.     public org.drip.function.rdtor1solver.VariateInequalityConstraintMultiplier solve (
  183.         final double[] startingVariateArray)
  184.     {
  185.         double barrierStrength = _interiorPointBarrierControl.initialStrength();

  186.         int outstandingDecaySteps = _interiorPointBarrierControl.decayStepCount();

  187.         double barrierDecayVelocity = _interiorPointBarrierControl.decayVelocity();

  188.         org.drip.function.rdtor1solver.VariateInequalityConstraintMultiplier variateConstraint = null;
  189.         int constraintCount = _inequalityConstraintMultivariateFunctionArray.length;
  190.         double[] startingConstraintMultiplierArray = new double[constraintCount];

  191.         try
  192.         {
  193.             for (int constraintIndex = 0;
  194.                 constraintIndex < constraintCount;
  195.                 ++constraintIndex)
  196.             {
  197.                 startingConstraintMultiplierArray[constraintIndex] = barrierStrength /
  198.                     _inequalityConstraintMultivariateFunctionArray[constraintIndex].evaluate (
  199.                         startingVariateArray
  200.                     );
  201.             }

  202.             variateConstraint = new org.drip.function.rdtor1solver.VariateInequalityConstraintMultiplier (
  203.                 false,
  204.                 startingVariateArray,
  205.                 startingConstraintMultiplierArray
  206.             );
  207.         }
  208.         catch (java.lang.Exception e)
  209.         {
  210.             e.printStackTrace();

  211.             return null;
  212.         }

  213.         while (--outstandingDecaySteps >= 0)
  214.         {
  215.             try
  216.             {
  217.                 org.drip.function.rdtor1solver.InteriorFixedPointFinder interiorFixedPointFinder =
  218.                     new org.drip.function.rdtor1solver.InteriorFixedPointFinder (
  219.                         _objectiveFunction,
  220.                         _inequalityConstraintMultivariateFunctionArray,
  221.                         _lineStepEvolutionControl,
  222.                         _interiorPointBarrierControl,
  223.                         barrierStrength
  224.                     );

  225.                 if (null == (
  226.                     variateConstraint = interiorFixedPointFinder.find (
  227.                         variateConstraint
  228.                     ))
  229.                 )
  230.                 {
  231.                     return null;
  232.                 }
  233.             }
  234.             catch (java.lang.Exception e)
  235.             {
  236.                 e.printStackTrace();

  237.                 return null;
  238.             }

  239.             barrierStrength *= barrierDecayVelocity;
  240.         }

  241.         return variateConstraint;
  242.     }
  243. }