A \(\mathcal{UV}\)-method for a class of constrained minimized problems of maximum eigenvalue functions

DOI10.1155/2017/5309698zbMath1371.90131OpenAlexW2565272528WikidataQ59146403 ScholiaQ59146403MaRDI QIDQ2397004

Shanghua Li, Ming Jin, Wei Wang, Xinyu Cao

Publication date: 29 May 2017

Published in: Journal of Function Spaces (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2017/5309698

zbMATH Keywords

exact penalty functionspace decompositionsmooth convex approximation

Mathematics Subject Classification ID

Nonlinear programming (90C30) Approximation methods and heuristics in mathematical programming (90C59)

Uses Software

• PLCP

Cites Work

• Unnamed Item
• Unnamed Item
• The \(\mathcal{UV}\)-decomposition on a class of d.c. functions and optimality conditions
• Smooth convex approximation to the maximum eigenvalue function
• A spectral quadratic-SDP method with applications to fixed-order \(H_2\) and \(H_\infty\) synthesis
• A \(\mathcal{VU}\)-algorithm for convex minimization
• Solutions to shape and topology eigenvalue optimization problems using a homogenization method
• The $\U$-Lagrangian of the Maximum Eigenvalue Function
• Numerical optimization. Theoretical and practical aspects. Transl. from the French

This page was built for publication: A \(\mathcal{UV}\)-method for a class of constrained minimized problems of maximum eigenvalue functions