当前位置:网站首页>Optimization method: meaning of common mathematical symbols
Optimization method: meaning of common mathematical symbols
2022-07-02 07:23:00 【Drizzle】
An optimization method : Meaning of common mathematical symbols
min x ∈ Ω f ( x ) f ( x ) stay Ω On Of most Small value \min \limits_{x \in \Omega} f(x) \qquad f(x) stay \Omega The minimum value on x∈Ωminf(x)f(x) stay Ω On Of most Small value
max x ∈ Ω f ( x ) f ( x ) stay Ω On Of most Big value \max \limits_{x \in \Omega} f(x) \qquad f(x) stay \Omega Maximum on x∈Ωmaxf(x)f(x) stay Ω On Of most Big value
s . t . suffer about beam On , s u b j e c t t o shrink Write s.\ t. \qquad Bound ,subject \ to abbreviation s. t. suffer about beam On ,subject to shrink Write
A ⊂ B Set close A package contain On Set close B A \subset B \qquad aggregate A Contained in collection B A⊂B Set close A package contain On Set close B
A ⊃ B Set close A package contain Set close B A \supset B \qquad aggregate A Contains sets B A⊃B Set close A package contain Set close B
x ∈ A x Belong to On Set close A x \in A \qquad x Belong to a collection A x∈Ax Belong to On Set close A
x ∉ A x No Belong to On Set close A x \notin A \qquad x It doesn't belong to a collection A x∈/Ax No Belong to On Set close A
A ∪ B Set close A And Set close B Of and Set A \cup B \qquad aggregate A And assemble B Union A∪B Set close A And Set close B Of and Set
A ∩ B Set close A And Set close B Of hand over Set A \cap B \qquad aggregate A And assemble B Intersection A∩B Set close A And Set close B Of hand over Set
≈ near like etc. On \approx \qquad Approximately equal to ≈ near like etc. On
∅ empty Set close \varnothing \qquad Empty set ∅ empty Set close
N ( x 0 , ε ) or N ε ( x 0 ) With spot x 0 by in heart , ε by And a half path Of adjacent Domain N(x_0, \ \varepsilon) \ or \ N_\varepsilon(x_0) \qquad With a little x_0 Centered ,\varepsilon Is the neighborhood of the radius N(x0, ε) or Nε(x0) With spot x0 by in heart ,ε by And a half path Of adjacent Domain
C k n or ( n k ) Two term type system Count , namely from n individual element plain in Every time Time take Out k individual element plain the Yes No Same as Of Group close Count C^n_k \ or \ \binom{n}{k} \qquad Binomial coefficient , From n One element at a time k The number of different combinations of elements Ckn or (kn) Two term type system Count , namely from n individual element plain in Every time Time take Out k individual element plain the Yes No Same as Of Group close Count
≜ set The righteous 、 constant etc. \triangleq \qquad Definition 、 Identity ≜ set The righteous 、 constant etc.
R real Count Domain R \qquad Real number field R real Count Domain
R n n dimension real o Clan empty between R^n \qquad n Dimensional real Euclidean space Rnn dimension real o Clan empty between
[ x ] No super too x Of most Big whole Count [x] \qquad No more than x Maximum integer for [x] No super too x Of most Big whole Count
f ( x ) ∈ C f ( x ) yes even To continue Letter Count f(x) \in C \qquad f(x) It's a continuous function f(x)∈Cf(x) yes even To continue Letter Count
f ( x ) ∈ C k f ( x ) have Yes k rank even To continue partial guide Count f(x) \in C^k \qquad f(x) have k Order continuous partial derivative f(x)∈Ckf(x) have Yes k rank even To continue partial guide Count
f : D ⊂ R n → R f ( x ) yes set The righteous stay R n in District Domain D On Of real value Letter Count f : D \subset R^n \rightarrow R \qquad f(x) Is defined in R^n Middle region D Real valued functions on f:D⊂Rn→Rf(x) yes set The righteous stay Rn in District Domain D On Of real value Letter Count
∥ x ∥ towards The amount x Of o type Fan Count , namely ∥ x ∥ = ( ∑ i = 1 n x i 2 ) 1 / 2 \parallel x \parallel \qquad vector x The European norm of , namely \parallel x \parallel = (\sum \limits^n \limits_{i=1} x^2_i) ^{1/2} ∥x∥ towards The amount x Of o type Fan Count , namely ∥x∥=(i=1∑nxi2)1/2
( x , y ) or x T y towards The amount x 、 y Of Inside product (x, y) \ or \ x^Ty \qquad vector x、y Inner product (x,y) or xTy towards The amount x、y Of Inside product
d e t ( A ) or ∣ A ∣ Moment front A Of That's ok Column type det(A) \ or \ |A| \qquad matrix A The determinant of det(A) or ∣A∣ Moment front A Of That's ok Column type
r ( A ) Moment front A Of Rank r(A) \qquad matrix A The rank of r(A) Moment front A Of Rank
▽ f ( x ) f ( x ) Of ladder degree , ▽ f ( x ) = ( ∂ f ∂ x 1 , ∂ f ∂ x 2 , ⋯   , ∂ f ∂ x n ) T \bigtriangledown f(x) \qquad f(x) Gradient of ,\bigtriangledown f(x) = (\frac{\partial f}{\partial x_1}, \ \frac{\partial f}{\partial x_2}, \ \cdots, \ \frac{\partial f}{\partial x_n})^T ▽f(x)f(x) Of ladder degree ,▽f(x)=(∂x1∂f, ∂x2∂f, ⋯, ∂xn∂f)T
H ( x ) or ▽ 2 f ( x ) f ( x ) Of H e s s i a n front , H ( x ) or ▽ 2 f ( x ) ≜ ( ∂ 2 f ( x ) ∂ x i ∂ x j ) n × n H(x) \ or \ \bigtriangledown ^2 f(x) \qquad f(x) Of Hessian front ,H(x) \ or \ \bigtriangledown ^2 f(x) \triangleq (\frac{\partial ^2 f(x)}{\partial x_i \partial x_j})_{n \times n} H(x) or ▽2f(x)f(x) Of Hessian front ,H(x) or ▽2f(x)≜(∂xi∂xj∂2f(x))n×n
min { x 1 , x 2 , ⋯   , x n } Count x 1 , x 2 , ⋯   , x n in Of most Small person \min \{x_1, x_2, \cdots, x_n\} \qquad Count x_1, x_2, \cdots, x_n The smallest of them min{ x1,x2,⋯,xn} Count x1,x2,⋯,xn in Of most Small person
max { x 1 , x 2 , ⋯   , x n } Count x 1 , x 2 , ⋯   , x n in Of most Big person \max \{x_1, x_2, \cdots, x_n\} \qquad Count x_1, x_2, \cdots, x_n The biggest of all max{ x1,x2,⋯,xn} Count x1,x2,⋯,xn in Of most Big person
inf x ∈ X f ( x ) f ( x ) stay X On Of Next indeed world \inf \limits_{x \in X} f(x) \qquad f(x) stay X Supremum and infimum x∈Xinff(x)f(x) stay X On Of Next indeed world
sup x ∈ X f ( x ) f ( x ) stay X On Of On indeed world \sup \limits_{x \in X} f(x) \qquad f(x) stay X Supremum of supremum x∈Xsupf(x)f(x) stay X On Of On indeed world
x ∗ most optimal Explain x^* \qquad Optimal solution x∗ most optimal Explain
f ∗ Objective mark Letter Count Of most optimal value f^* \qquad The optimal value of the objective function f∗ Objective mark Letter Count Of most optimal value
边栏推荐
- Oracle rman半自动恢复脚本-restore阶段
- 使用 Compose 实现可见 ScrollBar
- ORACLE EBS中消息队列fnd_msg_pub、fnd_message在PL/SQL中的应用
- SSM supermarket order management system
- 【信息检索导论】第三章 容错式检索
- 一个中年程序员学习中国近代史的小结
- 外币记账及重估总账余额表变化(下)
- 【MEDICAL】Attend to Medical Ontologies: Content Selection for Clinical Abstractive Summarization
- Conda 创建,复制,分享虚拟环境
- Analysis of MapReduce and yarn principles
猜你喜欢
Analysis of MapReduce and yarn principles
【信息检索导论】第六章 词项权重及向量空间模型
Only the background of famous universities and factories can programmers have a way out? Netizen: two, big factory background is OK
Pratique et réflexion sur l'entrepôt de données hors ligne et le développement Bi
SSM supermarket order management system
[paper introduction] r-drop: regulated dropout for neural networks
CSRF attack
SSM second hand trading website
spark sql任务性能优化(基础)
ssm垃圾分类管理系统
随机推荐
【Torch】最简洁logging使用指南
[paper introduction] r-drop: regulated dropout for neural networks
Oracle段顾问、怎么处理行链接行迁移、降低高水位
RMAN增量恢复示例(1)-不带未备份的归档日志
SSM student achievement information management system
Oracle rman自动恢复脚本(生产数据向测试迁移)
Check log4j problems using stain analysis
ssm+mysql实现进销存系统
Feeling after reading "agile and tidy way: return to origin"
[introduction to information retrieval] Chapter 1 Boolean retrieval
使用MAME32K进行联机游戏
读《敏捷整洁之道:回归本源》后感
离线数仓和bi开发的实践和思考
Explain in detail the process of realizing Chinese text classification by CNN
【Ranking】Pre-trained Language Model based Ranking in Baidu Search
【调参Tricks】WhiteningBERT: An Easy Unsupervised Sentence Embedding Approach
A summary of a middle-aged programmer's study of modern Chinese history
離線數倉和bi開發的實踐和思考
SSM二手交易网站
How to efficiently develop a wechat applet