"Semidefinite programming"의 두 판 사이의 차이
둘러보기로 가기
검색하러 가기
Pythagoras0 (토론 | 기여) (→노트) |
Pythagoras0 (토론 | 기여) (→메타데이터: 새 문단) |
||
| 10번째 줄: | 10번째 줄: | ||
===소스=== | ===소스=== | ||
<references /> | <references /> | ||
| + | |||
| + | == 메타데이터 == | ||
| + | |||
| + | ===위키데이터=== | ||
| + | * ID : [https://www.wikidata.org/wiki/Q2269096 Q2269096] | ||
2020년 12월 26일 (토) 04:37 판
노트
- Semidefinite Programming is a rapidly emerging area of mathematical programming.[1]
- Semidefinite programming is a relatively new field of optimization which is of growing interest for several reasons.[2]
- Semidefinite programming has been used in the optimization of complex systems.[2]
- We hope that our algorithm and techniques open the door to improved solvers for positive semidefinite programming and its applications.[3]
- We focus on readers with a basic background in continuous Optimization, but without a previous knowledge in Semidefinite Programming.[4]
- A short overview on the theoretical and algorithmic results in the case of nonlinear semidefinite programming is also given.[4]
- The linear semidefinite programming can be intended as linear programming over the cone of positive semidefinite matrices.[4]
소스
메타데이터
위키데이터
- ID : Q2269096