225 lines
29 KiB
HTML
225 lines
29 KiB
HTML
<!-- HTML header for doxygen 1.8.18-->
|
|
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
|
|
<html xmlns="http://www.w3.org/1999/xhtml">
|
|
<head>
|
|
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
|
|
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
|
|
<meta name="generator" content="Doxygen 1.9.3"/>
|
|
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
|
<title>OR-Tools: iteration_stats.h Source File</title>
|
|
<link href="tabs.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="jquery.js"></script>
|
|
<script type="text/javascript" src="dynsections.js"></script>
|
|
<link href="navtree.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="resize.js"></script>
|
|
<script type="text/javascript" src="navtreedata.js"></script>
|
|
<script type="text/javascript" src="navtree.js"></script>
|
|
<link href="search/search.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="search/searchdata.js"></script>
|
|
<script type="text/javascript" src="search/search.js"></script>
|
|
<link href="doxygen.css" rel="stylesheet" type="text/css" />
|
|
<link href="styleSheet.tmp.css" rel="stylesheet" type="text/css"/>
|
|
</head>
|
|
<body>
|
|
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
|
|
<div id="titlearea">
|
|
<table cellspacing="0" cellpadding="0">
|
|
<tbody>
|
|
<tr style="height: 56px;">
|
|
<td id="projectlogo"><img alt="Logo" src="orLogo.png"/></td>
|
|
<td id="projectalign" style="padding-left: 0.5em;">
|
|
<div id="projectname">OR-Tools
|
|
 <span id="projectnumber">9.3</span>
|
|
</div>
|
|
</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<!-- end header part -->
|
|
<!-- Generated by Doxygen 1.9.3 -->
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
|
var searchBox = new SearchBox("searchBox", "search",'Search','.html');
|
|
/* @license-end */
|
|
</script>
|
|
<script type="text/javascript" src="menudata.js"></script>
|
|
<script type="text/javascript" src="menu.js"></script>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
|
$(function() {
|
|
initMenu('',true,false,'search.php','Search');
|
|
$(document).ready(function() { init_search(); });
|
|
});
|
|
/* @license-end */
|
|
</script>
|
|
<div id="main-nav"></div>
|
|
</div><!-- top -->
|
|
<div id="side-nav" class="ui-resizable side-nav-resizable">
|
|
<div id="nav-tree">
|
|
<div id="nav-tree-contents">
|
|
<div id="nav-sync" class="sync"></div>
|
|
</div>
|
|
</div>
|
|
<div id="splitbar" style="-moz-user-select:none;"
|
|
class="ui-resizable-handle">
|
|
</div>
|
|
</div>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
|
$(document).ready(function(){initNavTree('iteration__stats_8h_source.html',''); initResizable(); });
|
|
/* @license-end */
|
|
</script>
|
|
<div id="doc-content">
|
|
<!-- window showing the filter options -->
|
|
<div id="MSearchSelectWindow"
|
|
onmouseover="return searchBox.OnSearchSelectShow()"
|
|
onmouseout="return searchBox.OnSearchSelectHide()"
|
|
onkeydown="return searchBox.OnSearchSelectKey(event)">
|
|
</div>
|
|
|
|
<!-- iframe showing the search results (closed by default) -->
|
|
<div id="MSearchResultsWindow">
|
|
<iframe src="javascript:void(0)" frameborder="0"
|
|
name="MSearchResults" id="MSearchResults">
|
|
</iframe>
|
|
</div>
|
|
|
|
<div class="header">
|
|
<div class="headertitle"><div class="title">iteration_stats.h</div></div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="iteration__stats_8h.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno"> 1</span><span class="comment">// Copyright 2010-2021 Google LLC</span></div>
|
|
<div class="line"><a id="l00002" name="l00002"></a><span class="lineno"> 2</span><span class="comment">// Licensed under the Apache License, Version 2.0 (the "License");</span></div>
|
|
<div class="line"><a id="l00003" name="l00003"></a><span class="lineno"> 3</span><span class="comment">// you may not use this file except in compliance with the License.</span></div>
|
|
<div class="line"><a id="l00004" name="l00004"></a><span class="lineno"> 4</span><span class="comment">// You may obtain a copy of the License at</span></div>
|
|
<div class="line"><a id="l00005" name="l00005"></a><span class="lineno"> 5</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00006" name="l00006"></a><span class="lineno"> 6</span><span class="comment">// http://www.apache.org/licenses/LICENSE-2.0</span></div>
|
|
<div class="line"><a id="l00007" name="l00007"></a><span class="lineno"> 7</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00008" name="l00008"></a><span class="lineno"> 8</span><span class="comment">// Unless required by applicable law or agreed to in writing, software</span></div>
|
|
<div class="line"><a id="l00009" name="l00009"></a><span class="lineno"> 9</span><span class="comment">// distributed under the License is distributed on an "AS IS" BASIS,</span></div>
|
|
<div class="line"><a id="l00010" name="l00010"></a><span class="lineno"> 10</span><span class="comment">// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.</span></div>
|
|
<div class="line"><a id="l00011" name="l00011"></a><span class="lineno"> 11</span><span class="comment">// See the License for the specific language governing permissions and</span></div>
|
|
<div class="line"><a id="l00012" name="l00012"></a><span class="lineno"> 12</span><span class="comment">// limitations under the License.</span></div>
|
|
<div class="line"><a id="l00013" name="l00013"></a><span class="lineno"> 13</span> </div>
|
|
<div class="line"><a id="l00014" name="l00014"></a><span class="lineno"> 14</span><span class="preprocessor">#ifndef PDLP_ITERATION_STATS_H_</span></div>
|
|
<div class="line"><a id="l00015" name="l00015"></a><span class="lineno"> 15</span><span class="preprocessor">#define PDLP_ITERATION_STATS_H_</span></div>
|
|
<div class="line"><a id="l00016" name="l00016"></a><span class="lineno"> 16</span> </div>
|
|
<div class="line"><a id="l00017" name="l00017"></a><span class="lineno"> 17</span><span class="preprocessor">#include <limits></span></div>
|
|
<div class="line"><a id="l00018" name="l00018"></a><span class="lineno"> 18</span><span class="preprocessor">#include <string></span></div>
|
|
<div class="line"><a id="l00019" name="l00019"></a><span class="lineno"> 19</span><span class="preprocessor">#include <vector></span></div>
|
|
<div class="line"><a id="l00020" name="l00020"></a><span class="lineno"> 20</span> </div>
|
|
<div class="line"><a id="l00021" name="l00021"></a><span class="lineno"> 21</span><span class="preprocessor">#include "Eigen/Core"</span></div>
|
|
<div class="line"><a id="l00022" name="l00022"></a><span class="lineno"> 22</span><span class="preprocessor">#include "absl/types/optional.h"</span></div>
|
|
<div class="line"><a id="l00023" name="l00023"></a><span class="lineno"> 23</span><span class="preprocessor">#include "<a class="code" href="sharded__quadratic__program_8h.html">ortools/pdlp/sharded_quadratic_program.h</a>"</span></div>
|
|
<div class="line"><a id="l00024" name="l00024"></a><span class="lineno"> 24</span><span class="preprocessor">#include "ortools/pdlp/solve_log.pb.h"</span></div>
|
|
<div class="line"><a id="l00025" name="l00025"></a><span class="lineno"> 25</span><span class="preprocessor">#include "ortools/pdlp/solvers.pb.h"</span></div>
|
|
<div class="line"><a id="l00026" name="l00026"></a><span class="lineno"> 26</span> </div>
|
|
<div class="line"><a id="l00027" name="l00027"></a><span class="lineno"> 27</span><span class="keyword">namespace </span><a class="code hl_namespace" href="namespaceoperations__research_1_1pdlp.html">operations_research::pdlp</a> {</div>
|
|
<div class="line"><a id="l00028" name="l00028"></a><span class="lineno"> 28</span> </div>
|
|
<div class="line"><a id="l00029" name="l00029"></a><span class="lineno"> 29</span><span class="comment">// Returns convergence statistics about a primal/dual solution pair. The stats</span></div>
|
|
<div class="line"><a id="l00030" name="l00030"></a><span class="lineno"> 30</span><span class="comment">// are with respect to sharded_qp (which is typically scaled).</span></div>
|
|
<div class="line"><a id="l00031" name="l00031"></a><span class="lineno"> 31</span><span class="comment">// This function is equivalent to ComputeConvergenceInformation given scaling</span></div>
|
|
<div class="line"><a id="l00032" name="l00032"></a><span class="lineno"> 32</span><span class="comment">// vectors uniformly equal to one.</span></div>
|
|
<div class="line"><a id="l00033" name="l00033"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1pdlp.html#a1b46470024f581f8d344f57858fb561c"> 33</a></span>ConvergenceInformation <a class="code hl_function" href="namespaceoperations__research_1_1pdlp.html#a31aa44a967ce3e99c705e97da796aea0">ComputeScaledConvergenceInformation</a>(</div>
|
|
<div class="line"><a id="l00034" name="l00034"></a><span class="lineno"> 34</span> <span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1pdlp_1_1_sharded_quadratic_program.html">ShardedQuadraticProgram</a>& sharded_qp,</div>
|
|
<div class="line"><a id="l00035" name="l00035"></a><span class="lineno"> 35</span> <span class="keyword">const</span> Eigen::VectorXd& primal_solution,</div>
|
|
<div class="line"><a id="l00036" name="l00036"></a><span class="lineno"> 36</span> <span class="keyword">const</span> Eigen::VectorXd& dual_solution, PointType candidate_type);</div>
|
|
<div class="line"><a id="l00037" name="l00037"></a><span class="lineno"> 37</span> </div>
|
|
<div class="line"><a id="l00038" name="l00038"></a><span class="lineno"> 38</span><span class="comment">// Returns convergence statistics about a primal/dual solution pair. It is</span></div>
|
|
<div class="line"><a id="l00039" name="l00039"></a><span class="lineno"> 39</span><span class="comment">// assumed that scaled_sharded_qp has been transformed from the original qp by</span></div>
|
|
<div class="line"><a id="l00040" name="l00040"></a><span class="lineno"> 40</span><span class="comment">// ShardedQuadraticProgram::RescaleQuadraticProgram(col_scaling_vec,</span></div>
|
|
<div class="line"><a id="l00041" name="l00041"></a><span class="lineno"> 41</span><span class="comment">// row_scaling_vec). scaled_primal_solution and scaled_dual_solution are</span></div>
|
|
<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"> 42</span><span class="comment">// solutions for the scaled problem. The stats are computed with respect to the</span></div>
|
|
<div class="line"><a id="l00043" name="l00043"></a><span class="lineno"> 43</span><span class="comment">// implicit original problem.</span></div>
|
|
<div class="line"><a id="l00044" name="l00044"></a><span class="lineno"> 44</span><span class="comment">// NOTE: This function assumes that scaled_primal_solution satisfies the</span></div>
|
|
<div class="line"><a id="l00045" name="l00045"></a><span class="lineno"> 45</span><span class="comment">// variable bounds and scaled_dual_solution satisfies the dual variable bounds;</span></div>
|
|
<div class="line"><a id="l00046" name="l00046"></a><span class="lineno"> 46</span><span class="comment">// see</span></div>
|
|
<div class="line"><a id="l00047" name="l00047"></a><span class="lineno"> 47</span><span class="comment">// https://developers.google.com/optimization/lp/pdlp_math#dual_variable_bounds.</span></div>
|
|
<div class="line"><a id="l00048" name="l00048"></a><span class="lineno"> 48</span>ConvergenceInformation <a class="code hl_function" href="namespaceoperations__research_1_1pdlp.html#ac77694ebaac0adfa0fce8422782c48c8">ComputeConvergenceInformation</a>(</div>
|
|
<div class="line"><a id="l00049" name="l00049"></a><span class="lineno"> 49</span> <span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1pdlp_1_1_sharded_quadratic_program.html">ShardedQuadraticProgram</a>& sharded_qp,</div>
|
|
<div class="line"><a id="l00050" name="l00050"></a><span class="lineno"> 50</span> <span class="keyword">const</span> Eigen::VectorXd& col_scaling_vec,</div>
|
|
<div class="line"><a id="l00051" name="l00051"></a><span class="lineno"> 51</span> <span class="keyword">const</span> Eigen::VectorXd& row_scaling_vec,</div>
|
|
<div class="line"><a id="l00052" name="l00052"></a><span class="lineno"> 52</span> <span class="keyword">const</span> Eigen::VectorXd& scaled_primal_solution,</div>
|
|
<div class="line"><a id="l00053" name="l00053"></a><span class="lineno"> 53</span> <span class="keyword">const</span> Eigen::VectorXd& scaled_dual_solution, PointType candidate_type);</div>
|
|
<div class="line"><a id="l00054" name="l00054"></a><span class="lineno"> 54</span> </div>
|
|
<div class="line"><a id="l00055" name="l00055"></a><span class="lineno"> 55</span><span class="comment">// Returns infeasibility statistics about a primal/dual infeasibility</span></div>
|
|
<div class="line"><a id="l00056" name="l00056"></a><span class="lineno"> 56</span><span class="comment">// certificate estimate. It is assumed that scaled_sharded_qp has been</span></div>
|
|
<div class="line"><a id="l00057" name="l00057"></a><span class="lineno"> 57</span><span class="comment">// transformed from the original qp by</span></div>
|
|
<div class="line"><a id="l00058" name="l00058"></a><span class="lineno"> 58</span><span class="comment">// ShardedQuadraticProgram::RescaleQuadraticProgram(col_scaling_vec,</span></div>
|
|
<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"> 59</span><span class="comment">// row_scaling_vec). primal_ray and dual_ray are certificates for the scaled</span></div>
|
|
<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"> 60</span><span class="comment">// problem. The stats are computed with respect to the implicit original</span></div>
|
|
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"> 61</span><span class="comment">// problem.</span></div>
|
|
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"> 62</span>InfeasibilityInformation <a class="code hl_function" href="namespaceoperations__research_1_1pdlp.html#a74af5ceb7b6e37fbfca92e2c59b99e3e">ComputeInfeasibilityInformation</a>(</div>
|
|
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"> 63</span> <span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1pdlp_1_1_sharded_quadratic_program.html">ShardedQuadraticProgram</a>& scaled_sharded_qp,</div>
|
|
<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"> 64</span> <span class="keyword">const</span> Eigen::VectorXd& col_scaling_vec,</div>
|
|
<div class="line"><a id="l00065" name="l00065"></a><span class="lineno"> 65</span> <span class="keyword">const</span> Eigen::VectorXd& row_scaling_vec,</div>
|
|
<div class="line"><a id="l00066" name="l00066"></a><span class="lineno"> 66</span> <span class="keyword">const</span> Eigen::VectorXd& scaled_primal_ray,</div>
|
|
<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"> 67</span> <span class="keyword">const</span> Eigen::VectorXd& scaled_dual_ray, PointType candidate_type);</div>
|
|
<div class="line"><a id="l00068" name="l00068"></a><span class="lineno"> 68</span> </div>
|
|
<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"> 69</span><span class="comment">// Computes the reduced costs vector, objective_matrix * primal_solution +</span></div>
|
|
<div class="line"><a id="l00070" name="l00070"></a><span class="lineno"> 70</span><span class="comment">// objective_vector - constraint_matrix * dual_solution - dual_residuals, when</span></div>
|
|
<div class="line"><a id="l00071" name="l00071"></a><span class="lineno"> 71</span><span class="comment">// use_zero_primal_objective is false, and -constraint_matrix * dual_solution -</span></div>
|
|
<div class="line"><a id="l00072" name="l00072"></a><span class="lineno"> 72</span><span class="comment">// dual_residuals when use_zero_primal_objective is true. The elements of the</span></div>
|
|
<div class="line"><a id="l00073" name="l00073"></a><span class="lineno"> 73</span><span class="comment">// vector are corrected component-wise to zero to ensure that the dual objective</span></div>
|
|
<div class="line"><a id="l00074" name="l00074"></a><span class="lineno"> 74</span><span class="comment">// takes a finite value. See</span></div>
|
|
<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"> 75</span><span class="comment">// https://developers.google.com/optimization/lp/pdlp_math#reduced_costs_dual_residuals_and_the_corrected_dual_objective.</span></div>
|
|
<div class="line"><a id="l00076" name="l00076"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1pdlp.html#aa1cd435718e145058e7e6706258c21ef"> 76</a></span>Eigen::VectorXd <a class="code hl_function" href="namespaceoperations__research_1_1pdlp.html#a64bfea523f69cba6f7be8ac302c18f2f">ReducedCosts</a>(<span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1pdlp_1_1_sharded_quadratic_program.html">ShardedQuadraticProgram</a>& scaled_sharded_qp,</div>
|
|
<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"> 77</span> <span class="keyword">const</span> Eigen::VectorXd& primal_solution,</div>
|
|
<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"> 78</span> <span class="keyword">const</span> Eigen::VectorXd& dual_solution,</div>
|
|
<div class="line"><a id="l00079" name="l00079"></a><span class="lineno"> 79</span> <span class="keywordtype">bool</span> use_zero_primal_objective = <span class="keyword">false</span>);</div>
|
|
<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"> 80</span> </div>
|
|
<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"> 81</span><span class="comment">// Finds and returns the ConvergenceInformation with the specified</span></div>
|
|
<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"> 82</span><span class="comment">// candidate_type, or absl::nullopt if no such candidate exists.</span></div>
|
|
<div class="line"><a id="l00083" name="l00083"></a><span class="lineno"> 83</span>absl::optional<ConvergenceInformation> <a class="code hl_function" href="namespaceoperations__research_1_1pdlp.html#a7b93e1d980b7d8112423361ac15a0c28">GetConvergenceInformation</a>(</div>
|
|
<div class="line"><a id="l00084" name="l00084"></a><span class="lineno"> 84</span> <span class="keyword">const</span> IterationStats& stats, PointType candidate_type);</div>
|
|
<div class="line"><a id="l00085" name="l00085"></a><span class="lineno"> 85</span> </div>
|
|
<div class="line"><a id="l00086" name="l00086"></a><span class="lineno"> 86</span><span class="comment">// Finds and returns the InfeasibilityInformation with the specified</span></div>
|
|
<div class="line"><a id="l00087" name="l00087"></a><span class="lineno"> 87</span><span class="comment">// candidate_type, or absl::nullopt if no such candidate exists.</span></div>
|
|
<div class="line"><a id="l00088" name="l00088"></a><span class="lineno"> 88</span>absl::optional<InfeasibilityInformation> <a class="code hl_function" href="namespaceoperations__research_1_1pdlp.html#a99ed15089cb2d18e7abb0d146aa5f487">GetInfeasibilityInformation</a>(</div>
|
|
<div class="line"><a id="l00089" name="l00089"></a><span class="lineno"> 89</span> <span class="keyword">const</span> IterationStats& stats, PointType candidate_type);</div>
|
|
<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"> 90</span> </div>
|
|
<div class="line"><a id="l00091" name="l00091"></a><span class="lineno"> 91</span><span class="comment">// Finds and returns the PointMetadata with the specified</span></div>
|
|
<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"> 92</span><span class="comment">// point_type, or absl::nullopt if no such point exists.</span></div>
|
|
<div class="line"><a id="l00093" name="l00093"></a><span class="lineno"> 93</span>absl::optional<PointMetadata> <a class="code hl_function" href="namespaceoperations__research_1_1pdlp.html#a67c368ee96f024040259d5278775c1aa">GetPointMetadata</a>(<span class="keyword">const</span> IterationStats& stats,</div>
|
|
<div class="line"><a id="l00094" name="l00094"></a><span class="lineno"> 94</span> PointType point_type);</div>
|
|
<div class="line"><a id="l00095" name="l00095"></a><span class="lineno"> 95</span> </div>
|
|
<div class="line"><a id="l00096" name="l00096"></a><span class="lineno"> 96</span><span class="comment">// For each entry in random_projection_seeds, computes a random projection of</span></div>
|
|
<div class="line"><a id="l00097" name="l00097"></a><span class="lineno"> 97</span><span class="comment">// the primal/dual solution pair onto pseudo-random vectors generated from that</span></div>
|
|
<div class="line"><a id="l00098" name="l00098"></a><span class="lineno"> 98</span><span class="comment">// seed and adds the results to</span></div>
|
|
<div class="line"><a id="l00099" name="l00099"></a><span class="lineno"> 99</span><span class="comment">// random_primal_projections/random_dual_projections in metadata.</span></div>
|
|
<div class="line"><a id="l00100" name="l00100"></a><span class="lineno"> 100</span><span class="keywordtype">void</span> <a class="code hl_function" href="namespaceoperations__research_1_1pdlp.html#a85cd9828e35e9f00a622d0376bc81325">SetRandomProjections</a>(<span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1pdlp_1_1_sharded_quadratic_program.html">ShardedQuadraticProgram</a>& sharded_qp,</div>
|
|
<div class="line"><a id="l00101" name="l00101"></a><span class="lineno"> 101</span> <span class="keyword">const</span> Eigen::VectorXd& primal_solution,</div>
|
|
<div class="line"><a id="l00102" name="l00102"></a><span class="lineno"> 102</span> <span class="keyword">const</span> Eigen::VectorXd& dual_solution,</div>
|
|
<div class="line"><a id="l00103" name="l00103"></a><span class="lineno"> 103</span> <span class="keyword">const</span> std::vector<int>& random_projection_seeds,</div>
|
|
<div class="line"><a id="l00104" name="l00104"></a><span class="lineno"> 104</span> PointMetadata& metadata);</div>
|
|
<div class="line"><a id="l00105" name="l00105"></a><span class="lineno"> 105</span> </div>
|
|
<div class="line"><a id="l00106" name="l00106"></a><span class="lineno"> 106</span>} <span class="comment">// namespace operations_research::pdlp</span></div>
|
|
<div class="line"><a id="l00107" name="l00107"></a><span class="lineno"> 107</span> </div>
|
|
<div class="line"><a id="l00108" name="l00108"></a><span class="lineno"> 108</span><span class="preprocessor">#endif </span><span class="comment">// PDLP_ITERATION_STATS_H_</span></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1pdlp_1_1_sharded_quadratic_program_html"><div class="ttname"><a href="classoperations__research_1_1pdlp_1_1_sharded_quadratic_program.html">operations_research::pdlp::ShardedQuadraticProgram</a></div><div class="ttdef"><b>Definition:</b> <a href="sharded__quadratic__program_8h_source.html#l00033">sharded_quadratic_program.h:33</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1pdlp_html"><div class="ttname"><a href="namespaceoperations__research_1_1pdlp.html">operations_research::pdlp</a></div><div class="ttdef"><b>Definition:</b> <a href="iteration__stats_8cc_source.html#l00040">iteration_stats.cc:40</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1pdlp_html_a31aa44a967ce3e99c705e97da796aea0"><div class="ttname"><a href="namespaceoperations__research_1_1pdlp.html#a31aa44a967ce3e99c705e97da796aea0">operations_research::pdlp::ComputeScaledConvergenceInformation</a></div><div class="ttdeci">ConvergenceInformation ComputeScaledConvergenceInformation(const ShardedQuadraticProgram &sharded_qp, const VectorXd &primal_solution, const VectorXd &dual_solution, PointType candidate_type)</div><div class="ttdef"><b>Definition:</b> <a href="iteration__stats_8cc_source.html#l00465">iteration_stats.cc:465</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1pdlp_html_a64bfea523f69cba6f7be8ac302c18f2f"><div class="ttname"><a href="namespaceoperations__research_1_1pdlp.html#a64bfea523f69cba6f7be8ac302c18f2f">operations_research::pdlp::ReducedCosts</a></div><div class="ttdeci">VectorXd ReducedCosts(const ShardedQuadraticProgram &sharded_qp, const VectorXd &primal_solution, const VectorXd &dual_solution, bool use_zero_primal_objective)</div><div class="ttdef"><b>Definition:</b> <a href="iteration__stats_8cc_source.html#l00474">iteration_stats.cc:474</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1pdlp_html_a67c368ee96f024040259d5278775c1aa"><div class="ttname"><a href="namespaceoperations__research_1_1pdlp.html#a67c368ee96f024040259d5278775c1aa">operations_research::pdlp::GetPointMetadata</a></div><div class="ttdeci">absl::optional< PointMetadata > GetPointMetadata(const IterationStats &stats, const PointType point_type)</div><div class="ttdef"><b>Definition:</b> <a href="iteration__stats_8cc_source.html#l00528">iteration_stats.cc:528</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1pdlp_html_a74af5ceb7b6e37fbfca92e2c59b99e3e"><div class="ttname"><a href="namespaceoperations__research_1_1pdlp.html#a74af5ceb7b6e37fbfca92e2c59b99e3e">operations_research::pdlp::ComputeInfeasibilityInformation</a></div><div class="ttdeci">InfeasibilityInformation ComputeInfeasibilityInformation(const ShardedQuadraticProgram &scaled_sharded_qp, const Eigen::VectorXd &col_scaling_vec, const Eigen::VectorXd &row_scaling_vec, const Eigen::VectorXd &scaled_primal_ray, const Eigen::VectorXd &scaled_dual_ray, PointType candidate_type)</div><div class="ttdef"><b>Definition:</b> <a href="iteration__stats_8cc_source.html#l00372">iteration_stats.cc:372</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1pdlp_html_a7b93e1d980b7d8112423361ac15a0c28"><div class="ttname"><a href="namespaceoperations__research_1_1pdlp.html#a7b93e1d980b7d8112423361ac15a0c28">operations_research::pdlp::GetConvergenceInformation</a></div><div class="ttdeci">absl::optional< ConvergenceInformation > GetConvergenceInformation(const IterationStats &stats, PointType candidate_type)</div><div class="ttdef"><b>Definition:</b> <a href="iteration__stats_8cc_source.html#l00507">iteration_stats.cc:507</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1pdlp_html_a85cd9828e35e9f00a622d0376bc81325"><div class="ttname"><a href="namespaceoperations__research_1_1pdlp.html#a85cd9828e35e9f00a622d0376bc81325">operations_research::pdlp::SetRandomProjections</a></div><div class="ttdeci">void SetRandomProjections(const ShardedQuadraticProgram &sharded_qp, const Eigen::VectorXd &primal_solution, const Eigen::VectorXd &dual_solution, const std::vector< int > &random_projection_seeds, PointMetadata &metadata)</div><div class="ttdef"><b>Definition:</b> <a href="iteration__stats_8cc_source.html#l00538">iteration_stats.cc:538</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1pdlp_html_a99ed15089cb2d18e7abb0d146aa5f487"><div class="ttname"><a href="namespaceoperations__research_1_1pdlp.html#a99ed15089cb2d18e7abb0d146aa5f487">operations_research::pdlp::GetInfeasibilityInformation</a></div><div class="ttdeci">absl::optional< InfeasibilityInformation > GetInfeasibilityInformation(const IterationStats &stats, PointType candidate_type)</div><div class="ttdef"><b>Definition:</b> <a href="iteration__stats_8cc_source.html#l00517">iteration_stats.cc:517</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1pdlp_html_ac77694ebaac0adfa0fce8422782c48c8"><div class="ttname"><a href="namespaceoperations__research_1_1pdlp.html#ac77694ebaac0adfa0fce8422782c48c8">operations_research::pdlp::ComputeConvergenceInformation</a></div><div class="ttdeci">ConvergenceInformation ComputeConvergenceInformation(const ShardedQuadraticProgram &scaled_sharded_qp, const Eigen::VectorXd &col_scaling_vec, const Eigen::VectorXd &row_scaling_vec, const Eigen::VectorXd &scaled_primal_solution, const Eigen::VectorXd &scaled_dual_solution, PointType candidate_type)</div><div class="ttdef"><b>Definition:</b> <a href="iteration__stats_8cc_source.html#l00308">iteration_stats.cc:308</a></div></div>
|
|
<div class="ttc" id="asharded__quadratic__program_8h_html"><div class="ttname"><a href="sharded__quadratic__program_8h.html">sharded_quadratic_program.h</a></div></div>
|
|
</div><!-- fragment --></div><!-- contents -->
|
|
</div><!-- doc-content -->
|
|
<!-- HTML footer for doxygen 1.8.18-->
|
|
<!-- start footer part -->
|
|
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
|
|
<ul>
|
|
<li class="navelem"><a class="el" href="dir_a7cc1eeded8f693d0da6c729bc88c45a.html">ortools</a></li><li class="navelem"><a class="el" href="dir_7cc48880791e3dd695dbfc2349101d28.html">pdlp</a></li><li class="navelem"><a class="el" href="iteration__stats_8h.html">iteration_stats.h</a></li>
|
|
<li class="footer">Generated by
|
|
<a href="http://www.doxygen.org/index.html">
|
|
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.9.3 </li>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|