The \U-Lagrangian of the Maximum Eigenvalue Function
The author discusses the optimization problem \[ \inf_{x \in \mathbb{R}^m} \lambda_1(A(x)), \] where \(\lambda_1(\cdot)\) is the maximum eigenvalue function and \(A: \mathbb{R}^m\) \(\ni x \mapsto A_0 + \mathcal{A}\) \(\cdot x\) is an affine mapping with \(A_0\) and \(\mathcal{A}\) being a real \(n \times n\) symmetric matrix and a linear operator from \( \mathbb{R}^m\) to the space of \(n \times n\) symmetric matrices, respectively. Using the fact that the function \(f:= \lambda_1 \circ A\) is convex, the \(\mathcal{U}\)-Lagrangian theory with the geometrical interpretations of \(\mathcal{U}\)-objects is applied to this problem. It is proved that the Hessian of the \(\mathcal{U}\)-Lagrangian of \(\lambda_1\) can be explicitly computed, i.e. the second-order expansion of the \(\mathcal{U}\)-Lagrangian determines a second order expansion of \(\lambda_1\) along a characteristic smooth manifold given by the set of symmetric matrices with a fixed multiplicity of their maximal eigenvalues. The same result for the Hessian of \(\lambda_1\) is obtained if the transversality condition holds for the affine mapping \(A\). It is shown that the Hessian of the \(\mathcal{U}\)-Lagrangian of the function \(\lambda_1 \circ A\) corresponds to the reduced Hessian used in sequential quadratic programming. Second-order algorithms for minimizing the function \(\lambda_1 \circ A\) are constructed with the help of the \(\mathcal{U}\)-Lagrangian.
- Some results on the U-Langrangian of a class of maximum eigenvalue functions
- A decomposition algorithm for the sums of the largest eigenvalues
- A space decomposition scheme for maximum eigenvalue functions and its applications
- The space decomposition method for the sum of nonlinear convex maximum eigenvalues and its applications
- First- and second-order epi-differentiability in eigenvalue optimization
- The space decomposition theory for a class of semi-infinite maximum eigenvalue optimizations
- Smooth convex approximation to the maximum eigenvalue function
- The space decomposition method for the sum of nonlinear convex maximum eigenvalues and its applications
- \(\mathcal{UV}\)-theory of a class of semidefinite programming and its applications
- A \(\mathcal{UV}\)-method for a class of constrained minimized problems of maximum eigenvalue functions
- A space decomposition scheme for maximum eigenvalue functions and its applications
- Newton methods for nonsmooth convex minimization: connections among \(\mathcal U\)-Lagrangian, Riemannian Newton and SQP methods
- Spectral bundle methods for non-convex maximum eigenvalue functions: first-order methods
- Spectral bundle methods for non-convex maximum eigenvalue functions: second-order methods
- The bundle scheme for solving arbitrary eigenvalue optimizations
- Some results on the U-Langrangian of a class of maximum eigenvalue functions
- The spectral bundle method with second-order information
- A second-order bundle method based on \(\mathcal{UV}\)-decomposition strategy for a special class of eigenvalue optimizations
- Geometrical interpretation of the predictor-corrector type algorithms in structured optimization problems
- The space decomposition theory for a class of eigenvalue optimizations
- The 𝒰-Lagrangian of a convex function
- Second-order conditions for existence of augmented Lagrange multipliers for eigenvalue composite optimization problems
- A decomposition algorithm for the sums of the largest eigenvalues
- On solving the convex semi-infinite minimax problems via superlinear \(\mathcal{VU}\) incremental bundle technique with partial inexact oracle
- A fast space-decomposition scheme for nonconvex eigenvalue optimization
- Growth conditions and \(U\)-Lagrangians
- Harnessing Structure in Composite Nonsmooth Minimization
This page was built for publication: The $\U$-Lagrangian of the Maximum Eigenvalue Function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4702298)