The following pages link to (Q4127646):
Displaying 38 items.
- Nonconvex bundle method with application to a delamination problem (Q316176) (← links)
- Second-order conditions for existence of augmented Lagrange multipliers for eigenvalue composite optimization problems (Q496593) (← links)
- A fast space-decomposition scheme for nonconvex eigenvalue optimization (Q526388) (← links)
- A new Lagrangian net algorithm for solving max-bisection problems (Q544198) (← links)
- On duality for Boolean programming (Q750292) (← links)
- Nondifferentiable optimization algorithm for designing control systems having singular value inequalities (Q788989) (← links)
- IQC analysis and synthesis via nonsmooth optimization (Q864474) (← links)
- Solving large-scale semidefinite programs in parallel (Q868469) (← links)
- On minimax eigenvalue problems via constrained optimization (Q1090242) (← links)
- On the need for special purpose algorithms for minimax eigenvalue problems (Q1107092) (← links)
- Method of centers for minimizing generalized eigenvalues (Q1260783) (← links)
- A quadratically convergent local algorithm on minimizing the largest eigenvalue of a symmetric matrix (Q1260789) (← links)
- Spectral partitioning with multiple eigenvectors (Q1276952) (← links)
- Robust stability and performance analysis of uncertain systems using linear matrix inequalities (Q1289389) (← links)
- A quadratically convergent local algorithm on minimizing sums of the largest eigenvalues of a symmetric matrix (Q1312086) (← links)
- Sensitivity analysis of the gratest eigenvalue of a symmetric matrix via the \(\epsilon\)-subdifferential of the associated convex quadratic form (Q1321302) (← links)
- Optimality conditions and duality theory for minimizing sums of the largest eigenvalues of symmetric matrices (Q1321653) (← links)
- A computational study of graph partitioning (Q1340061) (← links)
- On minimizing the largest eigenvalue of a symmetric matrix (Q1345514) (← links)
- Spectral methods for graph bisection problems. (Q1406654) (← links)
- Algorithms for graph partitioning problems by means of eigenspace relaxations (Q1577115) (← links)
- Semidefinite programming (Q1600854) (← links)
- Non-smooth optimization for robust control of infinite-dimensional systems (Q1653334) (← links)
- Special backtracking proximal bundle method for nonconvex maximum eigenvalue optimization (Q1664251) (← links)
- A projection technique for partitioning the nodes of a graph (Q1904714) (← links)
- Some geometric results in semidefinite programming (Q1905963) (← links)
- New algorithms for the weighted maximum cut problem on graphs (Q1907796) (← links)
- The space decomposition method for the sum of nonlinear convex maximum eigenvalues and its applications (Q2190318) (← links)
- A space decomposition scheme for maximum eigenvalue functions and its applications (Q2407989) (← links)
- Perron vector optimization applied to search engines (Q2448379) (← links)
- Spectral bundle methods for non-convex maximum eigenvalue functions: first-order methods (Q2576741) (← links)
- Spectral bundle methods for non-convex maximum eigenvalue functions: second-order methods (Q2576742) (← links)
- The bundle scheme for solving arbitrary eigenvalue optimizations (Q2628175) (← links)
- The simultaneous computation of a few of the algebraically largest and smallest eigenvalues of a large, sparse, symmetric matrix (Q4172855) (← links)
- A subgradient algorithm for certain minimax and minisum problems (Q4174536) (← links)
- Cone-LP's and semidefinite programs: Geometry and a simplex-type method (Q4645921) (← links)
- Semidefinite programming and combinatorial optimization (Q5906394) (← links)
- Revisiting Spectral Bundle Methods: Primal-Dual (Sub)linear Convergence Rates (Q6114786) (← links)