scientific article; zbMATH DE number 1489802
From MaRDI portal
Publication:4496019
zbMath0952.90047MaRDI QIDQ4496019
Mituhiro Fukuda, Katsuki Fujisawa, Kazuhide Nakata, Kojima, Masakazu
Publication date: 23 October 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Interior-point methods (90C51)
Related Items (18)
Incomplete orthogonalization preconditioners for solving large and dense linear systems which arise from semidefinite programming ⋮ A conversion of an SDP having free variables into the standard form SDP ⋮ A nonmonotone GRASP ⋮ Computing Gaussian \& exponential measures of semi-algebraic sets ⋮ Facial reduction algorithms for conic optimization problems ⋮ An equivalent nonlinear optimization model with triangular low-rank factorization for semidefinite programs ⋮ An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem ⋮ Semi-definite programming for topology optimization of trusses under multiple eigenvalue constraints ⋮ A Max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO) ⋮ A robust Lagrangian-DNN method for a class of quadratic optimization problems ⋮ Solving the 3d Ising model with the conformal bootstrap. II: \(c\)-minimization and precise critical exponents ⋮ Semidefinite programming for discrete optimization and matrix completion problems ⋮ Exploiting Sparsity in SDP Relaxation of Polynomial Optimization Problems ⋮ Semidefinite and second-order cone optimization approach for the Toeplitz matrix approximation problem ⋮ Mixed linear and semidefinite programming for combinatorial and quadratic optimization ⋮ Sdpha: a Matlab implementation of homogeneous interior-point algorithms for semidefinite programming ⋮ SDPLIB 1.2, a library of semidefinite programming test problems ⋮ Rank-constrained fundamental matrix estimation by polynomial global optimization versus the eight-point algorithm
Uses Software
This page was built for publication:
