Improved Maximum
Approximation
Algorithms
for Using
Cut and Satisfiability Programming
Problems
Semidefinite
MIC13EL
X.
GOEMANS
Massachusetts Institute of Technology, Cambridge, Massachusetts
AND DAVID
IBM
P. WILLIAMSON
T. J. Watson Research Center, Yorkt
498
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 47, NO. 2, FEBRUARY 2001
Factor Graphs and the Sum-Product Algorithm
Frank R. Kschischang, Senior Member, IEEE, Brendan J. Frey, Member, IEEE, and Hans-Andrea Loeliger, Member, IEEE
AbstractAlgorithms that
i
Lecture Notes on Optimization
Pravin Varaiya
ii
Contents
1 INTRODUCTION
1
2 OPTIMIZATION OVER AN OPEN SET
7
3 Optimization with equality constraints
15
4 Linear Programming
27
5 Nonlinear Programming
49
6 Discrete-time optimal control
75
7 Continuous-
SIAM J. OPTIM. Vol. 9, No. 1, pp. 3352
c 1998 Society for Industrial and Applied Mathematics
ROBUST SOLUTIONS TO UNCERTAIN SEMIDEFINITE PROGRAMS
LAURENT EL GHAOUI , FRANCOIS OUSTRY , AND HERVE LEBRET Abstract. In this paper we consider semidenite program
LP Decoding
Jon Feldman
Industrial Engineering and Operations Research Columbia University, New York, NY, 10027 jonfeld@ieor.columbia.edu
David R. Karger
Laboratory for Computer Science MIT, Cambridge, MA, 02139 karger@theory.lcs.mit.edu
Martin J. Wainwri