|
|||||
|
|
Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets |
|
| Authors: | V Jeyakumar S Kim G M Lee G Li |
| Abstract: | |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ | |
|
||||||||||||||||
|
||||||||||||||||
|
||||||||||||||||
|
|
|
|
| 设为首页 | 免责声明 | 关于勤云 | 加入收藏 |
|
Copyright©北京勤云科技发展有限公司 京ICP备09084417号 |