FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W3135959098> ?p ?o ?g. }

• W3135959098 endingPage "598" @default.
• W3135959098 startingPage "559" @default.
• W3135959098 abstract "Abstract A basic closed semialgebraic subset of $${mathbb {R}}^{n}$$ <mml:math xmlns:mml=http://www.w3.org/1998/Math/MathML><mml:msup><mml:mrow><mml:mi>R</mml:mi></mml:mrow><mml:mi>n</mml:mi></mml:msup></mml:math> is defined by simultaneous polynomial inequalities $$p_{1}ge 0,ldots ,p_{m}ge 0$$ <mml:math xmlns:mml=http://www.w3.org/1998/Math/MathML><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>≥</mml:mo><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mo>…</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mi>m</mml:mi></mml:msub><mml:mo>≥</mml:mo><mml:mn>0</mml:mn></mml:mrow></mml:math> . We consider Lasserre’s relaxation hierarchy to solve the problem of minimizing a polynomial over such a set. These relaxations give an increasing sequence of lower bounds of the infimum. In this paper we provide a new certificate for the optimal value of a Lasserre relaxation to be the optimal value of the polynomial optimization problem. This certificate is to check if a certain matrix has a generalized Hankel form. This certificate is more general than the already known certificate of an optimal solution being flat. In case we have detected optimality we will extract the potential minimizers with a truncated version of the Gelfand–Naimark–Segal construction on the optimal solution of the Lasserre relaxation. We prove also that the operators of this truncated construction commute if and only if the matrix of this modified optimal solution is a generalized Hankel matrix. This generalization of flatness will enable us to prove, with the use of the GNS truncated construction, a result of Curto and Fialkow on the existence of quadrature rule if the optimal solution is flat and a result of Xu and Mysovskikh on the existence of a Gaussian quadrature rule if the modified optimal solution is a generalized Hankel matrix . At the end, we provide a numerical linear algebraic algorithm for detecting optimality and extracting solutions of a polynomial optimization problem." @default.
• W3135959098 created "2021-03-29" @default.
• W3135959098 creator A5013693405 @default.
• W3135959098 date "2021-03-19" @default.
• W3135959098 modified "2023-09-26" @default.
• W3135959098 title "Detecting optimality and extracting solutions in polynomial optimization with the truncated GNS construction" @default.
• W3135959098 cites W1543064558 @default.
• W3135959098 cites W1546322230 @default.
• W3135959098 cites W1587078255 @default.
• W3135959098 cites W1622063347 @default.
• W3135959098 cites W1967344706 @default.
• W3135959098 cites W1996541174 @default.
• W3135959098 cites W2001033871 @default.
• W3135959098 cites W2061186416 @default.
• W3135959098 cites W2077071943 @default.
• W3135959098 cites W2085991972 @default.
• W3135959098 cites W2116827925 @default.
• W3135959098 cites W2130010995 @default.
• W3135959098 cites W2570391697 @default.
• W3135959098 cites W3102900599 @default.
• W3135959098 cites W4255072566 @default.
• W3135959098 cites W66250508 @default.
• W3135959098 doi "https://doi.org/10.1007/s10898-020-00987-9" @default.
• W3135959098 hasPublicationYear "2021" @default.
• W3135959098 type Work @default.
• W3135959098 sameAs 3135959098 @default.
• W3135959098 citedByCount "1" @default.
• W3135959098 countsByYear W31359590982018 @default.
• W3135959098 crossrefType "journal-article" @default.
• W3135959098 hasAuthorship W3135959098A5013693405 @default.
• W3135959098 hasBestOaLocation W31359590981 @default.
• W3135959098 hasConcept C11413529 @default.
• W3135959098 hasConcept C114614502 @default.
• W3135959098 hasConcept C15744967 @default.
• W3135959098 hasConcept C2776029896 @default.
• W3135959098 hasConcept C33923547 @default.
• W3135959098 hasConcept C41008148 @default.
• W3135959098 hasConcept C77805123 @default.
• W3135959098 hasConceptScore W3135959098C11413529 @default.
• W3135959098 hasConceptScore W3135959098C114614502 @default.
• W3135959098 hasConceptScore W3135959098C15744967 @default.
• W3135959098 hasConceptScore W3135959098C2776029896 @default.
• W3135959098 hasConceptScore W3135959098C33923547 @default.
• W3135959098 hasConceptScore W3135959098C41008148 @default.
• W3135959098 hasConceptScore W3135959098C77805123 @default.
• W3135959098 hasIssue "3" @default.
• W3135959098 hasLocation W31359590981 @default.
• W3135959098 hasLocation W31359590982 @default.
• W3135959098 hasLocation W31359590983 @default.
• W3135959098 hasLocation W31359590984 @default.
• W3135959098 hasOpenAccess W3135959098 @default.
• W3135959098 hasPrimaryLocation W31359590981 @default.
• W3135959098 hasRelatedWork W1978042415 @default.
• W3135959098 hasRelatedWork W2017331178 @default.
• W3135959098 hasRelatedWork W2045367737 @default.
• W3135959098 hasRelatedWork W2155209963 @default.
• W3135959098 hasRelatedWork W2351491280 @default.
• W3135959098 hasRelatedWork W2371447506 @default.
• W3135959098 hasRelatedWork W2386767533 @default.
• W3135959098 hasRelatedWork W2976797620 @default.
• W3135959098 hasRelatedWork W303980170 @default.
• W3135959098 hasRelatedWork W3086542228 @default.
• W3135959098 hasVolume "81" @default.
• W3135959098 isParatext "false" @default.
• W3135959098 isRetracted "false" @default.
• W3135959098 magId "3135959098" @default.
• W3135959098 workType "article" @default.