Реализация метода Хука-Дживса. Поиск ошибки в коде

# include <iostream>
# include <cmath>
# include <vector>
 
using namespace std;
using standard_type = double ;
 
vector <standard_type> F (const vector <standard_type>& v)
{
    return { v[0] * v[0] + v[1] * v[1] } ;
}
 
vector <standard_type> get_initial_condition ()
{
    return { -5, -5 } ;
}
 
// vector <standard_type> F (const vector <standard_type>& v)
// {
//     return { 8 * pow ( v[0], 2 ) + 4 * ( v[0] * v[1] ) + 5 * pow ( v[1], 2 ) } ;
// }
 
// vector <standard_type> get_initial_condition ()
// {
//     return { -4, -4 } ;
// }
 
void print_debug_info (const vector <standard_type>& v, string name_vector)
{
    standard_type size_vector = v.size() ;
    cout << " \t print debug info: " << endl;
    cout << name_vector << " = { ";
    for (int i = 0; i < size_vector - 1; i++)
    {
        cout << v[i] << " ;" ;
    }
    cout << v[size_vector - 1] << " } ;" << endl;
    cout << " \t print debug info ends. " << endl;  
}
 
void print_vector (const vector<standard_type>& v, const string name_vector)
{
    cout << name_vector << " = { ";
    for (int i = 0; i < v.size() - 1; i++)
    {
        cout << v[i] << " ;" ;
    }
    cout << v.back() << " } ;" << endl;
}
 
vector<standard_type> search_by_pattern(vector<standard_type> previous_point, vector<standard_type> found_point);
 
vector <standard_type> HJ_method (standard_type step = 1, standard_type eps = 0.1)
{
    standard_type number_of_iterations = 0 ;
    standard_type number_of_variables = get_initial_condition().size();
    vector <standard_type> x_basis = get_initial_condition() ;
    vector <standard_type> F_result_basis = F(x_basis) ;
    vector <standard_type> new_point (number_of_variables);
    vector <standard_type> F_result_new_point(F_result_basis.size()) ;
 
    do
    {
        number_of_iterations++;
        F_result_basis = F(x_basis);
 
        for (size_t i = 0; i < number_of_variables; i++)
        {
            new_point.clear();
            F_result_new_point.clear();
            new_point = x_basis ;
            new_point[i] = x_basis[i] + step;
            print_debug_info(x_basis, "x_basis");
            print_debug_info(new_point, "new_point");
            F_result_new_point = F(new_point);
            print_debug_info(F_result_new_point, "F_result_new_point");
            if (F_result_basis > F_result_new_point)
            {
                cout << "F_result_basis > F_result_new_point => " << F_result_basis[0] << " > " << F_result_new_point[0] << endl;
                x_basis = search_by_pattern(x_basis, new_point);
                print_debug_info(x_basis, " NEW x_basis ");
                cout << "number_of_iterations = " << number_of_iterations << endl;
                break;
            }
 
            new_point.clear();
            F_result_new_point.clear();
            new_point = x_basis ;
            new_point[i] = x_basis[i] - step;
            print_debug_info(x_basis, "x_basis");
            print_debug_info(new_point, "new_point");
            F_result_new_point = F(new_point);
            print_debug_info(F_result_new_point, "F_result_new_point");
            if (F_result_basis > F_result_new_point)
            {
                cout << "F_result_basis > F_result_new_point => " << F_result_basis[0] << " > " << F_result_new_point[0] << endl;
                x_basis = search_by_pattern(x_basis, new_point);
                print_debug_info(x_basis, " NEW x_basis ");
                cout << "number_of_iterations = " << number_of_iterations << endl;
                break;
            }
        }
 
        step = step / 2 ;
        cout << "step_reduction. NEW step = " << step << endl;
 
 
        
    } while (step > eps);
 
    cout << "step > eps => " << step << " > " << eps << endl;
    cout << "number_of_iterations = " << number_of_iterations << endl;
 
    return x_basis ;
}
 
vector<standard_type> search_by_pattern(vector<standard_type> previous_point, vector<standard_type> found_point)
{
    vector<standard_type> v(previous_point.size());
 
    for (int i = 0; i < v.size(); i++)
    {
        v[i] = previous_point[i] + 2 * (found_point[i] - previous_point[i]);
    }
 
    cout << " --------- " << endl;
    print_debug_info(v, "search_by_pattern () -> found_point");
    cout << " --------- " << endl;
 
    return v ;
}