scientific article; zbMATH DE number 3554030
From MaRDI portal
Publication:4127646
zbMath0355.90054MaRDI QIDQ4127646
Philip Wolfe, Wilm Donath, Jane K. Cullum
Publication date: 1975
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (38)
A computational study of graph partitioning ⋮ On minimax eigenvalue problems via constrained optimization ⋮ The bundle scheme for solving arbitrary eigenvalue optimizations ⋮ On minimizing the largest eigenvalue of a symmetric matrix ⋮ Nonconvex bundle method with application to a delamination problem ⋮ A projection technique for partitioning the nodes of a graph ⋮ On the need for special purpose algorithms for minimax eigenvalue problems ⋮ Some geometric results in semidefinite programming ⋮ Non-smooth optimization for robust control of infinite-dimensional systems ⋮ New algorithms for the weighted maximum cut problem on graphs ⋮ IQC analysis and synthesis via nonsmooth optimization ⋮ Solving large-scale semidefinite programs in parallel ⋮ Special backtracking proximal bundle method for nonconvex maximum eigenvalue optimization ⋮ 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 ⋮ Revisiting Spectral Bundle Methods: Primal-Dual (Sub)linear Convergence Rates ⋮ Spectral methods for graph bisection problems. ⋮ Perron vector optimization applied to search engines ⋮ Second-order conditions for existence of augmented Lagrange multipliers for eigenvalue composite optimization problems ⋮ Cone-LP's and semidefinite programs: Geometry and a simplex-type method ⋮ A fast space-decomposition scheme for nonconvex eigenvalue optimization ⋮ Semidefinite programming and combinatorial optimization ⋮ A new Lagrangian net algorithm for solving max-bisection problems ⋮ 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 ⋮ Method of centers for minimizing generalized eigenvalues ⋮ A quadratically convergent local algorithm on minimizing the largest eigenvalue of a symmetric matrix ⋮ On duality for Boolean programming ⋮ Spectral partitioning with multiple eigenvectors ⋮ Robust stability and performance analysis of uncertain systems using linear matrix inequalities ⋮ Algorithms for graph partitioning problems by means of eigenspace relaxations ⋮ Nondifferentiable optimization algorithm for designing control systems having singular value inequalities ⋮ Spectral bundle methods for non-convex maximum eigenvalue functions: first-order methods ⋮ Spectral bundle methods for non-convex maximum eigenvalue functions: second-order methods ⋮ A quadratically convergent local algorithm on minimizing sums of the largest eigenvalues of a symmetric matrix ⋮ Semidefinite programming ⋮ 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
This page was built for publication:
