"볼록 최적화"의 두 판 사이의 차이
둘러보기로 가기
검색하러 가기
Pythagoras0 (토론 | 기여) (→메타데이터: 새 문단) |
Pythagoras0 (토론 | 기여) |
||
| 21번째 줄: | 21번째 줄: | ||
<references /> | <references /> | ||
| − | == 메타데이터 == | + | ==메타데이터== |
| − | |||
===위키데이터=== | ===위키데이터=== | ||
* ID : [https://www.wikidata.org/wiki/Q463359 Q463359] | * ID : [https://www.wikidata.org/wiki/Q463359 Q463359] | ||
| + | ===Spacy 패턴 목록=== | ||
| + | * [{'LOWER': 'convex'}, {'LEMMA': 'optimization'}] | ||
| + | * [{'LOWER': 'convex'}, {'LEMMA': 'optimisation'}] | ||
2021년 2월 17일 (수) 01:59 판
노트
- CVXOPT is a free software package for convex optimization based on the Python programming language.[1]
- Convex optimization studies the problem of minimizing a convex function over a convex set.[2]
- Surprisingly, algorithms for convex optimization have also been used to design counting problems over discrete objects such as matroids.[2]
- Simultaneously, algorithms for convex optimization have become central to many modern machine learning applications.[2]
- The goal of this book is to enable a reader to gain an in depth understanding of algorithms for convex optimization.[2]
- Convex optimization has many applications ranging from operations research and machine learning to quantum information theory.[3]
- The goal of this course is to investigate in-depth and to develop expert knowledge in the theory and algorithms for convex optimization.[4]
- The lecture slides are adopted from Dr. Stephen Boyd's letcture notes on Convex Optimization at Standord University.[5]
- x + &bgr; y ) = &agr; f i( x ) + &bgr; f i( y )), the problem is said to be one of convex optimization.[6]
- Note that linear programming is a special case of convex optimization, where the objective and constraint functions are all linear.[6]
- If a problem can be transformed to an equivalent convex optimization, then ability to visualize its geometry is acquired.[7]
- Study of equivalence, sameness, and uniqueness therefore pervade study of convex optimization.[7]
- A MOOC on convex optimization, CVX101, was run from 1/21/14 to 3/14/14.[8]
- Convex optimization is a subfield of mathematical optimization that studies the problem of minimizing convex functions over convex sets.[9]
- Extensions of convex optimization include the optimization of biconvex, pseudo-convex, and quasiconvex functions.[9]
- This monograph presents the main complexity theorems in convex optimization and their corresponding algorithms.[10]
- A wealth of existing methodology for convex optimization can then be used to identify points arbitrarily close to the true global optimum.[11]
소스
- ↑ Home — CVXOPT
- ↑ 2.0 2.1 2.2 2.3 Algorithms for Convex Optimization
- ↑ Pushing the boundaries of convex optimization
- ↑ Industrial Engineering & Management Sciences
- ↑ CSCI 5254: Convex Optimization and Its Applications
- ↑ 6.0 6.1 Convex Optimization
- ↑ 7.0 7.1 Convex Optimization
- ↑ Convex Optimization – Boyd and Vandenberghe
- ↑ 9.0 9.1 Convex optimization
- ↑ Convex Optimization: Algorithms and Complexity
- ↑ Using convex optimization of autocorrelation with constrained support and windowing for improved phase retrieval accuracy
메타데이터
위키데이터
- ID : Q463359
Spacy 패턴 목록
- [{'LOWER': 'convex'}, {'LEMMA': 'optimization'}]
- [{'LOWER': 'convex'}, {'LEMMA': 'optimisation'}]