Applications of semidefinite programming
From MaRDI portal
Publication:1294557
DOI10.1016/S0168-9274(98)00098-1zbMath0956.90031OpenAlexW1996395235MaRDI QIDQ1294557
Lieven Vandenberghe, Stephen P. Boyd
Publication date: 18 March 2001
Published in: Applied Numerical Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0168-9274(98)00098-1
Related Items
Optimal Design of Experiments for Implicit Models, Exploiting low-rank structure in semidefinite programming by approximate operator splitting, On the relationship between the discrete and continuous bounding moment problems and their numerical solutions, A modified homogeneous potential reduction algorithm for solving the monotone semidefinite linear complementarity problem, Unnamed Item, Generating cutting planes for the semidefinite relaxation of quadratic programs, An algorithm based on semidefinite programming for finding minimax optimal designs, Optimization under uncertainty with applications to design of truss structures, Finding Bayesian Optimal Designs for Nonlinear Models: A Semidefinite Programming‐Based Approach, Computing maximin efficient experimental designs using the methods of semidefinite programming, Regularized sample average approximation for high-dimensional stochastic optimization under low-rankness, Nonlinear output feedback control laws based on linear ones for improving ultimate bound, Adaptive grid semidefinite programming for finding optimal designs, Recursive algorithms for inner ellipsoidal approximation of convex polytopes., Outlier detection and robust covariance estimation using mathematical programming, Outlier detection and least trimmed squares approximation using semi-definite programming, Removal of the points that do not support an \(E\)-optimal experimental design, D-optimal design of a monitoring network for parameter estimation of distributed systems, Chance constrained \(0-1\) quadratic programs using copulas, Reduced vertex set result for interval semidefinite optimization problems, An interior point method for solving semidefinite programs using cutting planes and weighted analytic centers, Foundations of Set-Semidefinite Optimization, A first-order algorithm for the A-optimal experimental design problem: a mathematical programming approach, Use of semidefinite programming for solving the LQR problem subject to rectangular descriptor systems, Optimal exact designs of experiments via mixed integer nonlinear programming, Optimal experimental design for linear time invariant state-space models, An interior point-proximal method of multipliers for linear positive semi-definite programming, Spectral bundle methods for non-convex maximum eigenvalue functions: first-order methods, Fast algorithms for the minimum volume estimator, Computing A-optimal and E-optimal designs for regression models via semidefinite programming, A primal–dual regularized interior-point method for semidefinite programming, Optimality Conditions in Semidefinite Programming
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Geometric algorithms and combinatorial optimization.
- The archievable region method in the optimal control of queueing systems; formulations, bounds and policies
- Pattern separation by convex programming
- Bounds for the error of linear systems of equations using the theory of moments
- Sizing and Least-Change Secant Methods
- A Tool for the Analysis of Quasi-Newton Methods with Application to Unconstrained Minimization
- Acceleration and Parallelization of the Path-Following Interior Point Method for a Linearly Constrained Convex Quadratic Problem
- A New Variational Result for Quasi-Newton Formulae
- Potential Reduction Polynomial Time Method for Truss Topology Design
- Linear Matrix Inequalities in System and Control Theory
- Robust Truss Topology Design via Semidefinite Programming
- Determinant Maximization with Linear Matrix Inequality Constraints
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- An Algorithm for Separating Patterns by Ellipsoids
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- Semidefinite Programming
