Optimizers for Sub-Sums subject to a Sum- and a Schur-Convex Constraint with Applications to Estimation of Eigenvalues

DOI10.7153/MIA-06-67zbMATH Open1138.90441OpenAlexW2316858288MaRDI QIDQ4459874FDOQ4459874

Oleg Pikhurko, Ari Virtanen, Alexander Kovačec, Jorma K. Merikoski

Publication date: 18 May 2004

Published in: Mathematical Inequalities & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7153/mia-06-67

Mathematics Subject Classification ID

Convex programming (90C25) Inequalities involving eigenvalues and eigenvectors (15A42) Inequalities for sums, series and integrals (26D15)

Cited In (3)

• Optimal Hoffman-type estimates in eigenvalue and semidefinite inequality constraints
• Some localization theorems using a majorization technique
• A note on maximizing a special concave function subject to simultaneous Loewner order constraints

   Recommendations

• An optimization problem with applications to optimal design theory 👍 👎
• Optimality conditions and duality theory for minimizing sums of the largest eigenvalues of symmetric matrices 👍 👎
• A quadratically convergent local algorithm on minimizing sums of the largest eigenvalues of a symmetric matrix 👍 👎
• Partition-Optimization with Schur Convex Sum Objective Functions 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: Optimizers for Sub-Sums subject to a Sum- and a Schur-Convex Constraint with Applications to Estimation of Eigenvalues

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4459874)