Makoto Yamashita

From MaRDI portal
Person:717128

Available identifiers

zbMath Open yamashita.makoto.1MaRDI QIDQ717128

List of research outcomes





PublicationDate of PublicationType
An infeasible interior-point arc-search method with Nesterov's restarting strategy for linear programming problems2024-05-17Paper
Exact Matrix Completion via High-Rank Matrices in Sum-of-Squares Relaxations2023-11-24Paper
Exact SDP relaxations for quadratic programs with bipartite graph structures2023-07-13Paper
Exact SDP relaxations of quadratically constrained quadratic programs with forest structures2022-03-15Paper
An infeasible interior-point arc-search algorithm for nonlinear constrained optimization2022-01-13Paper
Polyhedral-based Methods for Mixed-Integer SOCP in Tree Breeding2020-11-12Paper
A dual spectral projected gradient method for log-determinant semidefinite problems2020-04-07Paper
Conic relaxation approaches for equal deployment problems2020-02-20Paper
Solving pooling problems with time discretization by LP and SOCP relaxations and rescheduling methods2019-12-03Paper
On the conditions for the finite termination of ADMM and its applications to SOS polynomials feasibility problems2019-11-22Paper
An efficient second-order cone programming approach for optimal selection in tree breeding2018-10-23Paper
An arc-search \({\mathcal {O}}(nL)\) infeasible-interior-point algorithm for linear programming2018-08-03Paper
Algorithm 9202017-05-19Paper
Latest Developments in the SDPA Family for Solving Large-Scale SDPs2016-04-26Paper
Fast implementation for semidefinite programs with positive matrix completion2015-12-28Paper
Algorithm 9252014-09-12Paper
Correlative sparsity structures and semidefinite relaxations for concave cost transportation problems with change of variables2013-08-01Paper
Enclosing ellipsoids and elliptic cylinders of semialgebraic sets and their application to error bounds in polynomial optimization2013-05-06Paper
https://portal.mardi4nfdi.de/entity/Q30942092011-10-21Paper
Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion2011-09-27Paper
SDPA PROJECT : SOLVING LARGE-SCALE SEMIDEFINITE PROGRAMS(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)2008-04-29Paper
Large-scale semidefinite programs in electronic structure calculation2007-03-05Paper
SOLVING LARGE SCALE OPTIMIZATION PROBLEMS VIA GRID AND CLUSTER COMPUTING(<Special Issue>Network Design, Control and Optimization)2005-04-23Paper
Implementation and evaluation of SDPA 6.0 (Semidefinite Programming Algorithm 6.0)2005-04-05Paper
Second Order Cone Programming Relaxation of a Positive Semidefinite Constraint2005-03-07Paper
An infeasible interior-point arc-search method with Nesterov's restarting strategy for linear programming problemsN/APaper
An inexact infeasible arc-search interior-point method for linear programming problemsN/APaper

Research outcomes over time

This page was built for person: Makoto Yamashita