Pages that link to "Item:Q4389089"
From MaRDI portal
The following pages link to Determinant Maximization with Linear Matrix Inequality Constraints (Q4389089):
Displaying 50 items.
- Efficient computational algorithm for optimal allocation in regression models (Q390453) (← links)
- Multiplicative methods for computing \(D\)-optimal stratified designs of experiments (Q393589) (← links)
- An interior point method with a primal-dual quadratic barrier penalty function for nonlinear semidefinite programming (Q457716) (← links)
- Relative entropy optimization and its applications (Q507310) (← links)
- Barycentric algorithm for computing D-optimal size- and cost-constrained designs of experiments (Q513974) (← links)
- A class of semidefinite programs with rank-one solutions (Q551300) (← links)
- An inexact interior point method for \(L_{1}\)-regularized sparse covariance selection (Q621755) (← links)
- Computing optimal designs of multiresponse experiments reduces to second-order cone program\-ming (Q629098) (← links)
- Semidefinite programming for discrete optimization and matrix completion problems (Q697582) (← links)
- A primal-dual interior point method for nonlinear semidefinite programming (Q715092) (← links)
- Minimum-volume enclosing ellipsoids and core sets (Q813369) (← links)
- Optimal ellipsoids and decomposition of positive definite matrices (Q878510) (← links)
- Computing exact \(D\)-optimal designs by mixed integer second-order cone programming (Q888509) (← links)
- Scale-invariant clustering with minimum volume ellipsoids (Q941528) (← links)
- On the convexity of a class of quadratic mappings and its application to the problem of finding the smallest ball enclosing a given intersection of balls (Q946350) (← links)
- Computing \(c\)-optimal experimental designs using the simplex method of linear programming (Q961110) (← links)
- Applications of second-order cone programming (Q1124764) (← links)
- Applications of semidefinite programming (Q1294557) (← links)
- Piecewise-linear robust control of systems with input constraints (Q1306060) (← links)
- Computing efficient exact designs of experiments using integer quadratic programming (Q1621402) (← links)
- On constrained estimation of graphical time series models (Q1662855) (← links)
- Approximate optimal designs for multivariate polynomial regression (Q1731748) (← links)
- Computation of low-complexity control-invariant sets for systems with uncertain parameter dependence (Q1737736) (← links)
- Maximum-entropy sampling and the Boolean quadric polytope (Q1756791) (← links)
- Monitoring the covariance matrix with fewer observations than variables (Q1800078) (← links)
- Primal-dual path-following algorithms for determinant maximization problems with linear matrix inequalities (Q1819153) (← links)
- Ellipsoidal bounds for uncertain linear equations and dynamical systems (Q1879588) (← links)
- Enclosing ellipsoids and elliptic cylinders of semialgebraic sets and their application to error bounds in polynomial optimization (Q1949261) (← links)
- Optimal and robust waveform design for MIMO radars in the presence of clutter (Q1957223) (← links)
- An interior point sequential quadratic programming-type method for log-determinant semi-infinite programs (Q1987416) (← links)
- A survey on conic relaxations of optimal power flow problem (Q2023908) (← links)
- On the use of Jordan algebras for improving global convergence of an augmented Lagrangian method in nonlinear semidefinite programming (Q2044492) (← links)
- Optimal design of multifactor experiments via grid exploration (Q2058892) (← links)
- Maximizing products of linear forms, and the permanent of positive semidefinite matrices (Q2133425) (← links)
- \( H_\infty\) control for continuous-time Markov jump nonlinear systems with piecewise-affine approximation (Q2139418) (← links)
- Mean estimation with sub-Gaussian rates in polynomial time (Q2196216) (← links)
- Robust trade-off portfolio selection (Q2218875) (← links)
- Network exploration via the adaptive LASSO and SCAD penalties (Q2270657) (← links)
- Alternating direction method for covariance selection models (Q2276406) (← links)
- Optimality conditions and global convergence for nonlinear semidefinite programming (Q2297647) (← links)
- A line search exact penalty method for nonlinear semidefinite programming (Q2301144) (← links)
- On multiple-objective optimal designs (Q2317275) (← links)
- Computing weighted analytic center for linear matrix inequalities using infeasible Newton's method (Q2337073) (← links)
- Robust optimal control with adjustable uncertainty sets (Q2374497) (← links)
- On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids (Q2381536) (← links)
- Adaptive detection of distributed targets in Gaussian clutter based on multiple a-priori spectral models (Q2398244) (← links)
- Extending a refinement of Koteljanskiĭ's inequality (Q2419056) (← links)
- Optimal experimental design and some related control problems (Q2440603) (← links)
- D-optimal design of a monitoring network for parameter estimation of distributed systems (Q2454730) (← links)
- A generalization of Voronoi's reduction theory and its application (Q2481522) (← links)
