Primal-dual path-following algorithms for determinant maximization problems with linear matrix inequalities
From MaRDI portal
Publication:1819153
DOI10.1023/A:1026400522929zbMath0961.90129MaRDI QIDQ1819153
Publication date: 5 January 2000
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Related Items (9)
On how to solve large-scale log-determinant optimization problems ⋮ On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids ⋮ Clustering via minimum volume ellipsoids ⋮ Complexity of the primal–dual path-following algorithms for the weighted determinant maximization problems with linear matrix inequalities in the narrow neighbourhood ⋮ Enclosing ellipsoids and elliptic cylinders of semialgebraic sets and their application to error bounds in polynomial optimization ⋮ Multi-start approach for an integer determinant maximization problem ⋮ On the Implementation and Usage of SDPT3 – A Matlab Software Package for Semidefinite-Quadratic-Linear Programming, Version 4.0 ⋮ A Maximum Likelihood Approach to Density Estimation with Semidefinite Programming ⋮ Minimum-volume enclosing ellipsoids and core sets
This page was built for publication: Primal-dual path-following algorithms for determinant maximization problems with linear matrix inequalities
