✦ LIBER ✦

Minimization of a class of matrix trace functions by means of refined majorization

✍ Scribed by Henk A. L. Kiers; Jos M. F. ten Berge

Book ID: 112727063
Publisher: Springer
Year: 1992
Tongue: English
Weight: 845 KB
Volume: 57
Category: Article
ISSN: 0033-3123
DOI: 10.1007/bf02295425

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Majorization as a tool for optimizing a

Majorization as a tool for optimizing a class of matrix functions

✍ Henk A. L. Kiers 📂 Article 📅 1990 🏛 Springer 🌐 English ⚖ 953 KB

Minimization of a class of nonconvex fun

Minimization of a class of nonconvex functions

✍ S. A. Kantsedal; Yu. B. Maksimov 📂 Article 📅 1976 🏛 Springer US 🌐 English ⚖ 308 KB

Finite-element grid improvement by minim

Finite-element grid improvement by minimization of stiffness matrix trace

✍ Madan G. Kittur; Ronald L. Huston; Fred B. Oswald 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 523 KB

A class of almost-differentiable functio

A class of almost-differentiable functions and a minimization method for functions of this class

✍ N. Z. Shor 📂 Article 📅 1974 🏛 Springer US 🌐 English ⚖ 465 KB

A class of matrix monotone functions

✍ V.E.S. Szabó 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 112 KB

Minimizing a class of unicyclic graphs b

Minimizing a class of unicyclic graphs by means of Hosoya index

✍ Hongbo Hua 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 481 KB

The Hosoya index, denoted by z(G), of a (molecular) graph G is defined as the total number of independent-edge sets of G. Let U n be the set of unicyclic graphs with n vertices. A fully loaded unicyclic graph is a unicyclic graph with the property that there is no vertex with degree less than 3 in i