scientific article; zbMATH DE number 3554030
From MaRDI portal
Publication:4127646
Cited in
(40)- On minimax eigenvalue problems via constrained optimization
- On the need for special purpose algorithms for minimax eigenvalue problems
- Method of centers for minimizing generalized eigenvalues
- A quadratically convergent local algorithm on minimizing the largest eigenvalue of a symmetric matrix
- Spectral partitioning with multiple eigenvectors
- Robust stability and performance analysis of uncertain systems using linear matrix inequalities
- A quadratically convergent local algorithm on minimizing sums of the largest eigenvalues of a symmetric matrix
- Sensitivity analysis of the gratest eigenvalue of a symmetric matrix via the \(\epsilon\)-subdifferential of the associated convex quadratic form
- Optimality conditions and duality theory for minimizing sums of the largest eigenvalues of symmetric matrices
- A computational study of graph partitioning
- On minimizing the largest eigenvalue of a symmetric matrix
- Spectral methods for graph bisection problems.
- Algorithms for graph partitioning problems by means of eigenspace relaxations
- Semidefinite programming
- Non-smooth optimization for robust control of infinite-dimensional systems
- Special backtracking proximal bundle method for nonconvex maximum eigenvalue optimization
- A projection technique for partitioning the nodes of a graph
- Some geometric results in semidefinite programming
- New algorithms for the weighted maximum cut problem on graphs
- The space decomposition method for the sum of nonlinear convex maximum eigenvalues and its applications
- A space decomposition scheme for maximum eigenvalue functions and its applications
- Perron vector optimization applied to search engines
- 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
- Nonconvex bundle method with application to a delamination problem
- The simultaneous computation of a few of the algebraically largest and smallest eigenvalues of a large, sparse, symmetric matrix
- A subgradient algorithm for certain minimax and minisum problems
- Cone-LP's and semidefinite programs: geometry and a simplex-type method
- Second-order conditions for existence of augmented Lagrange multipliers for eigenvalue composite optimization problems
- A fast space-decomposition scheme for nonconvex eigenvalue optimization
- A new Lagrangian net algorithm for solving max-bisection problems
- Semidefinite programming and combinatorial optimization
- Revisiting Spectral Bundle Methods: Primal-Dual (Sub)linear Convergence Rates
- Discrete variable topology optimization for maximizing single/multiple natural frequencies and frequency gaps considering the topological constraint
- Spectrally constrained optimization
- On duality for Boolean programming
- Nondifferentiable optimization algorithm for designing control systems having singular value inequalities
- IQC analysis and synthesis via nonsmooth optimization
- Solving large-scale semidefinite programs in parallel
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4127646)