The following pages link to Makoto Yamashita (Q717128):
Displaying 24 items.
- Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion (Q717129) (← links)
- Large-scale semidefinite programs in electronic structure calculation (Q868461) (← links)
- An arc-search \({\mathcal {O}}(nL)\) infeasible-interior-point algorithm for linear programming (Q1653277) (← links)
- An efficient second-order cone programming approach for optimal selection in tree breeding (Q1800455) (← links)
- Enclosing ellipsoids and elliptic cylinders of semialgebraic sets and their application to error bounds in polynomial optimization (Q1949261) (← links)
- A dual spectral projected gradient method for log-determinant semidefinite problems (Q1986103) (← links)
- On the conditions for the finite termination of ADMM and its applications to SOS polynomials feasibility problems (Q2007822) (← links)
- Solving pooling problems with time discretization by LP and SOCP relaxations and rescheduling methods (Q2010087) (← links)
- An infeasible interior-point arc-search algorithm for nonlinear constrained optimization (Q2066199) (← links)
- Exact SDP relaxations of quadratically constrained quadratic programs with forest structures (Q2114577) (← links)
- Conic relaxation approaches for equal deployment problems (Q2297663) (← links)
- Correlative sparsity structures and semidefinite relaxations for concave cost transportation problems with change of variables (Q2392116) (← links)
- Latest Developments in the SDPA Family for Solving Large-Scale SDPs (Q2802543) (← links)
- Algorithm 920 (Q2989170) (← links)
- (Q3094209) (← links)
- Algorithm 925 (Q3189662) (← links)
- Fast implementation for semidefinite programs with positive matrix completion (Q3458828) (← links)
- Second Order Cone Programming Relaxation of a Positive Semidefinite Constraint (Q4653548) (← links)
- Implementation and evaluation of SDPA 6.0 (Semidefinite Programming Algorithm 6.0) (Q4664050) (← links)
- SOLVING LARGE SCALE OPTIMIZATION PROBLEMS VIA GRID AND CLUSTER COMPUTING(<Special Issue>Network Design, Control and Optimization) (Q4671022) (← links)
- Polyhedral-based Methods for Mixed-Integer SOCP in Tree Breeding (Q5132747) (← links)
- SDPA PROJECT : SOLVING LARGE-SCALE SEMIDEFINITE PROGRAMS(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan) (Q5385033) (← links)
- Exact SDP relaxations for quadratic programs with bipartite graph structures (Q6173960) (← links)
- An infeasible interior-point arc-search method with Nesterov's restarting strategy for linear programming problems (Q6509026) (← links)