-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathone_dimensional_minimization.h
More file actions
39 lines (32 loc) · 1.76 KB
/
one_dimensional_minimization.h
File metadata and controls
39 lines (32 loc) · 1.76 KB
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
/*****************************************************************************
* @file one_dimensional_minimization.h *
* @brief 一维最优化问题求解类 *
* @details 目前仅实现了用于 Frank Wolfe 算法的二分法 *
* @author Dong Yu *
* @email 213191838@seu.edu.cn *
* @version 0.1 *
* @date 2022/10/28 *
* *
*----------------------------------------------------------------------------*
* Change History : *
* <Date> | <Version> | <Author> | <Description> *
*----------------------------------------------------------------------------*
* 2022/10/28 | 0.1 | Dong Yu | Copy from User-Equilibrium v0.9 *
*----------------------------------------------------------------------------*
* *
*****************************************************************************/
#pragma once
#ifndef ONE_DIMENSIONAL_MINIMIZATION
#define ONE_DIMENSIONAL_MINIMIZATION
#include "network.h"
#include <vector>
#include <set>
#include <map>
#include <string>
using namespace std;
// 二分法(需传参network,可改进)
double BisectionMethod(const Network& network, const map<string, map<string, double>>& xn, const map<string, map<string, double>>& yn);
// 还可以继续完善其他的方法:
//float GoldenSectionMethod();
//float NewtonMethod();
#endif