A Primal-Dual Potential Reduction Method for Problems Involving Matrix Inequalities (1995)

by Lieven Vandenberghe , Stephen Boyd
Venue:in Protocol Testing and Its Complexity", Information Processing Letters Vol.40
Citations:99 - 20 self

Documents Related by Co-Citation

525 Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization – Farid Alizadeh - 1993
236 An Interior-Point Method for Semidefinite Programming – Christoph Helmberg, Franz Rendl, Robert J. Vanderbei, Henry Wolkowicz - 2005
70 Interior-point methods for the monotone linear complementarity problem in symmetric matrices – M Kojima, S Shindoh, S Hara - 1997
200 Primal-Dual Interior-Point Methods for Self-Scaled Cones – Yu Nesterov, M. J. Todd - 1995
48 An interior-point method for minimizing the maximum eigenvalue of a linear combination of matrices – F Jarre - 1993
978 Semidefinite Programming – Lieven Vandenberghe, Stephen Boyd - 1996
280 Interior point polynomial methods in Convex Programming: theory and applications – Nesterov, A Nemirovski - 1994
6106 Matrix Analysis – R A Horn, C R Johnson - 1991
1098 Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming – M. X. Goemans, D.P. Williamson - 1995