|
| | | | |
| | | |
| Stat |
Members: 3645
Articles: 2'506'133
Articles rated: 2609
27 April 2024 |
|
| | | | |
|
Article overview
| |
|
|
Minimizing Polynomials Over Semialgebraic Sets | | Jiawang Nie
; James W. Demmel
; Victoria Powers
; | | Date: |
17 Feb 2005 | | Subject: | Optimization and Control; Algebraic Geometry | math.OC math.AG | | Abstract: | This paper concerns a method for finding the minimum of a polynomial on a semialgebraic set, i.e., a set in $
e^m$ defined by finitely many polynomial equations and inequalities, using the Karush-Kuhn-Tucker (KKT) system and sum of squares (SOS) relaxations. This generalizes results in the recent paper cite{njw_grad}, which considers minimizing polynomials on algebraic sets, i.e., sets in $
e^m$ defined by finitely many polynomial equations. Most of the theorems and conclusions in cite{njw_grad} generalize to semialgebraic sets, even in the case where the semialgebraic set is not compact. We discuss the method in some special cases, namely, when the semialgebraic set is contained in the nonnegative orthant $
e^n_+$ or in box constraints $[a,b]_n$. These constraints make the computations more efficient. | | Source: | arXiv, math.OC/0502391 | | Services: | Forum | Review | PDF | Favorites | |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser Mozilla/5.0 AppleWebKit/537.36 (KHTML, like Gecko; compatible; ClaudeBot/1.0; +claudebot@anthropic.com)
|
| |
|
|
|
|
News, job offers and information for researchers and scientists:
| |
REGISTER