"Semidefinite programming relaxation methods for global optimization ..."

Vaithilingam Jeyakumar et al. (2016)

> Home

Details and statistics

DOI: 10.1007/S10898-015-0356-6

access: closed

type: Journal Article

metadata version: 2024-01-26

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jgo/JeyakumarKLL16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jgo/JeyakumarKLL16
Vaithilingam Jeyakumar, S. Kim, Gue Myung Lee, Guoyin Li:
Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets. J. Glob. Optim. 65(2): 175-190 (2016)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.