# decent cpp Defines the entry point for the console application include

 ``` 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158``` ```// decent.cpp : Defines the entry point for the console application. // //#include "stdafx.h" #include #include using namespace std; int n = 2; double e = 0.0001; double K = 8; int max_iter = 1000; double f(double* x, const int n) { double y = pow(x[0], 4) + 2*K*pow(x[0], 3) - 2*pow(K, 2)*pow(x[0], 2) - 2*pow(K, 3)*x[0] + + pow(x[1], 4) - pow(x[1], 2)*(2*pow(K, 2) + 2*K) + 2*pow(K, 4) + pow(K, 3) + pow(K, 2); return y; } double* grad(double* x, int n) { double* g = new double[n]; g[0] = 4*pow(x[0], 3) + 6*K*pow(x[0], 2) - 4*pow(K, 2)*x[0] - 2*pow(K, 3); g[1] = 4*pow(x[1], 3) - 2*(2*pow(K, 2) + 2*K)*x[1]; return g; } double goldens(double _a, double _b, double* tmp1, double* tmp2, int ia, int ib) { double a = _a; double b = _b; double phi = (sqrt(5.0) + 1)/2; double x1 = b - (b-a)/phi; double x2 = a + (b-a)/phi; double min_l; int iter = 0; while(!(b - a < e && b - a > - e) && iter < max_iter){ iter++; tmp1[ia] = x1; tmp2[ib] = x2; if(f(tmp1, n) < f(tmp2, n)){ b = x2; x2 = x1; x1 = b - (b-a)/phi; } else{ a = x1; x1 = x2; x2 = a + (b-a)/phi; } min_l = (f(tmp1, n) -e) && iter < max_iter ){ iter++; for(int i = 0; i < n; i++){ tmp1[i] = x0[i] + x1*gr[i]; tmp2[i] = x0[i] + x2*gr[i]; } if(f(tmp1, n) < f(tmp2, n)){ b = x2; x2 = x1; x1 = b - (b-a)/phi; } else{ a = x1; x1 = x2; x2 = a + (b-a)/phi; } min_l = (f(tmp1, n) -e)) && iter < max_iter); return f(xk1, n); } //int _tmain(int argc, _TCHAR* argv[]) int main(int argc, char* argv[]) { if(argc != n+1){ cout << "Usage: descent x1 x2" << endl; return 0; } if ( (!atof(argv[1]) && argv[1][0] != '0' ) && (!atof(argv[2]) && argv[2][0] != '0' ) ) { cout << "Wrong input" << endl; return 0; } cout << "x^4 + 2*k*x^3 - 2*k^2*x^2 - 2^3*x + y^4 - (2*k^2 + 2*k)*y^2 + 2*k^4 + k^3 + k^2 -> min" << endl; cout << "k = 8" << endl; double* x0 = new double[n]; for(int i = 0; i < n; i++){ x0[i] = atof(argv[i+1]); } cout << "MPS" << endl; cout <<"Final: " << mps(x0, -1000, 1000) << endl; cout << "Gradient" << endl; cout << "Final: " << gm(x0, -1000, 1000) << endl; return 0; } ```