Spectral bundle methods for non-convex maximum eigenvalue functions: second-order methods
From MaRDI portal
Publication:2576742
DOI10.1007/s10107-005-0635-yzbMath1124.90035OpenAlexW2025051282MaRDI QIDQ2576742
Pierre Apkarian, Dominikus Noll
Publication date: 14 December 2005
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-005-0635-y
linear matrix inequality (LMI)semidefinite programming (SDP)Eigenvalue optimizationbilinear matrix inequality (BMI)superlinear and quadratic convergencefirst and second-order spectral bundle method
Related Items
Survey Descent: A Multipoint Generalization of Gradient Descent for Nonsmooth Optimization, Generalized derivatives of eigenvalues of a symmetric matrix, A homotopy method for nonlinear semidefinite programming, Special backtracking proximal bundle method for nonconvex maximum eigenvalue optimization, A space decomposition scheme for maximum eigenvalue functions and its applications, Harnessing Structure in Composite Nonsmooth Minimization, The space decomposition method for the sum of nonlinear convex maximum eigenvalues and its applications, The space decomposition theory for a class of eigenvalue optimizations, The space decomposition theory for a class of semi-infinite maximum eigenvalue optimizations, Second-order nonsmooth optimization for \(H_{\infty}\) synthesis, A homotopy method based on penalty function for nonlinear semidefinite programming, A fast space-decomposition scheme for nonconvex eigenvalue optimization, Worst‐case stability and performance with mixed parametric and dynamic uncertainties, Local convergence of an augmented Lagrangian method for matrix inequality constrained programming, An alternating direction method for solving convex nonlinear semidefinite programming problems, Spectral bundle methods for non-convex maximum eigenvalue functions: first-order methods
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nondifferentiable optimization algorithm for designing control systems having singular value inequalities
- Proximity control in bundle methods for convex nondifferentiable minimization
- Extremal problems on the set of nonnegative definite matrices
- First- and second-order epi-differentiability in eigenvalue optimization
- Local analysis of Newton-type methods for variational inequalities and nonlinear programming
- Optimality conditions and duality theory for minimizing sums of the largest eigenvalues of symmetric matrices
- Optimization. Algorithms and consistent approximations
- First and second order analysis of nonlinear semidefinite programs
- New variants of bundle methods
- Methods of descent for nondifferentiable optimization
- Nonsmooth optimization for multidisk \(H_\infty\) synthesis
- La méthode des centres dans un espace topologique
- Spectral bundle methods for non-convex maximum eigenvalue functions: first-order methods
- Controller Design via Nonsmooth Multidirectional Search
- Semi-Definite Matrix Constraints in Optimization
- Optimization and nonsmooth analysis
- On Minimizing the Maximum Eigenvalue of a Symmetric Matrix
- Large-Scale Optimization of Eigenvalues
- Avoiding the Maratos Effect by Means of a Nonmonotone Line Search. II. Inequality Constrained Problems—Feasible Iterates
- A Hybrid Algorithm for Optimizing Eigenvalues of Symmetric Definite Pencils
- Trust Region Methods
- Minimizing Nonconvex Nonsmooth Functions via Cutting Planes and Proximity Control
- 𝒱𝒰-smoothness and proximal point results for some nonconvex functions
- The 𝒰-Lagrangian of a convex function
- The $\U$-Lagrangian of the Maximum Eigenvalue Function
- Second Derivatives for Optimizing Eigenvalues of Symmetric Matrices
- On Eigenvalue Optimization
- ON MATRICES DEPENDING ON PARAMETERS
- A second-order bundle method to minimize the maximum eigenvalue function.
- Nonlinear programming without a penalty function.
