Author of the publication

Preprocessing sparse semidefinite programs via matrix completion.

, , and . Optim. Methods Softw., 21 (1): 17-39 (2006)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

A dual spectral projected gradient method for log-determinant semidefinite problems., , , and . Comput. Optim. Appl., 76 (1): 33-68 (2020)Branch-and-Cut Algorithms for the Bilinear Matrix Inequality Eigenvalue Problem., and . Comput. Optim. Appl., 19 (1): 79-105 (2001)Lagrangian Dual Interior-Point Methods for Semidefinite Programs., , and . SIAM J. Optimization, 12 (4): 1007-1031 (2002)Exploiting sparsity in semidefinite programming via matrix completion II: implementation and numerical results., , and . Math. Program., 95 (2): 303-327 (2003)Preprocessing sparse semidefinite programs via matrix completion., , and . Optim. Methods Softw., 21 (1): 17-39 (2006)New Bregman proximal type algorithms for solving DC optimization problems., , and . Comput. Optim. Appl., 83 (3): 893-931 (2022)Exploiting Sparsity in Semidefinite Programming via Matrix Completion I: General Framework., , , and . SIAM J. Optimization, 11 (3): 647-674 (2001)Algorithm 925: Parallel Solver for Semidefinite Programming Problem having Sparse Schur Complement Matrix., , , , and . ACM Trans. Math. Softw., 39 (1): 6:1-6:22 (2012)Exact SDP relaxations of quadratically constrained quadratic programs with forest structures., , , and . J. Glob. Optim., 82 (2): 243-262 (2022)Large-scale semidefinite programs in electronic structure calculation., , , , , , and . Math. Program., 109 (2-3): 553-580 (2007)