Pages that link to "Item:Q4389089"
From MaRDI portal
The following pages link to Determinant Maximization with Linear Matrix Inequality Constraints (Q4389089):
Displaying 33 items.
- An efficient algorithm for the Euclidean \(r\)-centrum location problem (Q2570749) (← links)
- Multivariate Gaussians, semidefinite matrix completion, and convex algebraic geometry (Q2634801) (← links)
- On the Implementation and Usage of SDPT3 – A Matlab Software Package for Semidefinite-Quadratic-Linear Programming, Version 4.0 (Q2802544) (← links)
- Computing D-Optimal Experimental Designs for Estimating Treatment Contrasts Under the Presence of a Nuisance Time Trend (Q2833362) (← links)
- Controller coefficient truncation using Lyapunov performance certificate (Q3075951) (← links)
- A Randomized Exchange Algorithm for Computing Optimal Approximate Designs of Experiments (Q3304857) (← links)
- A Maximum Likelihood Approach to Density Estimation with Semidefinite Programming (Q3413092) (← links)
- Complexity of the primal–dual path-following algorithms for the weighted determinant maximization problems with linear matrix inequalities in the narrow neighbourhood (Q3514846) (← links)
- Determinant Optimization on Binary Matrices (Q3598663) (← links)
- On maximizing det<i>X<sup>t</sup>X</i> (Q4304813) (← links)
- Detecting redundancy in optimization problems over intersection of ellipsoids (Q4465477) (← links)
- Optimal Data Fitting: A Moment Approach (Q4555461) (← links)
- An SQP-type Method with Superlinear Convergence for Nonlinear Semidefinite Programming (Q4565262) (← links)
- Construction of efficient experimental designs under multiple resource constraints (Q4628716) (← links)
- Monte Carlo Algorithms for the Detection of Necessary Linear Matrix Inequality Constraints (Q4674254) (← links)
- Multi-start approach for an integer determinant maximization problem (Q4916310) (← links)
- Learning Sparse Causal Gaussian Networks With Experimental Intervention: Regularization and Coordinate Descent (Q4916947) (← links)
- A primal-dual interior point trust-region method for nonlinear semidefinite programming (Q4999340) (← links)
- Convergence to a second-order critical point by a primal-dual interior point trust-region method for nonlinear semidefinite programming (Q5058410) (← links)
- Euclidean Distance Bounds for Linear Matrix Inequalities Analytic Centers Using a Novel Bound on the Lambert Function (Q5065058) (← links)
- Some New Methods for Generating Convex Functions (Q5114161) (← links)
- Efficient Solution of Maximum-Entropy Sampling Problems (Q5144798) (← links)
- On the Bijectivity of Thin-Plate Splines (Q5195005) (← links)
- A Matrix Positivstellensatz with Lifting Polynomials (Q5210520) (← links)
- Smoothing method for minimizing the sum of the<i>r</i>largest functions (Q5758222) (← links)
- LMI approximations for the radius of the intersection of ellipsoids: Survey. (Q5929424) (← links)
- Constrained MPC for uncertain linear systems with ellipsoidal target sets. (Q5958667) (← links)
- Estimating structured high-dimensional covariance and precision matrices: optimal rates and adaptive estimation (Q5965313) (← links)
- Finding Bayesian Optimal Designs for Nonlinear Models: A Semidefinite Programming‐Based Approach (Q6064606) (← links)
- Computation of robust control invariant sets with predefined complexity for uncertain systems (Q6068519) (← links)
- Quantized output-feedback control of piecewise-affine systems with reachable regions of quantized measurements (Q6564901) (← links)
- Maximum likelihood thresholds via graph rigidity (Q6591597) (← links)
- Bayesian Structure Learning in Undirected Gaussian Graphical Models: Literature Review with Empirical Comparison (Q6651425) (← links)
