404 lines
57 KiB
HTML
404 lines
57 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_test.cc 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__test_8cc_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_test.cc</div></div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="iteration__stats__test_8cc.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">#include "<a class="code" href="iteration__stats_8h.html">ortools/pdlp/iteration_stats.h</a>"</span></div>
|
|
<div class="line"><a id="l00015" name="l00015"></a><span class="lineno"> 15</span> </div>
|
|
<div class="line"><a id="l00016" name="l00016"></a><span class="lineno"> 16</span><span class="preprocessor">#include <cmath></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 <utility></span></div>
|
|
<div class="line"><a id="l00019" name="l00019"></a><span class="lineno"> 19</span> </div>
|
|
<div class="line"><a id="l00020" name="l00020"></a><span class="lineno"> 20</span><span class="preprocessor">#include "Eigen/Core"</span></div>
|
|
<div class="line"><a id="l00021" name="l00021"></a><span class="lineno"> 21</span><span class="preprocessor">#include "absl/types/optional.h"</span></div>
|
|
<div class="line"><a id="l00022" name="l00022"></a><span class="lineno"> 22</span><span class="preprocessor">#include "gmock/gmock.h"</span></div>
|
|
<div class="line"><a id="l00023" name="l00023"></a><span class="lineno"> 23</span><span class="preprocessor">#include "gtest/gtest.h"</span></div>
|
|
<div class="line"><a id="l00024" name="l00024"></a><span class="lineno"> 24</span><span class="preprocessor">#include "<a class="code" href="protobuf__util_8h.html">ortools/base/protobuf_util.h</a>"</span></div>
|
|
<div class="line"><a id="l00025" name="l00025"></a><span class="lineno"> 25</span><span class="preprocessor">#include "<a class="code" href="quadratic__program_8h.html">ortools/pdlp/quadratic_program.h</a>"</span></div>
|
|
<div class="line"><a id="l00026" name="l00026"></a><span class="lineno"> 26</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="l00027" name="l00027"></a><span class="lineno"> 27</span><span class="preprocessor">#include "ortools/pdlp/solve_log.pb.h"</span></div>
|
|
<div class="line"><a id="l00028" name="l00028"></a><span class="lineno"> 28</span><span class="preprocessor">#include "<a class="code" href="test__util_8h.html">ortools/pdlp/test_util.h</a>"</span></div>
|
|
<div class="line"><a id="l00029" name="l00029"></a><span class="lineno"> 29</span> </div>
|
|
<div class="line"><a id="l00030" name="l00030"></a><span class="lineno"> 30</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="l00031" name="l00031"></a><span class="lineno"> 31</span><span class="keyword">namespace </span>{</div>
|
|
<div class="line"><a id="l00032" name="l00032"></a><span class="lineno"> 32</span> </div>
|
|
<div class="line"><a id="l00033" name="l00033"></a><span class="lineno"> 33</span><a class="code hl_function" href="namespacegoogle_1_1protobuf_1_1util.html#ad0ab08de6aa2b7160fbd23962859da9d">using ::google::protobuf::util::ParseTextOrDie</a>;</div>
|
|
<div class="line"><a id="l00034" name="l00034"></a><span class="lineno"> 34</span> </div>
|
|
<div class="line"><a id="l00035" name="l00035"></a><span class="lineno"> 35</span>using ::testing::AllOf;</div>
|
|
<div class="line"><a id="l00036" name="l00036"></a><span class="lineno"> 36</span>using ::testing::Each;</div>
|
|
<div class="line"><a id="l00037" name="l00037"></a><span class="lineno"> 37</span>using ::testing::ElementsAre;</div>
|
|
<div class="line"><a id="l00038" name="l00038"></a><span class="lineno"> 38</span>using ::testing::Eq;</div>
|
|
<div class="line"><a id="l00039" name="l00039"></a><span class="lineno"> 39</span>using ::testing::Ge;</div>
|
|
<div class="line"><a id="l00040" name="l00040"></a><span class="lineno"> 40</span>using ::testing::Le;</div>
|
|
<div class="line"><a id="l00041" name="l00041"></a><span class="lineno"> 41</span>using ::testing::Ne;</div>
|
|
<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"> 42</span>using ::testing::SizeIs;</div>
|
|
<div class="line"><a id="l00043" name="l00043"></a><span class="lineno"> 43</span> </div>
|
|
<div class="line"><a id="l00044" name="l00044"></a><span class="lineno"> 44</span><a class="code hl_function" href="namespaceoperations__research.html#a817553ad64738460e5c339f24fe5ea13">TEST</a>(CorrectedDualTest, SimpleLpWithSuboptimalDual) {</div>
|
|
<div class="line"><a id="l00045" name="l00045"></a><span class="lineno"> 45</span> <span class="keyword">const</span> <span class="keywordtype">int</span> num_threads = 2;</div>
|
|
<div class="line"><a id="l00046" name="l00046"></a><span class="lineno"> 46</span> <span class="keyword">const</span> <span class="keywordtype">int</span> num_shards = 10;</div>
|
|
<div class="line"><a id="l00047" name="l00047"></a><span class="lineno"> 47</span> ShardedQuadraticProgram sharded_qp(<a class="code hl_function" href="namespaceoperations__research_1_1pdlp.html#ad795f23e2a85f4ae05efa1e2d0e0de4d">TestLp</a>(), num_threads, num_shards);</div>
|
|
<div class="line"><a id="l00048" name="l00048"></a><span class="lineno"> 48</span> </div>
|
|
<div class="line"><a id="l00049" name="l00049"></a><span class="lineno"> 49</span> Eigen::VectorXd primal_solution(4), dual_solution(4);</div>
|
|
<div class="line"><a id="l00050" name="l00050"></a><span class="lineno"> 50</span> <span class="comment">// Set the primal variables that have primal gradients at their bounds, so</span></div>
|
|
<div class="line"><a id="l00051" name="l00051"></a><span class="lineno"> 51</span> <span class="comment">// that the primal gradients are reduced costs.</span></div>
|
|
<div class="line"><a id="l00052" name="l00052"></a><span class="lineno"> 52</span> primal_solution << 0, 0, 6, 2.5;</div>
|
|
<div class="line"><a id="l00053" name="l00053"></a><span class="lineno"> 53</span> dual_solution << -2, 0, 2.375, 1;</div>
|
|
<div class="line"><a id="l00054" name="l00054"></a><span class="lineno"> 54</span> <span class="keyword">const</span> ConvergenceInformation stats = <a class="code hl_function" href="namespaceoperations__research_1_1pdlp.html#a31aa44a967ce3e99c705e97da796aea0">ComputeScaledConvergenceInformation</a>(</div>
|
|
<div class="line"><a id="l00055" name="l00055"></a><span class="lineno"> 55</span> sharded_qp, primal_solution, dual_solution, POINT_TYPE_CURRENT_ITERATE);</div>
|
|
<div class="line"><a id="l00056" name="l00056"></a><span class="lineno"> 56</span> <span class="comment">// -36.5 = -14 - 24 - 9.5 - 1 - 3 + 15</span></div>
|
|
<div class="line"><a id="l00057" name="l00057"></a><span class="lineno"> 57</span> EXPECT_DOUBLE_EQ(stats.dual_objective(), -36.5);</div>
|
|
<div class="line"><a id="l00058" name="l00058"></a><span class="lineno"> 58</span> EXPECT_DOUBLE_EQ(stats.corrected_dual_objective(), -36.5);</div>
|
|
<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"> 59</span>}</div>
|
|
<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"> 60</span> </div>
|
|
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"> 61</span><span class="comment">// This is similar to SimpleLpWithSuboptimalDual, except with</span></div>
|
|
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"> 62</span><span class="comment">// x_2 = 2. In the dual correction calculation, the corresponding bound is 6, so</span></div>
|
|
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"> 63</span><span class="comment">// the primal gradient will be treated as a residual of 0.5 instead of a dual</span></div>
|
|
<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"> 64</span><span class="comment">// correction of -3, but in the corrected dual objective it is still treated as</span></div>
|
|
<div class="line"><a id="l00065" name="l00065"></a><span class="lineno"> 65</span><span class="comment">// a dual correction.</span></div>
|
|
<div class="line"><a id="l00066" name="l00066"></a><span class="lineno"> 66</span><a class="code hl_function" href="namespaceoperations__research.html#a817553ad64738460e5c339f24fe5ea13">TEST</a>(CorrectedDualTest, SimpleLpWithVariableFarFromBound) {</div>
|
|
<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"> 67</span> <span class="keyword">const</span> <span class="keywordtype">int</span> num_threads = 2;</div>
|
|
<div class="line"><a id="l00068" name="l00068"></a><span class="lineno"> 68</span> <span class="keyword">const</span> <span class="keywordtype">int</span> num_shards = 10;</div>
|
|
<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"> 69</span> ShardedQuadraticProgram sharded_qp(<a class="code hl_function" href="namespaceoperations__research_1_1pdlp.html#ad795f23e2a85f4ae05efa1e2d0e0de4d">TestLp</a>(), num_threads, num_shards);</div>
|
|
<div class="line"><a id="l00070" name="l00070"></a><span class="lineno"> 70</span> </div>
|
|
<div class="line"><a id="l00071" name="l00071"></a><span class="lineno"> 71</span> Eigen::VectorXd primal_solution(4), dual_solution(4);</div>
|
|
<div class="line"><a id="l00072" name="l00072"></a><span class="lineno"> 72</span> primal_solution << 0, 0, 2, 2.5;</div>
|
|
<div class="line"><a id="l00073" name="l00073"></a><span class="lineno"> 73</span> dual_solution << -2, 0, 2.375, 1;</div>
|
|
<div class="line"><a id="l00074" name="l00074"></a><span class="lineno"> 74</span> <span class="keyword">const</span> ConvergenceInformation stats = <a class="code hl_function" href="namespaceoperations__research_1_1pdlp.html#a31aa44a967ce3e99c705e97da796aea0">ComputeScaledConvergenceInformation</a>(</div>
|
|
<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"> 75</span> sharded_qp, primal_solution, dual_solution, POINT_TYPE_CURRENT_ITERATE);</div>
|
|
<div class="line"><a id="l00076" name="l00076"></a><span class="lineno"> 76</span> <span class="comment">// -33.5 = -14 - 24 - 9.5 - 1 + 15</span></div>
|
|
<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"> 77</span> EXPECT_DOUBLE_EQ(stats.dual_objective(), -33.5);</div>
|
|
<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"> 78</span> EXPECT_DOUBLE_EQ(stats.corrected_dual_objective(), -36.5);</div>
|
|
<div class="line"><a id="l00079" name="l00079"></a><span class="lineno"> 79</span> EXPECT_DOUBLE_EQ(stats.l_inf_dual_residual(), 0.5);</div>
|
|
<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"> 80</span> EXPECT_DOUBLE_EQ(stats.l2_dual_residual(), 0.5);</div>
|
|
<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"> 81</span>}</div>
|
|
<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"> 82</span> </div>
|
|
<div class="line"><a id="l00083" name="l00083"></a><span class="lineno"> 83</span><a class="code hl_function" href="namespaceoperations__research.html#a817553ad64738460e5c339f24fe5ea13">TEST</a>(CorrectedDualObjective, QpSuboptimal) {</div>
|
|
<div class="line"><a id="l00084" name="l00084"></a><span class="lineno"> 84</span> <span class="keyword">const</span> <span class="keywordtype">int</span> num_threads = 2;</div>
|
|
<div class="line"><a id="l00085" name="l00085"></a><span class="lineno"> 85</span> <span class="keyword">const</span> <span class="keywordtype">int</span> num_shards = 10;</div>
|
|
<div class="line"><a id="l00086" name="l00086"></a><span class="lineno"> 86</span> ShardedQuadraticProgram sharded_qp(<a class="code hl_function" href="namespaceoperations__research_1_1pdlp.html#afaedaf1e3ebe4d6d1a36e3fd1f206de6">TestDiagonalQp1</a>(), num_threads,</div>
|
|
<div class="line"><a id="l00087" name="l00087"></a><span class="lineno"> 87</span> num_shards);</div>
|
|
<div class="line"><a id="l00088" name="l00088"></a><span class="lineno"> 88</span> </div>
|
|
<div class="line"><a id="l00089" name="l00089"></a><span class="lineno"> 89</span> Eigen::VectorXd primal_solution(2), dual_solution(1);</div>
|
|
<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"> 90</span> dual_solution << -3;</div>
|
|
<div class="line"><a id="l00091" name="l00091"></a><span class="lineno"> 91</span> primal_solution << -2.0, 2.0;</div>
|
|
<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"> 92</span> <span class="keyword">const</span> ConvergenceInformation stats = <a class="code hl_function" href="namespaceoperations__research_1_1pdlp.html#a31aa44a967ce3e99c705e97da796aea0">ComputeScaledConvergenceInformation</a>(</div>
|
|
<div class="line"><a id="l00093" name="l00093"></a><span class="lineno"> 93</span> sharded_qp, primal_solution, dual_solution, POINT_TYPE_CURRENT_ITERATE);</div>
|
|
<div class="line"><a id="l00094" name="l00094"></a><span class="lineno"> 94</span> <span class="comment">// primal gradient vector: [-6, 4]</span></div>
|
|
<div class="line"><a id="l00095" name="l00095"></a><span class="lineno"> 95</span> <span class="comment">// Constant term: 5</span></div>
|
|
<div class="line"><a id="l00096" name="l00096"></a><span class="lineno"> 96</span> <span class="comment">// Quadratic term: -(16+4)/2 = -10</span></div>
|
|
<div class="line"><a id="l00097" name="l00097"></a><span class="lineno"> 97</span> <span class="comment">// Dual objective term: -3 * 1</span></div>
|
|
<div class="line"><a id="l00098" name="l00098"></a><span class="lineno"> 98</span> <span class="comment">// Primal variables at bounds term: 2*-6 + -2*4 = -20</span></div>
|
|
<div class="line"><a id="l00099" name="l00099"></a><span class="lineno"> 99</span> <span class="comment">// -28.0 = 5 - 10 - 3 - 20</span></div>
|
|
<div class="line"><a id="l00100" name="l00100"></a><span class="lineno"> 100</span> EXPECT_DOUBLE_EQ(stats.corrected_dual_objective(), -28.0);</div>
|
|
<div class="line"><a id="l00101" name="l00101"></a><span class="lineno"> 101</span>}</div>
|
|
<div class="line"><a id="l00102" name="l00102"></a><span class="lineno"> 102</span> </div>
|
|
<div class="line"><a id="l00103" name="l00103"></a><span class="lineno"> 103</span><a class="code hl_function" href="namespaceoperations__research.html#a817553ad64738460e5c339f24fe5ea13">TEST</a>(RandomProjectionsTest, OneRandomProjectionsOfZeroVector) {</div>
|
|
<div class="line"><a id="l00104" name="l00104"></a><span class="lineno"> 104</span> <span class="keyword">const</span> <span class="keywordtype">int</span> num_threads = 2;</div>
|
|
<div class="line"><a id="l00105" name="l00105"></a><span class="lineno"> 105</span> <span class="keyword">const</span> <span class="keywordtype">int</span> num_shards = 10;</div>
|
|
<div class="line"><a id="l00106" name="l00106"></a><span class="lineno"> 106</span> ShardedQuadraticProgram sharded_qp(<a class="code hl_function" href="namespaceoperations__research_1_1pdlp.html#ad795f23e2a85f4ae05efa1e2d0e0de4d">TestLp</a>(), num_threads, num_shards);</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> PointMetadata metadata;</div>
|
|
<div class="line"><a id="l00109" name="l00109"></a><span class="lineno"> 109</span> <a class="code hl_function" href="namespaceoperations__research_1_1pdlp.html#a85cd9828e35e9f00a622d0376bc81325">SetRandomProjections</a>(sharded_qp, <span class="comment">/*primal_solution=*/</span><a class="code hl_function" href="namespaceoperations__research.html#a5a9881f8a07b166ef2cbde572cea27b6">Eigen::VectorXd::Zero</a>(4),</div>
|
|
<div class="line"><a id="l00110" name="l00110"></a><span class="lineno"> 110</span> <span class="comment">/*dual_solution=*/</span><a class="code hl_function" href="namespaceoperations__research.html#a5a9881f8a07b166ef2cbde572cea27b6">Eigen::VectorXd::Zero</a>(4),</div>
|
|
<div class="line"><a id="l00111" name="l00111"></a><span class="lineno"> 111</span> <span class="comment">/*random_projection_seeds=*/</span>{1}, metadata);</div>
|
|
<div class="line"><a id="l00112" name="l00112"></a><span class="lineno"> 112</span> EXPECT_THAT(metadata.random_primal_projections(), ElementsAre(0.0));</div>
|
|
<div class="line"><a id="l00113" name="l00113"></a><span class="lineno"> 113</span> EXPECT_THAT(metadata.random_dual_projections(), ElementsAre(0.0));</div>
|
|
<div class="line"><a id="l00114" name="l00114"></a><span class="lineno"> 114</span>}</div>
|
|
<div class="line"><a id="l00115" name="l00115"></a><span class="lineno"> 115</span> </div>
|
|
<div class="line"><a id="l00116" name="l00116"></a><span class="lineno"> 116</span><a class="code hl_function" href="namespaceoperations__research.html#a817553ad64738460e5c339f24fe5ea13">TEST</a>(RandomProjectionsTest, TwoRandomProjectionsOfVector) {</div>
|
|
<div class="line"><a id="l00117" name="l00117"></a><span class="lineno"> 117</span> <span class="keyword">const</span> <span class="keywordtype">int</span> num_threads = 2;</div>
|
|
<div class="line"><a id="l00118" name="l00118"></a><span class="lineno"> 118</span> <span class="keyword">const</span> <span class="keywordtype">int</span> num_shards = 10;</div>
|
|
<div class="line"><a id="l00119" name="l00119"></a><span class="lineno"> 119</span> ShardedQuadraticProgram sharded_qp(<a class="code hl_function" href="namespaceoperations__research_1_1pdlp.html#ad795f23e2a85f4ae05efa1e2d0e0de4d">TestLp</a>(), num_threads, num_shards);</div>
|
|
<div class="line"><a id="l00120" name="l00120"></a><span class="lineno"> 120</span> </div>
|
|
<div class="line"><a id="l00121" name="l00121"></a><span class="lineno"> 121</span> PointMetadata metadata;</div>
|
|
<div class="line"><a id="l00122" name="l00122"></a><span class="lineno"> 122</span> <a class="code hl_function" href="namespaceoperations__research_1_1pdlp.html#a85cd9828e35e9f00a622d0376bc81325">SetRandomProjections</a>(sharded_qp, <span class="comment">/*primal_solution=*/</span>Eigen::VectorXd::Ones(4),</div>
|
|
<div class="line"><a id="l00123" name="l00123"></a><span class="lineno"> 123</span> <span class="comment">/*dual_solution=*/</span><a class="code hl_function" href="namespaceoperations__research.html#a5a9881f8a07b166ef2cbde572cea27b6">Eigen::VectorXd::Zero</a>(4),</div>
|
|
<div class="line"><a id="l00124" name="l00124"></a><span class="lineno"> 124</span> <span class="comment">/*random_projection_seeds=*/</span>{1, 2}, metadata);</div>
|
|
<div class="line"><a id="l00125" name="l00125"></a><span class="lineno"> 125</span> EXPECT_THAT(metadata.random_primal_projections(), SizeIs(2));</div>
|
|
<div class="line"><a id="l00126" name="l00126"></a><span class="lineno"> 126</span> EXPECT_THAT(metadata.random_dual_projections(), SizeIs(2));</div>
|
|
<div class="line"><a id="l00127" name="l00127"></a><span class="lineno"> 127</span> <span class="comment">// The primal solution has norm 2; the random projection should only reduce</span></div>
|
|
<div class="line"><a id="l00128" name="l00128"></a><span class="lineno"> 128</span> <span class="comment">// the norm. Obtaining 0.0 is a probability-zero event.</span></div>
|
|
<div class="line"><a id="l00129" name="l00129"></a><span class="lineno"> 129</span> EXPECT_THAT(metadata.random_primal_projections(),</div>
|
|
<div class="line"><a id="l00130" name="l00130"></a><span class="lineno"> 130</span> Each(AllOf(Ge(-2.0), Le(2.0), Ne(0.0))));</div>
|
|
<div class="line"><a id="l00131" name="l00131"></a><span class="lineno"> 131</span> EXPECT_THAT(metadata.random_dual_projections(), Each(Eq(0.0)));</div>
|
|
<div class="line"><a id="l00132" name="l00132"></a><span class="lineno"> 132</span>}</div>
|
|
<div class="line"><a id="l00133" name="l00133"></a><span class="lineno"> 133</span> </div>
|
|
<div class="line"><a id="l00134" name="l00134"></a><span class="lineno"> 134</span><a class="code hl_function" href="namespaceoperations__research.html#a817553ad64738460e5c339f24fe5ea13">TEST</a>(ReducedCostsTest, SimpleLp) {</div>
|
|
<div class="line"><a id="l00135" name="l00135"></a><span class="lineno"> 135</span> <span class="keyword">const</span> <span class="keywordtype">int</span> num_threads = 2;</div>
|
|
<div class="line"><a id="l00136" name="l00136"></a><span class="lineno"> 136</span> <span class="keyword">const</span> <span class="keywordtype">int</span> num_shards = 10;</div>
|
|
<div class="line"><a id="l00137" name="l00137"></a><span class="lineno"> 137</span> ShardedQuadraticProgram sharded_qp(<a class="code hl_function" href="namespaceoperations__research_1_1pdlp.html#ad795f23e2a85f4ae05efa1e2d0e0de4d">TestLp</a>(), num_threads, num_shards);</div>
|
|
<div class="line"><a id="l00138" name="l00138"></a><span class="lineno"> 138</span> </div>
|
|
<div class="line"><a id="l00139" name="l00139"></a><span class="lineno"> 139</span> Eigen::VectorXd primal_solution(4), dual_solution(4);</div>
|
|
<div class="line"><a id="l00140" name="l00140"></a><span class="lineno"> 140</span> <span class="comment">// Use a primal solution at the relevant bounds, to ensure handling as</span></div>
|
|
<div class="line"><a id="l00141" name="l00141"></a><span class="lineno"> 141</span> <span class="comment">// reduced costs.</span></div>
|
|
<div class="line"><a id="l00142" name="l00142"></a><span class="lineno"> 142</span> primal_solution << 0.0, -2.0, 6.0, 3.5;</div>
|
|
<div class="line"><a id="l00143" name="l00143"></a><span class="lineno"> 143</span> dual_solution << 1.0, 0.0, 0.0, -2.0;</div>
|
|
<div class="line"><a id="l00144" name="l00144"></a><span class="lineno"> 144</span> <span class="comment">// c is: [5.5, -2, -1, 1]</span></div>
|
|
<div class="line"><a id="l00145" name="l00145"></a><span class="lineno"> 145</span> <span class="comment">// -A'y is: [-2, -1, 2, -4]</span></div>
|
|
<div class="line"><a id="l00146" name="l00146"></a><span class="lineno"> 146</span> <span class="comment">// c - A'y is: [3.5, -3.0, 1.0, -3.0].</span></div>
|
|
<div class="line"><a id="l00147" name="l00147"></a><span class="lineno"> 147</span> EXPECT_THAT(<a class="code hl_function" href="namespaceoperations__research_1_1pdlp.html#a64bfea523f69cba6f7be8ac302c18f2f">ReducedCosts</a>(sharded_qp, primal_solution, dual_solution),</div>
|
|
<div class="line"><a id="l00148" name="l00148"></a><span class="lineno"> 148</span> ElementsAre(0.0, 0.0, 0.0, -3.0));</div>
|
|
<div class="line"><a id="l00149" name="l00149"></a><span class="lineno"> 149</span> EXPECT_THAT(<a class="code hl_function" href="namespaceoperations__research_1_1pdlp.html#a64bfea523f69cba6f7be8ac302c18f2f">ReducedCosts</a>(sharded_qp, primal_solution, dual_solution,</div>
|
|
<div class="line"><a id="l00150" name="l00150"></a><span class="lineno"> 150</span> <span class="comment">/*use_zero_primal_objective=*/</span><span class="keyword">true</span>),</div>
|
|
<div class="line"><a id="l00151" name="l00151"></a><span class="lineno"> 151</span> ElementsAre(0.0, 0.0, 0.0, -4.0));</div>
|
|
<div class="line"><a id="l00152" name="l00152"></a><span class="lineno"> 152</span>}</div>
|
|
<div class="line"><a id="l00153" name="l00153"></a><span class="lineno"> 153</span> </div>
|
|
<div class="line"><a id="l00154" name="l00154"></a><span class="lineno"> 154</span><a class="code hl_function" href="namespaceoperations__research.html#a817553ad64738460e5c339f24fe5ea13">TEST</a>(ReducedCostsTest, SimpleLpWithGapResiduals) {</div>
|
|
<div class="line"><a id="l00155" name="l00155"></a><span class="lineno"> 155</span> <span class="keyword">const</span> <span class="keywordtype">int</span> num_threads = 2;</div>
|
|
<div class="line"><a id="l00156" name="l00156"></a><span class="lineno"> 156</span> <span class="keyword">const</span> <span class="keywordtype">int</span> num_shards = 10;</div>
|
|
<div class="line"><a id="l00157" name="l00157"></a><span class="lineno"> 157</span> ShardedQuadraticProgram sharded_qp(<a class="code hl_function" href="namespaceoperations__research_1_1pdlp.html#ad795f23e2a85f4ae05efa1e2d0e0de4d">TestLp</a>(), num_threads, num_shards);</div>
|
|
<div class="line"><a id="l00158" name="l00158"></a><span class="lineno"> 158</span> </div>
|
|
<div class="line"><a id="l00159" name="l00159"></a><span class="lineno"> 159</span> Eigen::VectorXd primal_solution(4), dual_solution(4);</div>
|
|
<div class="line"><a id="l00160" name="l00160"></a><span class="lineno"> 160</span> primal_solution = <a class="code hl_function" href="namespaceoperations__research.html#a5a9881f8a07b166ef2cbde572cea27b6">Eigen::VectorXd::Zero</a>(4);</div>
|
|
<div class="line"><a id="l00161" name="l00161"></a><span class="lineno"> 161</span> dual_solution << 1.0, 0.0, 0.0, -1.0;</div>
|
|
<div class="line"><a id="l00162" name="l00162"></a><span class="lineno"> 162</span> <span class="comment">// c is: [5.5, -2, -1, 1]</span></div>
|
|
<div class="line"><a id="l00163" name="l00163"></a><span class="lineno"> 163</span> <span class="comment">// -A'y is: [-2, -1, 0.5, -3]</span></div>
|
|
<div class="line"><a id="l00164" name="l00164"></a><span class="lineno"> 164</span> <span class="comment">// c - A'y is: [3.5, -3.0, -0.5, -2.0].</span></div>
|
|
<div class="line"><a id="l00165" name="l00165"></a><span class="lineno"> 165</span> <span class="comment">// When the primal variable is 0.0 and the bound is not 0.0, the c - A'y is</span></div>
|
|
<div class="line"><a id="l00166" name="l00166"></a><span class="lineno"> 166</span> <span class="comment">// always handled as a residual.</span></div>
|
|
<div class="line"><a id="l00167" name="l00167"></a><span class="lineno"> 167</span> EXPECT_THAT(<a class="code hl_function" href="namespaceoperations__research_1_1pdlp.html#a64bfea523f69cba6f7be8ac302c18f2f">ReducedCosts</a>(sharded_qp, primal_solution, dual_solution),</div>
|
|
<div class="line"><a id="l00168" name="l00168"></a><span class="lineno"> 168</span> ElementsAre(0.0, 0.0, 0.0, 0.0));</div>
|
|
<div class="line"><a id="l00169" name="l00169"></a><span class="lineno"> 169</span> <span class="comment">// If the primal variables are closer to the bound, c - A'y is handled as a</span></div>
|
|
<div class="line"><a id="l00170" name="l00170"></a><span class="lineno"> 170</span> <span class="comment">// reduced cost.</span></div>
|
|
<div class="line"><a id="l00171" name="l00171"></a><span class="lineno"> 171</span> primal_solution << 0.0, 0.0, 4.0, 3.0;</div>
|
|
<div class="line"><a id="l00172" name="l00172"></a><span class="lineno"> 172</span> EXPECT_THAT(<a class="code hl_function" href="namespaceoperations__research_1_1pdlp.html#a64bfea523f69cba6f7be8ac302c18f2f">ReducedCosts</a>(sharded_qp, primal_solution, dual_solution),</div>
|
|
<div class="line"><a id="l00173" name="l00173"></a><span class="lineno"> 173</span> ElementsAre(0.0, 0.0, -0.5, -2.0));</div>
|
|
<div class="line"><a id="l00174" name="l00174"></a><span class="lineno"> 174</span>}</div>
|
|
<div class="line"><a id="l00175" name="l00175"></a><span class="lineno"> 175</span> </div>
|
|
<div class="line"><a id="l00176" name="l00176"></a><span class="lineno"> 176</span><a class="code hl_function" href="namespaceoperations__research.html#a817553ad64738460e5c339f24fe5ea13">TEST</a>(ReducedCostsTest, SimpleQp) {</div>
|
|
<div class="line"><a id="l00177" name="l00177"></a><span class="lineno"> 177</span> <span class="keyword">const</span> <span class="keywordtype">int</span> num_threads = 2;</div>
|
|
<div class="line"><a id="l00178" name="l00178"></a><span class="lineno"> 178</span> <span class="keyword">const</span> <span class="keywordtype">int</span> num_shards = 10;</div>
|
|
<div class="line"><a id="l00179" name="l00179"></a><span class="lineno"> 179</span> ShardedQuadraticProgram sharded_qp(<a class="code hl_function" href="namespaceoperations__research_1_1pdlp.html#afaedaf1e3ebe4d6d1a36e3fd1f206de6">TestDiagonalQp1</a>(), num_threads,</div>
|
|
<div class="line"><a id="l00180" name="l00180"></a><span class="lineno"> 180</span> num_shards);</div>
|
|
<div class="line"><a id="l00181" name="l00181"></a><span class="lineno"> 181</span> </div>
|
|
<div class="line"><a id="l00182" name="l00182"></a><span class="lineno"> 182</span> Eigen::VectorXd primal_solution(2), dual_solution(1);</div>
|
|
<div class="line"><a id="l00183" name="l00183"></a><span class="lineno"> 183</span> primal_solution << 1.0, 2.0;</div>
|
|
<div class="line"><a id="l00184" name="l00184"></a><span class="lineno"> 184</span> dual_solution << 0.0;</div>
|
|
<div class="line"><a id="l00185" name="l00185"></a><span class="lineno"> 185</span> <span class="comment">// Q*x is: [4.0, 2.0]</span></div>
|
|
<div class="line"><a id="l00186" name="l00186"></a><span class="lineno"> 186</span> <span class="comment">// c is: [-1, -1]</span></div>
|
|
<div class="line"><a id="l00187" name="l00187"></a><span class="lineno"> 187</span> <span class="comment">// A'y is zero.</span></div>
|
|
<div class="line"><a id="l00188" name="l00188"></a><span class="lineno"> 188</span> <span class="comment">// The second primal gradient term is handled as a residual, not a reduced</span></div>
|
|
<div class="line"><a id="l00189" name="l00189"></a><span class="lineno"> 189</span> <span class="comment">// cost.</span></div>
|
|
<div class="line"><a id="l00190" name="l00190"></a><span class="lineno"> 190</span> EXPECT_THAT(<a class="code hl_function" href="namespaceoperations__research_1_1pdlp.html#a64bfea523f69cba6f7be8ac302c18f2f">ReducedCosts</a>(sharded_qp, primal_solution, dual_solution),</div>
|
|
<div class="line"><a id="l00191" name="l00191"></a><span class="lineno"> 191</span> ElementsAre(3.0, 0.0));</div>
|
|
<div class="line"><a id="l00192" name="l00192"></a><span class="lineno"> 192</span> EXPECT_THAT(<a class="code hl_function" href="namespaceoperations__research_1_1pdlp.html#a64bfea523f69cba6f7be8ac302c18f2f">ReducedCosts</a>(sharded_qp, primal_solution, dual_solution,</div>
|
|
<div class="line"><a id="l00193" name="l00193"></a><span class="lineno"> 193</span> <span class="comment">/*use_zero_primal_objective=*/</span><span class="keyword">true</span>),</div>
|
|
<div class="line"><a id="l00194" name="l00194"></a><span class="lineno"> 194</span> ElementsAre(0.0, 0.0));</div>
|
|
<div class="line"><a id="l00195" name="l00195"></a><span class="lineno"> 195</span>}</div>
|
|
<div class="line"><a id="l00196" name="l00196"></a><span class="lineno"> 196</span> </div>
|
|
<div class="line"><a id="l00197" name="l00197"></a><span class="lineno"> 197</span><a class="code hl_function" href="namespaceoperations__research.html#a817553ad64738460e5c339f24fe5ea13">TEST</a>(<a class="code hl_function" href="namespaceoperations__research_1_1pdlp.html#a7b93e1d980b7d8112423361ac15a0c28">GetConvergenceInformation</a>, GetsCorrectEntry) {</div>
|
|
<div class="line"><a id="l00198" name="l00198"></a><span class="lineno"> 198</span> <span class="keyword">const</span> <span class="keyword">auto</span> test_stats = ParseTextOrDie<IterationStats>(R<span class="stringliteral">"pb(</span></div>
|
|
<div class="line"><a id="l00199" name="l00199"></a><span class="lineno"> 199</span><span class="stringliteral"> convergence_information {</span></div>
|
|
<div class="line"><a id="l00200" name="l00200"></a><span class="lineno"> 200</span><span class="stringliteral"> candidate_type: POINT_TYPE_CURRENT_ITERATE</span></div>
|
|
<div class="line"><a id="l00201" name="l00201"></a><span class="lineno"> 201</span><span class="stringliteral"> primal_objective: 1.0</span></div>
|
|
<div class="line"><a id="l00202" name="l00202"></a><span class="lineno"> 202</span><span class="stringliteral"> }</span></div>
|
|
<div class="line"><a id="l00203" name="l00203"></a><span class="lineno"> 203</span><span class="stringliteral"> convergence_information {</span></div>
|
|
<div class="line"><a id="l00204" name="l00204"></a><span class="lineno"> 204</span><span class="stringliteral"> candidate_type: POINT_TYPE_AVERAGE_ITERATE</span></div>
|
|
<div class="line"><a id="l00205" name="l00205"></a><span class="lineno"> 205</span><span class="stringliteral"> primal_objective: 2.0</span></div>
|
|
<div class="line"><a id="l00206" name="l00206"></a><span class="lineno"> 206</span><span class="stringliteral"> }</span></div>
|
|
<div class="line"><a id="l00207" name="l00207"></a><span class="lineno"> 207</span><span class="stringliteral"> )pb");</span></div>
|
|
<div class="line"><a id="l00208" name="l00208"></a><span class="lineno"> 208</span><span class="stringliteral"> </span><span class="keyword">const</span> <span class="keyword">auto</span> average_info =</div>
|
|
<div class="line"><a id="l00209" name="l00209"></a><span class="lineno"> 209</span> <a class="code hl_function" href="namespaceoperations__research_1_1pdlp.html#a7b93e1d980b7d8112423361ac15a0c28">GetConvergenceInformation</a>(test_stats, POINT_TYPE_AVERAGE_ITERATE);</div>
|
|
<div class="line"><a id="l00210" name="l00210"></a><span class="lineno"> 210</span> ASSERT_TRUE(average_info.has_value());</div>
|
|
<div class="line"><a id="l00211" name="l00211"></a><span class="lineno"> 211</span> EXPECT_EQ(average_info->candidate_type(), POINT_TYPE_AVERAGE_ITERATE);</div>
|
|
<div class="line"><a id="l00212" name="l00212"></a><span class="lineno"> 212</span> EXPECT_EQ(average_info->primal_objective(), 2.0);</div>
|
|
<div class="line"><a id="l00213" name="l00213"></a><span class="lineno"> 213</span> </div>
|
|
<div class="line"><a id="l00214" name="l00214"></a><span class="lineno"> 214</span> <span class="keyword">const</span> <span class="keyword">auto</span> current_info =</div>
|
|
<div class="line"><a id="l00215" name="l00215"></a><span class="lineno"> 215</span> <a class="code hl_function" href="namespaceoperations__research_1_1pdlp.html#a7b93e1d980b7d8112423361ac15a0c28">GetConvergenceInformation</a>(test_stats, POINT_TYPE_CURRENT_ITERATE);</div>
|
|
<div class="line"><a id="l00216" name="l00216"></a><span class="lineno"> 216</span> ASSERT_TRUE(current_info.has_value());</div>
|
|
<div class="line"><a id="l00217" name="l00217"></a><span class="lineno"> 217</span> EXPECT_EQ(current_info->candidate_type(), POINT_TYPE_CURRENT_ITERATE);</div>
|
|
<div class="line"><a id="l00218" name="l00218"></a><span class="lineno"> 218</span> EXPECT_EQ(current_info->primal_objective(), 1.0);</div>
|
|
<div class="line"><a id="l00219" name="l00219"></a><span class="lineno"> 219</span> </div>
|
|
<div class="line"><a id="l00220" name="l00220"></a><span class="lineno"> 220</span> EXPECT_THAT(</div>
|
|
<div class="line"><a id="l00221" name="l00221"></a><span class="lineno"> 221</span> <a class="code hl_function" href="namespaceoperations__research_1_1pdlp.html#a7b93e1d980b7d8112423361ac15a0c28">GetConvergenceInformation</a>(test_stats, POINT_TYPE_ITERATE_DIFFERENCE),</div>
|
|
<div class="line"><a id="l00222" name="l00222"></a><span class="lineno"> 222</span> Eq(absl::nullopt));</div>
|
|
<div class="line"><a id="l00223" name="l00223"></a><span class="lineno"> 223</span>}</div>
|
|
<div class="line"><a id="l00224" name="l00224"></a><span class="lineno"> 224</span> </div>
|
|
<div class="line"><a id="l00225" name="l00225"></a><span class="lineno"> 225</span><a class="code hl_function" href="namespaceoperations__research.html#a817553ad64738460e5c339f24fe5ea13">TEST</a>(<a class="code hl_function" href="namespaceoperations__research_1_1pdlp.html#a99ed15089cb2d18e7abb0d146aa5f487">GetInfeasibilityInformation</a>, GetsCorrectEntry) {</div>
|
|
<div class="line"><a id="l00226" name="l00226"></a><span class="lineno"> 226</span> <span class="keyword">const</span> <span class="keyword">auto</span> test_stats = ParseTextOrDie<IterationStats>(R<span class="stringliteral">"pb(</span></div>
|
|
<div class="line"><a id="l00227" name="l00227"></a><span class="lineno"> 227</span><span class="stringliteral"> infeasibility_information {</span></div>
|
|
<div class="line"><a id="l00228" name="l00228"></a><span class="lineno"> 228</span><span class="stringliteral"> candidate_type: POINT_TYPE_CURRENT_ITERATE</span></div>
|
|
<div class="line"><a id="l00229" name="l00229"></a><span class="lineno"> 229</span><span class="stringliteral"> primal_ray_linear_objective: 1.0</span></div>
|
|
<div class="line"><a id="l00230" name="l00230"></a><span class="lineno"> 230</span><span class="stringliteral"> }</span></div>
|
|
<div class="line"><a id="l00231" name="l00231"></a><span class="lineno"> 231</span><span class="stringliteral"> infeasibility_information {</span></div>
|
|
<div class="line"><a id="l00232" name="l00232"></a><span class="lineno"> 232</span><span class="stringliteral"> candidate_type: POINT_TYPE_AVERAGE_ITERATE</span></div>
|
|
<div class="line"><a id="l00233" name="l00233"></a><span class="lineno"> 233</span><span class="stringliteral"> primal_ray_linear_objective: 2.0</span></div>
|
|
<div class="line"><a id="l00234" name="l00234"></a><span class="lineno"> 234</span><span class="stringliteral"> }</span></div>
|
|
<div class="line"><a id="l00235" name="l00235"></a><span class="lineno"> 235</span><span class="stringliteral"> )pb");</span></div>
|
|
<div class="line"><a id="l00236" name="l00236"></a><span class="lineno"> 236</span><span class="stringliteral"> </span><span class="keyword">const</span> <span class="keyword">auto</span> average_info =</div>
|
|
<div class="line"><a id="l00237" name="l00237"></a><span class="lineno"> 237</span> <a class="code hl_function" href="namespaceoperations__research_1_1pdlp.html#a99ed15089cb2d18e7abb0d146aa5f487">GetInfeasibilityInformation</a>(test_stats, POINT_TYPE_AVERAGE_ITERATE);</div>
|
|
<div class="line"><a id="l00238" name="l00238"></a><span class="lineno"> 238</span> ASSERT_TRUE(average_info.has_value());</div>
|
|
<div class="line"><a id="l00239" name="l00239"></a><span class="lineno"> 239</span> EXPECT_EQ(average_info->candidate_type(), POINT_TYPE_AVERAGE_ITERATE);</div>
|
|
<div class="line"><a id="l00240" name="l00240"></a><span class="lineno"> 240</span> EXPECT_EQ(average_info->primal_ray_linear_objective(), 2.0);</div>
|
|
<div class="line"><a id="l00241" name="l00241"></a><span class="lineno"> 241</span> </div>
|
|
<div class="line"><a id="l00242" name="l00242"></a><span class="lineno"> 242</span> <span class="keyword">const</span> <span class="keyword">auto</span> current_info =</div>
|
|
<div class="line"><a id="l00243" name="l00243"></a><span class="lineno"> 243</span> <a class="code hl_function" href="namespaceoperations__research_1_1pdlp.html#a99ed15089cb2d18e7abb0d146aa5f487">GetInfeasibilityInformation</a>(test_stats, POINT_TYPE_CURRENT_ITERATE);</div>
|
|
<div class="line"><a id="l00244" name="l00244"></a><span class="lineno"> 244</span> ASSERT_TRUE(current_info.has_value());</div>
|
|
<div class="line"><a id="l00245" name="l00245"></a><span class="lineno"> 245</span> EXPECT_EQ(current_info->candidate_type(), POINT_TYPE_CURRENT_ITERATE);</div>
|
|
<div class="line"><a id="l00246" name="l00246"></a><span class="lineno"> 246</span> EXPECT_EQ(current_info->primal_ray_linear_objective(), 1.0);</div>
|
|
<div class="line"><a id="l00247" name="l00247"></a><span class="lineno"> 247</span> </div>
|
|
<div class="line"><a id="l00248" name="l00248"></a><span class="lineno"> 248</span> EXPECT_THAT(</div>
|
|
<div class="line"><a id="l00249" name="l00249"></a><span class="lineno"> 249</span> <a class="code hl_function" href="namespaceoperations__research_1_1pdlp.html#a99ed15089cb2d18e7abb0d146aa5f487">GetInfeasibilityInformation</a>(test_stats, POINT_TYPE_ITERATE_DIFFERENCE),</div>
|
|
<div class="line"><a id="l00250" name="l00250"></a><span class="lineno"> 250</span> Eq(absl::nullopt));</div>
|
|
<div class="line"><a id="l00251" name="l00251"></a><span class="lineno"> 251</span>}</div>
|
|
<div class="line"><a id="l00252" name="l00252"></a><span class="lineno"> 252</span> </div>
|
|
<div class="line"><a id="l00253" name="l00253"></a><span class="lineno"> 253</span><a class="code hl_function" href="namespaceoperations__research.html#a817553ad64738460e5c339f24fe5ea13">TEST</a>(<a class="code hl_function" href="namespaceoperations__research_1_1pdlp.html#a67c368ee96f024040259d5278775c1aa">GetPointMetadata</a>, GetsCorrectEntry) {</div>
|
|
<div class="line"><a id="l00254" name="l00254"></a><span class="lineno"> 254</span> <span class="keyword">const</span> <span class="keyword">auto</span> test_stats = ParseTextOrDie<IterationStats>(R<span class="stringliteral">"pb(</span></div>
|
|
<div class="line"><a id="l00255" name="l00255"></a><span class="lineno"> 255</span><span class="stringliteral"> point_metadata {</span></div>
|
|
<div class="line"><a id="l00256" name="l00256"></a><span class="lineno"> 256</span><span class="stringliteral"> point_type: POINT_TYPE_CURRENT_ITERATE</span></div>
|
|
<div class="line"><a id="l00257" name="l00257"></a><span class="lineno"> 257</span><span class="stringliteral"> active_primal_variable_count: 1</span></div>
|
|
<div class="line"><a id="l00258" name="l00258"></a><span class="lineno"> 258</span><span class="stringliteral"> }</span></div>
|
|
<div class="line"><a id="l00259" name="l00259"></a><span class="lineno"> 259</span><span class="stringliteral"> point_metadata {</span></div>
|
|
<div class="line"><a id="l00260" name="l00260"></a><span class="lineno"> 260</span><span class="stringliteral"> point_type: POINT_TYPE_AVERAGE_ITERATE</span></div>
|
|
<div class="line"><a id="l00261" name="l00261"></a><span class="lineno"> 261</span><span class="stringliteral"> active_primal_variable_count: 2</span></div>
|
|
<div class="line"><a id="l00262" name="l00262"></a><span class="lineno"> 262</span><span class="stringliteral"> }</span></div>
|
|
<div class="line"><a id="l00263" name="l00263"></a><span class="lineno"> 263</span><span class="stringliteral"> )pb");</span></div>
|
|
<div class="line"><a id="l00264" name="l00264"></a><span class="lineno"> 264</span><span class="stringliteral"> </span><span class="keyword">const</span> <span class="keyword">auto</span> average_info =</div>
|
|
<div class="line"><a id="l00265" name="l00265"></a><span class="lineno"> 265</span> <a class="code hl_function" href="namespaceoperations__research_1_1pdlp.html#a67c368ee96f024040259d5278775c1aa">GetPointMetadata</a>(test_stats, POINT_TYPE_AVERAGE_ITERATE);</div>
|
|
<div class="line"><a id="l00266" name="l00266"></a><span class="lineno"> 266</span> ASSERT_TRUE(average_info.has_value());</div>
|
|
<div class="line"><a id="l00267" name="l00267"></a><span class="lineno"> 267</span> EXPECT_EQ(average_info->point_type(), POINT_TYPE_AVERAGE_ITERATE);</div>
|
|
<div class="line"><a id="l00268" name="l00268"></a><span class="lineno"> 268</span> EXPECT_EQ(average_info->active_primal_variable_count(), 2);</div>
|
|
<div class="line"><a id="l00269" name="l00269"></a><span class="lineno"> 269</span> </div>
|
|
<div class="line"><a id="l00270" name="l00270"></a><span class="lineno"> 270</span> <span class="keyword">const</span> <span class="keyword">auto</span> current_info =</div>
|
|
<div class="line"><a id="l00271" name="l00271"></a><span class="lineno"> 271</span> <a class="code hl_function" href="namespaceoperations__research_1_1pdlp.html#a67c368ee96f024040259d5278775c1aa">GetPointMetadata</a>(test_stats, POINT_TYPE_CURRENT_ITERATE);</div>
|
|
<div class="line"><a id="l00272" name="l00272"></a><span class="lineno"> 272</span> ASSERT_TRUE(current_info.has_value());</div>
|
|
<div class="line"><a id="l00273" name="l00273"></a><span class="lineno"> 273</span> EXPECT_EQ(current_info->point_type(), POINT_TYPE_CURRENT_ITERATE);</div>
|
|
<div class="line"><a id="l00274" name="l00274"></a><span class="lineno"> 274</span> EXPECT_EQ(current_info->active_primal_variable_count(), 1);</div>
|
|
<div class="line"><a id="l00275" name="l00275"></a><span class="lineno"> 275</span> </div>
|
|
<div class="line"><a id="l00276" name="l00276"></a><span class="lineno"> 276</span> EXPECT_THAT(<a class="code hl_function" href="namespaceoperations__research_1_1pdlp.html#a67c368ee96f024040259d5278775c1aa">GetPointMetadata</a>(test_stats, POINT_TYPE_ITERATE_DIFFERENCE),</div>
|
|
<div class="line"><a id="l00277" name="l00277"></a><span class="lineno"> 277</span> Eq(absl::nullopt));</div>
|
|
<div class="line"><a id="l00278" name="l00278"></a><span class="lineno"> 278</span>}</div>
|
|
<div class="line"><a id="l00279" name="l00279"></a><span class="lineno"> 279</span> </div>
|
|
<div class="line"><a id="l00280" name="l00280"></a><span class="lineno"> 280</span>} <span class="comment">// namespace</span></div>
|
|
<div class="line"><a id="l00281" name="l00281"></a><span class="lineno"> 281</span>} <span class="comment">// namespace operations_research::pdlp</span></div>
|
|
<div class="ttc" id="aiteration__stats_8h_html"><div class="ttname"><a href="iteration__stats_8h.html">iteration_stats.h</a></div></div>
|
|
<div class="ttc" id="anamespacegoogle_1_1protobuf_1_1util_html_ad0ab08de6aa2b7160fbd23962859da9d"><div class="ttname"><a href="namespacegoogle_1_1protobuf_1_1util.html#ad0ab08de6aa2b7160fbd23962859da9d">google::protobuf::util::ParseTextOrDie</a></div><div class="ttdeci">T ParseTextOrDie(const std::string &input)</div><div class="ttdef"><b>Definition:</b> <a href="protobuf__util_8h_source.html#l00077">protobuf_util.h:77</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_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_ad795f23e2a85f4ae05efa1e2d0e0de4d"><div class="ttname"><a href="namespaceoperations__research_1_1pdlp.html#ad795f23e2a85f4ae05efa1e2d0e0de4d">operations_research::pdlp::TestLp</a></div><div class="ttdeci">QuadraticProgram TestLp()</div><div class="ttdef"><b>Definition:</b> <a href="test__util_8cc_source.html#l00032">test_util.cc:32</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1pdlp_html_afaedaf1e3ebe4d6d1a36e3fd1f206de6"><div class="ttname"><a href="namespaceoperations__research_1_1pdlp.html#afaedaf1e3ebe4d6d1a36e3fd1f206de6">operations_research::pdlp::TestDiagonalQp1</a></div><div class="ttdeci">QuadraticProgram TestDiagonalQp1()</div><div class="ttdef"><b>Definition:</b> <a href="test__util_8cc_source.html#l00142">test_util.cc:142</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_a5a9881f8a07b166ef2cbde572cea27b6"><div class="ttname"><a href="namespaceoperations__research.html#a5a9881f8a07b166ef2cbde572cea27b6">operations_research::Zero</a></div><div class="ttdeci">int64_t Zero()</div><div class="ttdoc">NOLINT.</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l03161">constraint_solver.h:3161</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_a817553ad64738460e5c339f24fe5ea13"><div class="ttname"><a href="namespaceoperations__research.html#a817553ad64738460e5c339f24fe5ea13">operations_research::TEST</a></div><div class="ttdeci">TEST(LinearAssignmentTest, NullMatrix)</div><div class="ttdef"><b>Definition:</b> <a href="hungarian__test_8cc_source.html#l00074">hungarian_test.cc:74</a></div></div>
|
|
<div class="ttc" id="aprotobuf__util_8h_html"><div class="ttname"><a href="protobuf__util_8h.html">protobuf_util.h</a></div></div>
|
|
<div class="ttc" id="aquadratic__program_8h_html"><div class="ttname"><a href="quadratic__program_8h.html">quadratic_program.h</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 class="ttc" id="atest__util_8h_html"><div class="ttname"><a href="test__util_8h.html">test_util.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__test_8cc.html">iteration_stats_test.cc</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>
|