Pages that link to "Item:Q1294557"
From MaRDI portal
The following pages link to Applications of semidefinite programming (Q1294557):
Displaying 33 items.
- On the relationship between the discrete and continuous bounding moment problems and their numerical solutions (Q271981) (← links)
- A modified homogeneous potential reduction algorithm for solving the monotone semidefinite linear complementarity problem (Q331977) (← links)
- Generating cutting planes for the semidefinite relaxation of quadratic programs (Q337405) (← links)
- Optimization under uncertainty with applications to design of truss structures (Q373938) (← links)
- Chance constrained \(0-1\) quadratic programs using copulas (Q499685) (← links)
- Reduced vertex set result for interval semidefinite optimization problems (Q956611) (← links)
- Recursive algorithms for inner ellipsoidal approximation of convex polytopes. (Q1413940) (← links)
- An algorithm based on semidefinite programming for finding minimax optimal designs (Q1662093) (← links)
- Adaptive grid semidefinite programming for finding optimal designs (Q1702022) (← links)
- Removal of the points that do not support an \(E\)-optimal experimental design (Q1726897) (← links)
- An interior point method for solving semidefinite programs using cutting planes and weighted analytic centers (Q1760902) (← links)
- Computing maximin efficient experimental designs using the methods of semidefinite programming (Q1936672) (← links)
- Optimal experimental design for linear time invariant state-space models (Q2058773) (← links)
- An interior point-proximal method of multipliers for linear positive semi-definite programming (Q2073047) (← links)
- Optimal exact designs of experiments via mixed integer nonlinear programming (Q2302472) (← links)
- Fast algorithms for the minimum volume estimator (Q2349524) (← links)
- Outlier detection and robust covariance estimation using mathematical programming (Q2442793) (← links)
- Outlier detection and least trimmed squares approximation using semi-definite programming (Q2445775) (← links)
- D-optimal design of a monitoring network for parameter estimation of distributed systems (Q2454730) (← links)
- Spectral bundle methods for non-convex maximum eigenvalue functions: first-order methods (Q2576741) (← links)
- Regularized sample average approximation for high-dimensional stochastic optimization under low-rankness (Q2687436) (← links)
- Optimality Conditions in Semidefinite Programming (Q2877746) (← links)
- Use of semidefinite programming for solving the LQR problem subject to rectangular descriptor systems (Q3083904) (← links)
- Exploiting low-rank structure in semidefinite programming by approximate operator splitting (Q5034932) (← links)
- Foundations of Set-Semidefinite Optimization (Q5188753) (← links)
- (Q5214263) (← links)
- Computing A-optimal and E-optimal designs for regression models via semidefinite programming (Q5267895) (← links)
- A primal–dual regularized interior-point method for semidefinite programming (Q5268898) (← links)
- Optimal Design of Experiments for Implicit Models (Q5881146) (← links)
- A first-order algorithm for the A-optimal experimental design problem: a mathematical programming approach (Q5963815) (← links)
- Finding Bayesian Optimal Designs for Nonlinear Models: A Semidefinite Programming‐Based Approach (Q6064606) (← links)
- Nonlinear output feedback control laws based on linear ones for improving ultimate bound (Q6202492) (← links)
- Mixed-integer linear programming for computing optimal experimental designs (Q6616196) (← links)
