| Publication | Date of Publication | Type |
|---|
Exploiting cone approximations in an augmented Lagrangian method for conic optimization
Optimization Methods & Software | 2026-03-03 | Paper |
Exact SDP relaxations for quadratic programs with bipartite graph structures
Journal of Global Optimization | 2023-07-13 | Paper |
New Bregman proximal type algoritms for solving DC optimization problems
Computational Optimization and Applications | 2023-05-04 | Paper |
Exact SDP relaxations of quadratically constrained quadratic programs with forest structures
Journal of Global Optimization | 2022-03-15 | Paper |
Nearly optimal first-order methods for convex optimization under gradient norm measure: an adaptive regularization approach
Journal of Optimization Theory and Applications | 2021-06-15 | Paper |
A dual spectral projected gradient method for log-determinant semidefinite problems
Computational Optimization and Applications | 2020-04-07 | Paper |
A family of subgradient-based methods for convex optimization problems in a unifying framework
Optimization Methods & Software | 2016-11-08 | Paper |
Latest Developments in the SDPA Family for Solving Large-Scale SDPs
International Series in Operations Research & Management Science | 2016-04-26 | Paper |
Variational approach to electronic structure calculations on second-order reduced density matrices and the N-representability problem
Complex Quantum Systems | 2016-01-29 | Paper |
Algorithm 925, parallel solver for semidefinite programming problem having sparse Schur complement matrix
ACM Transactions on Mathematical Software | 2014-09-12 | Paper |
SDPA PROJECT : SOLVING LARGE-SCALE SEMIDEFINITE PROGRAMS(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)
Journal of the Operations Research Society of Japan | 2008-04-29 | Paper |
Large-scale semidefinite programs in electronic structure calculation
Mathematical Programming. Series A. Series B | 2007-03-05 | Paper |
Preprocessing sparse semidefinite programs via matrix completion
Optimization Methods & Software | 2006-03-29 | Paper |
Exploiting sparsity in semidefinite programming via matrix completion. II: Implementation and numerical results
Mathematical Programming. Series A. Series B | 2003-10-29 | Paper |
Lagrangian Dual Interior-Point Methods for Semidefinite Programs
SIAM Journal on Optimization | 2003-01-05 | Paper |
Branch-and-cut algorithms for the bilinear matrix inequality eigenvalue problem
Computational Optimization and Applications | 2002-02-10 | Paper |
Solving sparse semidefinite programs by matrix completion. I
RIMS Kokyuroku | 2001-09-23 | Paper |
Solving sparse semidefinite programs by matrix completion. II
RIMS Kokyuroku | 2001-09-23 | Paper |
| scientific article; zbMATH DE number 1560353 (Why is no real title available?) | 2001-04-26 | Paper |
Exploiting sparsity in semidefinite programming via matrix completion. I: General framework
SIAM Journal on Optimization | 2001-03-19 | Paper |
| scientific article; zbMATH DE number 1568150 (Why is no real title available?) | 2001-02-21 | Paper |
| scientific article; zbMATH DE number 1489802 (Why is no real title available?) | 2000-10-23 | Paper |
