Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Sparse Polynomial Optimization

From MaRDI portal
Publication:5088205
Jump to:navigation, search

DOI10.1142/q0382OpenAlexW4225149655MaRDI QIDQ5088205

Jie Wang, Victor Magron

Publication date: 11 July 2022

Published in: Series on Optimization and Its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/q0382



Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to algebraic geometry (14-01) Semialgebraic sets and related spaces (14P10) Polynomial optimization (90C23)


Related Items (3)

Semidefinite Relaxation Methods for Tensor Absolute Value Equations ⋮ Exploiting ideal-sparsity in the generalized moment problem with application to matrix factorization ranks ⋮ A Correlatively Sparse Lagrange Multiplier Expression Relaxation for Polynomial Optimization


Uses Software

  • GloptiPoly
  • TSSOS



This page was built for publication: Sparse Polynomial Optimization

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5088205&oldid=19593137"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 8 February 2024, at 13:41.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki