A UV-method for a class of constrained minimized problems of maximum eigenvalue functions
DOI10.1155/2017/5309698zbMATH Open1371.90131OpenAlexW2565272528WikidataQ59146403 ScholiaQ59146403MaRDI QIDQ2397004FDOQ2397004
Authors: Wei Wang, Ming Jin, Shanghua Li, 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
Recommendations
- A UV-decomposition method for a class of maximum eigenvalue optimizations
- Solving a minimization problem for a class of constrained maximum eigenvalue function
- On minimax eigenvalue problems via constrained optimization
- An approximate proximal bundle method to minimize a class of maximum eigenvalue functions
- scientific article; zbMATH DE number 1159562
- scientific article; zbMATH DE number 6613055
- A minimax approach to the eigenvalue problem of hemivariational inequalities and applications
- Minimax principles for convex eigenvalue problems
- A relax inexact accelerated proximal gradient method for the constrained minimization problem of maximum eigenvalue functions
- scientific article; zbMATH DE number 513094
Approximation methods and heuristics in mathematical programming (90C59) Nonlinear programming (90C30)
Cites Work
- Numerical optimization. Theoretical and practical aspects. Transl. from the French
- Title not available (Why is that?)
- A \(\mathcal{VU}\)-algorithm for convex minimization
- Smooth convex approximation to the maximum eigenvalue function
- Solutions to shape and topology eigenvalue optimization problems using a homogenization method
- A spectral quadratic-SDP method with applications to fixed-order \(H_2\) and \(H_\infty\) synthesis
- The $\U$-Lagrangian of the Maximum Eigenvalue Function
- The \(\mathcal{UV}\)-decomposition on a class of d.c. functions and optimality conditions
- Stability optimization of open-loop controlled walking robots
Cited In (7)
- A relax inexact accelerated proximal gradient method for the constrained minimization problem of maximum eigenvalue functions
- On minimax eigenvalue problems via constrained optimization
- Title not available (Why is that?)
- An approximate \(\mathcal U\)-Lagrangian and algorithm to \(\mathcal{UV}\) decomposition
- Solving a minimization problem for a class of constrained maximum eigenvalue function
- Some results on the \(\mathcal U\)-Langrangian of a class of maximum eigenvalue functions
- A UV-decomposition method for a class of maximum eigenvalue optimizations
Uses Software
This page was built for publication: A \(\mathcal{UV}\)-method for a class of constrained minimized problems of maximum eigenvalue functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2397004)
