Connections Between Semi-Infinite and Semidefinite Programming

Connections Between Semi-Infinite and Semidefinite Programming

Cached

Download Links

by Lieven Vandenberghe , Stephen Boyd

Citations:

BibTeX

@MISC{Vandenberghe_connectionsbetween,
    author = {Lieven Vandenberghe and Stephen Boyd},
    title = {Connections Between Semi-Infinite and Semidefinite Programming },
    year = {}
}

Bookmark

OpenURL

Abstract

We consider convex optimization problems with linear matrix inequality (LMI) constraints, i.e., constraints of the form F (x) =F0+x1F1+ +xmFm 0; (1.1) where the matrices Fi = F T

Citations

2333	Convex Analysis - Rockafellar - 1970
969	Geometric algorithms and combinatorial optimization - Grötschel, Lovász, et al. - 1993
876	Robust Regression and Outlier Detection - Rousseeuw, Leroy - 1987
581	S: Semidefinite programming - Vandenberghe, Boyd - 1996
422	Interior-point methods in semidefinite programming with applications to combinatorial optimization - Alizadeh - 1995
258	Theory of Optimal Experiments - Fedorov - 1972
208	Interior point polynomial methods in convex programming - Nesterov, Nemirovski - 1994
168	Extremum problems with inequalities as subsidiary conditions, 187–204 in Studies and essays presented to R. Courant on his 60th birthday, edited by - John - 1948
129	Determinant maximization with linear matrix inequality constraints - Vandenberghe, Boyd, et al. - 1998
118	Optimal Designs of Experiments - Pukelsheim - 1993
111	Helly’s theorem and its relatives - Danzer, Grünbaum, et al. - 1963
77	The Markov Moment Problem and Extremal Problems, in: Transl - Kreĭn, Nudel’man - 1977
76	Eigenvalue optimization - Lewis, Overton - 1996
50	Network Analysis and Synthesis - A modern system theory approach - Anderson, Vongpanitlerd - 1973
50	Optimization of multiclass queueing networks: Polyhedral and nonlinear characterizations of achievable performance - Bertsimas, Paschalidis, et al. - 1994
40	SDPSOL: A parser/solver for semidefinite programs with matrix structure - Wu, Boyd - 2000
33	State Estimation for Dynamic Systems - Chernousko - 1994
30	Semide nite programming - Vandenberghe, Boyd - 1996
26	Obstacle collision detection using best ellipsoid fit - Rimon, Boyd - 1997
24	Maxdet : software for determinant maximization problems - Wu, Vandenberghe, et al. - 1996
24	FIR filter design via spectral factorization and convex optimization - Wu, Boyd, et al. - 1997
16	A linear programming approach to the steady-state analysis of reflected Brownian motion. Stochastic Models - Schwerer - 2001
16	Optimal Design: Some geometric aspects of D-optimality - Titterington - 1975
13	sdpsol: A Parser/Solver for Semide nite Programming and Determinant Maximization Problems with Matrix Structure - Wu, Boyd - 1996
12	Interior point methods in semide nite programming with applications to combinatorial optimization - Alizadeh - 1995
12	The achievable region method in the optimal control of queueing systems; formulations, bounds and policies. Queueing Syst - Bertsimas - 1995
12	H.: Bounds for the error of linear systems of equations using the theory of moments - Dahlquist, Eisenstat, et al. - 1972
11	An algorithm for separating patterns by ellipsoids - Barnes - 1982
10	FIR filter design via semidefinite programming and spectral factorization - Wu, Boyd, et al. - 1996
9	On cone-LP's and semi-definite programs: Facial structure, basic solutions and the simplex method - Pataki - 1995
8	Pattern separation by convexprogramming - ROSEN - 1965
6	Optimum experiment designs. Oxford Statistical Science Series - Atkinson, Donev - 1992
5	Minimum-volume ellipsoids containing compact sets: application to parameter bounding - Pronzato, Walter - 1994
2	FIR lter design via semide nite programming and spectral factorization - Wu, Boyd, et al. - 1996
2	FIR lter design via spectral factorization and convex optimization - Wu, Boyd, et al. - 1998
2	Linear programming with positive semi-definite matrices - Lasserre - 1995
1	Linear programming with positive semi-de nite matrices - Lasserre - 1995
1	Cone-LP's and semi-de nite programs: facial structure, basic solutions, and the simplex method - Pataki - 1995