Method of centers for minimizing generalized eigenvalues

Linear Algebra and Its Applications

Volumn 188-189, Issue C, 1993, Pages 63-111

  Boyd, Stephen ^a   El Ghaoui, Laurent ^b  

^a STANFORD UNIVERSITY   (United States)

^b ENSTA PARISTECH   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 43949163936     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/0024-3795(93)90465-Z     Document Type: Article

References (54)

1. Combinatorial Optimization with Interior Point Methods and Semidefinite Matrices
2. Combinatorial optimization with semidefinite matrices
3. Optimization over the positive-definite cone: Interior point methods and combinatorial applications
4. On maximizing the minimum eigenvalue of a linear combination of symmetric matrices
5. Computing bounds for the structured singular value via an interior point algorithm
6. The ellipsoid method: A survey
7. Structured and simultaneous Lyapunov functions for system stability problems
8. The minimization of certain nondifferentiable sums of eigenvalues of symmetric matrices
9. Linear programming with matrix variables
10. Iterative solution of problems of linear and quadratic programming
11. On maximizing a robustness measure for structured nonlinear perturbations
12. Design of stabilizing state feedback for delay systems via convex optimization
13. 2 related problems
14. Semidefinite matrix constraints in optimization
15. On minimizing the largest eigenvalue of a symmetric matrix
16. The formulation and analysis of numerical methods for inverse eigenvalue problems
17. Khachiyan's algorithm for linear programming
18. On minimax eigenvalue problems via constrained optimization
19. On Shape Optimizing the Ratio of the First Two Eigenvalues of the Laplacian
20. Technical Report 91-8
21. A new polynomial-time algorithm for linear programming
22. The cutting-plane method for solving convex programs
23. A polynomial algorithm in linear programming
24. On some efficient interior point methods for nonlinear convex programming
25. La méthode des centres dans un espace topologique
26. Conic Formulation of a Convex Programming Problem and Duality
27. On minimizing the maximum eigenvalue of a symmetric matrix
28. Large-scale optimization of eigenvalues
29. On the sum of the largest eigenvalues of a symmetric matrix
30. On the need for special purpose algorithms for minimax eigenvalue problems
31. Numerical method of construction of Lyapunov functions and absolute stability criteria in the form of numerical procedures
32. A nondifferentiable optimization algorithm for the design of control systems subject to singular value inequalities over a frequency range
33. Optimal Design of Nonlinear Shell Structures
34. Extremal problems on the set of nonnegative definite matrices
35. Minimization Methods for Non-differentiable Functions
36. An “analytical centre” for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming
37. New algorithms in convex programming based on a notion of “centre” (for systems of analytic inequalities) and on rational extrapolation
38. Applications of analytic centers
39. Interior methods for constrained optimization