✦ LIBER ✦

Z-eigenvalue methods for a global polynomial optimization problem

✍ Scribed by Liqun Qi; Fei Wang; Yiju Wang

Publisher: Springer-Verlag
Year: 2007
Tongue: English
Weight: 209 KB
Volume: 118
Category: Article
ISSN: 0025-5610
DOI: 10.1007/s10107-007-0193-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Global optimization for the generalized

Global optimization for the generalized polynomial sum of ratios problem

✍ Peiping Shen; Yuan Ma; Yongqiang Chen 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 221 KB

Necessary and sufficient conditions for

Necessary and sufficient conditions for global optimality of eigenvalue optimization problems

✍ Y. Kanno; M. Ohsaki 📂 Article 📅 2001 🏛 Springer-Verlag 🌐 English ⚖ 112 KB

Global descent methods for unconstrained

Global descent methods for unconstrained global optimization

✍ Z. Y. Wu; D. Li; L. S. Zhang 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 282 KB

A projection based multiscale optimizati

A projection based multiscale optimization method for eigenvalue problems

✍ Peter A. Graf; Wesley B. Jones 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 363 KB

Polynomial splines and a fundamental eig

Polynomial splines and a fundamental eigenvalue problem for polynomials

✍ E.N Nilson 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 799 KB

An approximate approach of global optimi

An approximate approach of global optimization for polynomial programming problems

✍ Han-Lin Li; Ching-Ter Chang 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 626 KB

Many methods for solving polynomial programming problems can only find locally optimal solutions. This paper proposes a method for finding the approximately globally optimal solutions of polynomial programs. Representing a bounded continuous variable xi as the addition of a discrete variable dj and