Publication:4323601
From MaRDI portal
zbMath0814.90071MaRDI QIDQ4323601
Publication date: 23 February 1995
semi-definite programming; interior point methods; maximum clique; bisection; 0-1 integer linear programming
90C05: Linear programming
Related Items
Method of centers for minimizing generalized eigenvalues, A quadratically convergent local algorithm on minimizing the largest eigenvalue of a symmetric matrix, On minimizing the largest eigenvalue of a symmetric matrix, Problems of distance geometry and convex properties of quadratic maps, An interior-point method for fractional programs with convex constraints, An interior-point method for multifractional programs with convex constraints, Extension of Karmarkar's algorithm onto convex quadratically constrained quadratic problems, A primal-dual potential reduction method for problems involving matrix inequalities, Robust mean-squared error estimation of multiple signals in linear systems affected by model and noise uncertainties, Least-squares orthogonalization using semidefinite programming