scientific article; zbMATH DE number 724202
From MaRDI portal
Publication:4323601
zbMath0814.90071MaRDI QIDQ4323601
Publication date: 23 February 1995
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
semi-definite programminginterior point methodsmaximum cliquebisection0-1 integer linear programming
Related Items
Exploiting low-rank structure in semidefinite programming by approximate operator splitting, On minimizing the largest eigenvalue of a symmetric matrix, Problems of distance geometry and convex properties of quadratic maps, 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, Exactness criteria for SDP-relaxations of quadratic extremum problems, Robust mean-squared error estimation of multiple signals in linear systems affected by model and noise uncertainties, Elementary Optimality Conditions for Nonlinear SDPs, Exact dual bounds for some nonconvex minimax quadratic optimization problems, An interior-point method for fractional programs with convex constraints, Space tensor conic programming, Method of centers for minimizing generalized eigenvalues, A quadratically convergent local algorithm on minimizing the largest eigenvalue of a symmetric matrix, Least-squares orthogonalization using semidefinite programming
