Efficiency improvement in an \(n\)D systems approach to polynomial optimization
DOI10.1016/j.jsc.2006.03.008zbMath1145.90446OpenAlexW2044659401MaRDI QIDQ2457407
Ralf L. M. Peeters, Bernard Hanzon, Ivo W. M. Bleylevens
Publication date: 23 October 2007
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2006.03.008
Gröbner basislarge eigenvalue problem\(n\)D systemsStetter-Möller matrix methodGlobal polynomial optimization
Symbolic computation and algebraic computation (68W30) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Nonlinear programming (90C30)
Related Items (2)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on two problems in connexion with graphs
- Global minimization of a multivariate polynomial using matrix methods
- Semidefinite programming relaxations for semialgebraic problems
- Multivariate polynomial equations with multiple zeros solved by matrix eigenproblems
- Global Optimization with Polynomials and the Problem of Moments
- An Explicit Equivalent Positive Semidefinite Program for Nonlinear 0-1 Programs
- Jacobi--Davidson Style QR and QZ Algorithms for the Reduction of Matrix Pencils
- State Space Realization of 2-D Finite-Dimensional Behaviours
- ARPACK Users' Guide
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- A Jacobi–Davidson Iteration Method for Linear Eigenvalue Problems
- GloptiPoly
This page was built for publication: Efficiency improvement in an \(n\)D systems approach to polynomial optimization