Applications of semidefinite programming
From MaRDI portal
Publication:1294557
DOI10.1016/S0168-9274(98)00098-1zbMATH Open0956.90031OpenAlexW1996395235MaRDI QIDQ1294557FDOQ1294557
Authors: Lieven Vandenberghe, Stephen 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
Recommendations
Cites Work
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- Linear Matrix Inequalities in System and Control Theory
- Title not available (Why is that?)
- Title not available (Why is that?)
- Semidefinite Programming
- Title not available (Why is that?)
- Geometric algorithms and combinatorial optimization.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Sizing and Least-Change Secant Methods
- Title not available (Why is that?)
- A Tool for the Analysis of Quasi-Newton Methods with Application to Unconstrained Minimization
- Robust Truss Topology Design via Semidefinite Programming
- The archievable region method in the optimal control of queueing systems; formulations, bounds and policies
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- Title not available (Why is that?)
- A New Variational Result for Quasi-Newton Formulae
- Pattern separation by convex programming
- Potential Reduction Polynomial Time Method for Truss Topology Design
- Title not available (Why is that?)
- Determinant Maximization with Linear Matrix Inequality Constraints
- Bounds for the error of linear systems of equations using the theory of moments
- Acceleration and Parallelization of the Path-Following Interior Point Method for a Linearly Constrained Convex Quadratic Problem
- Title not available (Why is that?)
- An Algorithm for Separating Patterns by Ellipsoids
Cited In (40)
- Foundations of set-semidefinite optimization
- LFTB: an efficient algorithm to bound linear fractional transformations
- Recursive algorithms for inner ellipsoidal approximation of convex polytopes.
- Semidefinite programming
- On the relationship between the discrete and continuous bounding moment problems and their numerical solutions
- Semidefinite programming
- An interior point-proximal method of multipliers for linear positive semi-definite programming
- Exploiting special structure in semidefinite programming: a survey of theory and applications
- Adaptive grid semidefinite programming for finding optimal designs
- Removal of the points that do not support an \(E\)-optimal experimental design
- An interior point method for solving semidefinite programs using cutting planes and weighted analytic centers
- Use of semidefinite programming for solving the LQR problem subject to rectangular descriptor systems
- An algorithm based on semidefinite programming for finding minimax optimal designs
- Some applications of the Semi-Infinite Simplex Algorithm
- Finding Bayesian Optimal Designs for Nonlinear Models: A Semidefinite Programming‐Based Approach
- A primal–dual regularized interior-point method for semidefinite programming
- Chance constrained \(0-1\) quadratic programs using copulas
- Mixed-integer linear programming for computing optimal experimental designs
- D-optimal design of a monitoring network for parameter estimation of distributed systems
- Exploiting low-rank structure in semidefinite programming by approximate operator splitting
- Optimality Conditions in Semidefinite Programming
- A modified homogeneous potential reduction algorithm for solving the monotone semidefinite linear complementarity problem
- Generating cutting planes for the semidefinite relaxation of quadratic programs
- Reduced vertex set result for interval semidefinite optimization problems
- Convex optimization problems involving finite autocorrelation sequences
- Fast algorithms for the minimum volume estimator
- Nonlinear output feedback control laws based on linear ones for improving ultimate bound
- Outlier detection and least trimmed squares approximation using semi-definite programming
- Optimal experimental design for linear time invariant state-space models
- Regularized sample average approximation for high-dimensional stochastic optimization under low-rankness
- A first-order algorithm for the A-optimal experimental design problem: a mathematical programming approach
- Optimization under uncertainty with applications to design of truss structures
- Computing maximin efficient experimental designs using the methods of semidefinite programming
- Optimal exact designs of experiments via mixed integer nonlinear programming
- Computing A-optimal and E-optimal designs for regression models via semidefinite programming
- Semidefinite programming, matrix decomposition, and radar code design
- Outlier detection and robust covariance estimation using mathematical programming
- Title not available (Why is that?)
- Spectral bundle methods for non-convex maximum eigenvalue functions: first-order methods
- Optimal Design of Experiments for Implicit Models
Uses Software
This page was built for publication: Applications of semidefinite programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1294557)
