Determinant Maximization with Linear Matrix Inequality Constraints
From MaRDI portal
Publication:4389089
DOI10.1137/S0895479896303430zbMath0959.90039WikidataQ115802412 ScholiaQ115802412MaRDI QIDQ4389089
Shao-Po Wu, Lieven Vandenberghe, Stephen P. Boyd
Publication date: 11 May 1998
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Related Items
Ellipsoidal bounds for uncertain linear equations and dynamical systems, Computing efficient exact designs of experiments using integer quadratic programming, Maximizing products of linear forms, and the permanent of positive semidefinite matrices, Robust optimal control with adjustable uncertainty sets, \( H_\infty\) control for continuous-time Markov jump nonlinear systems with piecewise-affine approximation, Multivariate Gaussians, semidefinite matrix completion, and convex algebraic geometry, Convergence to a second-order critical point by a primal-dual interior point trust-region method for nonlinear semidefinite programming, On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids, Euclidean Distance Bounds for Linear Matrix Inequalities Analytic Centers Using a Novel Bound on the Lambert Function, Optimal Data Fitting: A Moment Approach, Adaptive detection of distributed targets in Gaussian clutter based on multiple a-priori spectral models, An SQP-type Method with Superlinear Convergence for Nonlinear Semidefinite Programming, On constrained estimation of graphical time series models, Applications of second-order cone programming, Optimal ellipsoids and decomposition of positive definite matrices, Efficient computational algorithm for optimal allocation in regression models, Multiplicative methods for computing \(D\)-optimal stratified designs of experiments, Computing exact \(D\)-optimal designs by mixed integer second-order cone programming, Extending a refinement of Koteljanskiĭ's inequality, Finding Bayesian Optimal Designs for Nonlinear Models: A Semidefinite Programming‐Based Approach, Computation of robust control invariant sets with predefined complexity for uncertain systems, An inexact interior point method for \(L_{1}\)-regularized sparse covariance selection, Mean estimation with sub-Gaussian rates in polynomial time, Computing optimal designs of multiresponse experiments reduces to second-order cone program\-ming, Some New Methods for Generating Convex Functions, 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, Optimal experimental design and some related control problems, Optimal and robust waveform design for MIMO radars in the presence of clutter, An interior point method with a primal-dual quadratic barrier penalty function for nonlinear semidefinite programming, Robust trade-off portfolio selection, Construction of efficient experimental designs under multiple resource constraints, D-optimal design of a monitoring network for parameter estimation of distributed systems, Approximate optimal designs for multivariate polynomial regression, Efficient Solution of Maximum-Entropy Sampling Problems, Computation of low-complexity control-invariant sets for systems with uncertain parameter dependence, Scale-invariant clustering with minimum volume ellipsoids, A Randomized Exchange Algorithm for Computing Optimal Approximate Designs of Experiments, 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, Relative entropy optimization and its applications, An interior point sequential quadratic programming-type method for log-determinant semi-infinite programs, Barycentric algorithm for computing D-optimal size- and cost-constrained designs of experiments, Multi-start approach for an integer determinant maximization problem, Learning Sparse Causal Gaussian Networks With Experimental Intervention: Regularization and Coordinate Descent, Maximum-entropy sampling and the Boolean quadric polytope, Computing \(c\)-optimal experimental designs using the simplex method of linear programming, LMI approximations for the radius of the intersection of ellipsoids: Survey., A generalization of Voronoi's reduction theory and its application, Semidefinite programming for discrete optimization and matrix completion problems, A class of semidefinite programs with rank-one solutions, Monte Carlo Algorithms for the Detection of Necessary Linear Matrix Inequality Constraints, Network exploration via the adaptive LASSO and SCAD penalties, A primal-dual interior point method for nonlinear semidefinite programming, A survey on conic relaxations of optimal power flow problem, Alternating direction method for covariance selection models, Smoothing method for minimizing the sum of therlargest functions, On the Bijectivity of Thin-Plate Splines, Constrained MPC for uncertain linear systems with ellipsoidal target sets., Estimating structured high-dimensional covariance and precision matrices: optimal rates and adaptive estimation, On the Implementation and Usage of SDPT3 – A Matlab Software Package for Semidefinite-Quadratic-Linear Programming, Version 4.0, Monitoring the covariance matrix with fewer observations than variables, A Matrix Positivstellensatz with Lifting Polynomials, Controller coefficient truncation using Lyapunov performance certificate, On the use of Jordan algebras for improving global convergence of an augmented Lagrangian method in nonlinear semidefinite programming, Optimality conditions and global convergence for nonlinear semidefinite programming, A line search exact penalty method for nonlinear semidefinite programming, Optimal design of multifactor experiments via grid exploration, Detecting redundancy in optimization problems over intersection of ellipsoids, Computing D-Optimal Experimental Designs for Estimating Treatment Contrasts Under the Presence of a Nuisance Time Trend, On multiple-objective optimal designs, A Maximum Likelihood Approach to Density Estimation with Semidefinite Programming, A primal-dual interior point trust-region method for nonlinear semidefinite programming, Applications of semidefinite programming, An efficient algorithm for the Euclidean \(r\)-centrum location problem, Computing weighted analytic center for linear matrix inequalities using infeasible Newton's method, Piecewise-linear robust control of systems with input constraints, Minimum-volume enclosing ellipsoids and core sets
Uses Software
