Monte Carlo Algorithms for the Detection of Necessary Linear Matrix Inequality Constraints (Q4674254): Difference between revisions

@@ Property / cites work @@
+Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
+Normal rank
@@ Property / cites work @@
+Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization
+Normal rank
@@ Property / cites work @@
+Bayesian stopping rules for multistart global optimization methods
+Normal rank
@@ Property / cites work @@
+On Trivial and Binding Constraints in Programming Problems
+Normal rank
@@ Property / cites work @@
+On the best case performance of hit and run methods for detecting necessary constraints
+Normal rank
@@ Property / cites work @@
+Primal--Dual Path-Following Algorithms for Semidefinite Programming
+Normal rank
@@ Property / cites work @@
+Efficient Monte Carlo Procedures for Generating Points Uniformly Distributed over Bounded Regions
+Normal rank
@@ Property / cites work @@
+Semidefinite Programming
@@ Property / cites work: Semidefinite Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Determinant Maximization with Linear Matrix Inequality Constraints
+Normal rank
@@ Property / cites work @@
+Some applications of optimization in matrix theory
+Normal rank