| Publication | Date of Publication | Type |
|---|
An infeasible interior-point arc-search method with Nesterov's restarting strategy for linear programming problems
Computational Optimization and Applications | 2024-05-17 | Paper |
Exact Matrix Completion via High-Rank Matrices in Sum-of-Squares Relaxations
| 2023-11-24 | Paper |
Exact SDP relaxations for quadratic programs with bipartite graph structures
Journal of Global Optimization | 2023-07-13 | Paper |
Exact SDP relaxations of quadratically constrained quadratic programs with forest structures
Journal of Global Optimization | 2022-03-15 | Paper |
An infeasible interior-point arc-search algorithm for nonlinear constrained optimization
Numerical Algorithms | 2022-01-13 | Paper |
Polyhedral-based methods for mixed-integer SOCP in tree breeding
| 2020-11-12 | Paper |
A dual spectral projected gradient method for log-determinant semidefinite problems
Computational Optimization and Applications | 2020-04-07 | Paper |
Conic relaxation approaches for equal deployment problems
Discrete Applied Mathematics | 2020-02-20 | Paper |
Solving pooling problems with time discretization by LP and SOCP relaxations and rescheduling methods
Journal of Global Optimization | 2019-12-03 | Paper |
On the conditions for the finite termination of ADMM and its applications to SOS polynomials feasibility problems
Computational Optimization and Applications | 2019-11-22 | Paper |
An efficient second-order cone programming approach for optimal selection in tree breeding
Optimization Letters | 2018-10-23 | Paper |
An arc-search \({\mathcal {O}}(nL)\) infeasible-interior-point algorithm for linear programming
Optimization Letters | 2018-08-03 | Paper |
Algorithm 920: SFSDP: a sparse version of full semidefinite programming relaxation for sensor network localization problems
ACM Transactions on Mathematical Software | 2017-05-19 | Paper |
Latest Developments in the SDPA Family for Solving Large-Scale SDPs
International Series in Operations Research & Management Science | 2016-04-26 | Paper |
Fast implementation for semidefinite programs with positive matrix completion
Optimization Methods \& Software | 2015-12-28 | Paper |
Algorithm 925, parallel solver for semidefinite programming problem having sparse Schur complement matrix
ACM Transactions on Mathematical Software | 2014-09-12 | Paper |
Correlative sparsity structures and semidefinite relaxations for concave cost transportation problems with change of variables
Journal of Global Optimization | 2013-08-01 | Paper |
Enclosing ellipsoids and elliptic cylinders of semialgebraic sets and their application to error bounds in polynomial optimization
Mathematical Programming. Series A. Series B | 2013-05-06 | Paper |
Constructing polyhedral homotopies on grid-of-clusters
| 2011-10-21 | Paper |
Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion
Mathematical Programming. Series A. Series B | 2011-09-27 | 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 |
SOLVING LARGE SCALE OPTIMIZATION PROBLEMS VIA GRID AND CLUSTER COMPUTING(<Special Issue>Network Design, Control and Optimization)
Journal of the Operations Research Society of Japan | 2005-04-23 | Paper |
Implementation and evaluation of SDPA 6.0 (Semidefinite Programming Algorithm 6.0)
Optimization Methods \& Software | 2005-04-05 | Paper |
Second Order Cone Programming Relaxation of a Positive Semidefinite Constraint
Optimization Methods \& Software | 2005-03-07 | Paper |
An infeasible interior-point arc-search method with Nesterov's restarting strategy for linear programming problems
| N/A | Paper |
An inexact infeasible arc-search interior-point method for linear programming problems
| N/A | Paper |
