Applications of semidefinite programming
From MaRDI portal
Publication:1294557
DOI10.1016/S0168-9274(98)00098-1zbMath0956.90031MaRDI QIDQ1294557
Stephen P. Boyd, Lieven Vandenberghe
Publication date: 18 March 2001
Published in: Applied Numerical Mathematics (Search for Journal in Brave)
linear matrix inequalities; semidefinite programming; ellipsoidal approximation; determinant maximization
Related Items
Foundations of Set-Semidefinite Optimization, A first-order algorithm for the A-optimal experimental design problem: a mathematical programming approach, 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, Generating cutting planes for the semidefinite relaxation of quadratic programs, Optimization under uncertainty with applications to design of truss structures, Chance constrained \(0-1\) quadratic programs using copulas, Reduced vertex set result for interval semidefinite optimization problems, Recursive algorithms for inner ellipsoidal approximation of convex polytopes., An interior point method for solving semidefinite programs using cutting planes and weighted analytic centers, Computing maximin efficient experimental designs using the methods of semidefinite programming, Fast algorithms for the minimum volume estimator, Outlier detection and robust covariance estimation using mathematical programming, Outlier detection and least trimmed squares approximation using semi-definite programming, D-optimal design of a monitoring network for parameter estimation of distributed systems, Spectral bundle methods for non-convex maximum eigenvalue functions: first-order methods, Optimality Conditions in Semidefinite Programming, Use of semidefinite programming for solving the LQR problem subject to rectangular descriptor systems
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
