Ignore:
Timestamp:
Jan 6, 2019 2:43:06 PM (3 months ago)
Author:
unxusr
Message:

formatting

File:
1 edited

Legend:

Unmodified
Added
Removed
  • trunk/Clp/src/ClpPredictorCorrector.hpp

    r1665 r2385  
    3838
    3939public:
    40 
    41      /**@name Description of algorithm */
    42      //@{
    43      /** Primal Dual Predictor Corrector algorithm
     40  /**@name Description of algorithm */
     41  //@{
     42  /** Primal Dual Predictor Corrector algorithm
    4443
    4544         Method
     
    4847     */
    4948
    50      int solve();
    51      //@}
     49  int solve();
     50  //@}
    5251
    53      /**@name Functions used in algorithm */
    54      //@{
    55      /// findStepLength.
    56      //phase  - 0 predictor
    57      //         1 corrector
    58      //         2 primal dual
    59      CoinWorkDouble findStepLength( int phase);
    60      /// findDirectionVector.
    61      CoinWorkDouble findDirectionVector(const int phase);
    62      /// createSolution.  Creates solution from scratch (- code if no memory)
    63      int createSolution();
    64      /// complementarityGap.  Computes gap
    65      //phase 0=as is , 1 = after predictor , 2 after corrector
    66      CoinWorkDouble complementarityGap(int & numberComplementarityPairs, int & numberComplementarityItems,
    67                                        const int phase);
    68      /// setupForSolve.
    69      //phase 0=affine , 1 = corrector , 2 = primal-dual
    70      void setupForSolve(const int phase);
    71      /** Does solve. region1 is for deltaX (columns+rows), region2 for deltaPi (rows) */
    72      void solveSystem(CoinWorkDouble * region1, CoinWorkDouble * region2,
    73                       const CoinWorkDouble * region1In, const CoinWorkDouble * region2In,
    74                       const CoinWorkDouble * saveRegion1, const CoinWorkDouble * saveRegion2,
    75                       bool gentleRefine);
    76      /// sees if looks plausible change in complementarity
    77      bool checkGoodMove(const bool doCorrector, CoinWorkDouble & bestNextGap,
    78                         bool allowIncreasingGap);
    79      ///:  checks for one step size
    80      bool checkGoodMove2(CoinWorkDouble move, CoinWorkDouble & bestNextGap,
    81                          bool allowIncreasingGap);
    82      /// updateSolution.  Updates solution at end of iteration
    83      //returns number fixed
    84      int updateSolution(CoinWorkDouble nextGap);
    85      ///  Save info on products of affine deltaT*deltaW and deltaS*deltaZ
    86      CoinWorkDouble affineProduct();
    87      ///See exactly what would happen given current deltas
    88      void debugMove(int phase, CoinWorkDouble primalStep, CoinWorkDouble dualStep);
    89      //@}
    90 
     52  /**@name Functions used in algorithm */
     53  //@{
     54  /// findStepLength.
     55  //phase  - 0 predictor
     56  //         1 corrector
     57  //         2 primal dual
     58  CoinWorkDouble findStepLength(int phase);
     59  /// findDirectionVector.
     60  CoinWorkDouble findDirectionVector(const int phase);
     61  /// createSolution.  Creates solution from scratch (- code if no memory)
     62  int createSolution();
     63  /// complementarityGap.  Computes gap
     64  //phase 0=as is , 1 = after predictor , 2 after corrector
     65  CoinWorkDouble complementarityGap(int &numberComplementarityPairs, int &numberComplementarityItems,
     66    const int phase);
     67  /// setupForSolve.
     68  //phase 0=affine , 1 = corrector , 2 = primal-dual
     69  void setupForSolve(const int phase);
     70  /** Does solve. region1 is for deltaX (columns+rows), region2 for deltaPi (rows) */
     71  void solveSystem(CoinWorkDouble *region1, CoinWorkDouble *region2,
     72    const CoinWorkDouble *region1In, const CoinWorkDouble *region2In,
     73    const CoinWorkDouble *saveRegion1, const CoinWorkDouble *saveRegion2,
     74    bool gentleRefine);
     75  /// sees if looks plausible change in complementarity
     76  bool checkGoodMove(const bool doCorrector, CoinWorkDouble &bestNextGap,
     77    bool allowIncreasingGap);
     78  ///:  checks for one step size
     79  bool checkGoodMove2(CoinWorkDouble move, CoinWorkDouble &bestNextGap,
     80    bool allowIncreasingGap);
     81  /// updateSolution.  Updates solution at end of iteration
     82  //returns number fixed
     83  int updateSolution(CoinWorkDouble nextGap);
     84  ///  Save info on products of affine deltaT*deltaW and deltaS*deltaZ
     85  CoinWorkDouble affineProduct();
     86  ///See exactly what would happen given current deltas
     87  void debugMove(int phase, CoinWorkDouble primalStep, CoinWorkDouble dualStep);
     88  //@}
    9189};
    9290#endif
     91
     92/* vi: softtabstop=2 shiftwidth=2 expandtab tabstop=2
     93*/
Note: See TracChangeset for help on using the changeset viewer.