source: proiecte/pmake3d/make3d_original/Make3dSingleImageStanford_version0.1/third_party/opt/yalmip/htmldata/readmore.htm @ 37

Last change on this file since 37 was 37, checked in by (none), 14 years ago

Added original make3d

File size: 7.9 KB
Line 
1<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
2<html>
3
4<head>
5<meta http-equiv="Content-Language" content="en-us">
6<title>YALMIP - Read more</title>
7<meta http-equiv="Content-Type" content="text/html; charset=windows-1251">
8<meta content="Microsoft FrontPage 6.0" name="GENERATOR">
9<meta name="ProgId" content="FrontPage.Editor.Document">
10<link href="yalmip.css" type="text/css" rel="stylesheet">
11<base target="_self">
12</head>
13
14<body leftMargin="0" topMargin="0">
15
16<div align="left">
17
18<table border="0" cellpadding="4" cellspacing="3" style="border-collapse: collapse" bordercolor="#000000" width="100%" align="left" height="100%">
19  <tr>
20    <td width="100%" align="left" height="100%" valign="top">
21    <h2 style="margin-top: 0; margin-bottom: 0">Read more</h2>
22    <hr noShade SIZE="1">       
23    <p style="margin-bottom: 0; margin-top:0">&nbsp;</p>
24    <h3 style="margin-bottom: 0; margin-top:0">Second order cone programming</h3>
25    <blockquote>
26      <p style="margin-bottom: 0; margin-top:0">
27      <span style="font-style: normal"><font color="#0000FF">
28      <a name="LOBOETAL"></a>[M. S. Lobo and L. Vandenberghe and S. Boyd
29      and H. Lebret]</font></span>.
30      Applications of second-order cone programming. Linear Algebra and its
31      applications 284:193-228. Available
32      <a target="_blank" href="http://www.stanford.edu/~boyd/reports/socp.pdf">on-line</a>.</p>
33    </blockquote>
34    <h3 style="margin-bottom: 0; margin-top:0">Semidefinite programming</h3>
35    <blockquote>
36      <p style="margin-bottom: 0; margin-top:0">
37      <span style="font-style: normal"><font color="#0000FF">
38      <a name="BOYDETAL"></a>[S. Boyd and L. El Ghaoui and L.
39      Feron and V. Balakrishnan]</font></span>. Linear matrix inequalities in system and
40      control theory. SIAM studies in applied mathematics. SIAM, Philadelphia,
41      Pennsylvania<br>
42&nbsp;</p>
43      <p style="margin-bottom: 0; margin-top:0">
44      <span style="font-style: normal"><font color="#0000FF">
45      <a name="VANDENBERGHEBOYD"></a>[L. Vandenberghe and S. Boyd]</font></span>.
46      Semidefinite programming. SIAM Review 38:49-95. Available
47      <a target="_blank" href="http://www.stanford.edu/~boyd/reports/semidef_prog.pdf">
48      on-line</a>.</p>
49      <p style="margin-bottom: 0; margin-top:0">&nbsp;</p>
50      <p style="margin-bottom: 0; margin-top:0">
51      <span style="font-style: normal"><font color="#0000FF">
52      <a name="VANDENBERGHEETAL"></a>[L. Vandenberghe, S. Boyd and
53      S.-P. Wu]</font></span>, Determinant maximization with linear matrix
54      inequality constraints. SIAM Journal on Matrix Analysis and Applications
55      19(2):499-533. Available
56      <a target="_blank" href="http://www.stanford.edu/~boyd/reports/maxdet_rev.pdf">on-line</a>.</p>
57      <p style="margin-bottom: 0; margin-top:0">&nbsp;</p>
58      <p style="margin-bottom: 0; margin-top:0">
59      <span style="font-style: normal"><font color="#0000FF"><a name="MITTELMANN"></a>
60      [H. Mittelmann]</font></span>. An independent
61      benchmarking of SDP and SDP solvers. Mathematical Programming 95:407-430. Available
62      <a target="_blank" href="ftp://plato.asu.edu/pub/papers/paper93.pdf">on-line</a>.</p>
63                <p style="margin-bottom: 0; margin-top:0">
64      &nbsp;</p>
65                <p style="margin-bottom: 0; margin-top:0">
66      <font color="#0000FF">
67      <span style="font-style: normal"><a name="ORSI"></a>
68      [</span></font><span style="font-style: normal"><font color="#0000FF">R.
69                Orsi, U. Helmke, and J. B. Moore]</font></span>. A Newton-like method
70                for solving rank constrained linear matrix inequalities.
71                <span style="font-style: normal">In</span> <i>Proceedings of the 43rd
72                IEEE Conference on Decision and Control</i>,
73                pages 3138-3144, Paradise Island, Bahamas, 2004 Available
74                <a target="_blank" href="http://users.rsise.anu.edu.au/~robert/publications/cOHM04.pdf">on-line</a>.</p>
75    </blockquote>
76    <h3 style="margin-bottom: 0; margin-top:0">Multiparametric programming</h3>
77    <blockquote>
78      <p style="margin-bottom: 0; margin-top:0">
79      <span style="font-style: normal"><font color="#0000FF"><a name="BEMPORADETAL"></a>
80      [A. Bemporad, M. Morari, V. Dua
81      and E.N. Pistikopoulos]</font></span>. The Explicit Linear Quadratic Regulator for
82      Constrained Systems. Automatica 38(1):3-20.</p>
83    </blockquote>
84    <h3 style="margin-bottom: 0; margin-top:0">Sum of squares and moment
85    problems</h3>
86    <blockquote>
87      <p style="margin-bottom: 0; margin-top:0">
88      <span style="font-style: normal"><font color="#0000FF"><a name="LASSERRE"></a>
89      [J. B. Lasserre]</font></span>. Global
90      optimization with polynomials and the problem of moments. SIAM Journal on
91      Optimization 11(3):796-817. Available
92      <a target="_blank" href="http://epubs.siam.org/sam-bin/dbq/article/36680">on-line</a>.</p>
93      <p style="margin-bottom: 0; margin-top:0">
94      &nbsp;</p>
95      <p style="margin-bottom: 0; margin-top:0">
96      <span style="font-style: normal"><font color="#0000FF"><a name="HENRIONLASSERRE"></a>
97      [D. Henrion, J. B. Lasserre]</font></span>.  "Convergent relaxations of polynomial matrix inequalities and static output feedback. Submitted to the IEEE Transactions on Automatic Control. Available
98      <a target="_blank" href="http://www.optimization-online.org/DB_HTML/2004/11/999.html">on-line</a>.</p>
99      <p style="margin-bottom: 0; margin-top:0">&nbsp;</p>
100      <p style="margin-bottom: 0; margin-top:0">
101      <span style="font-style: normal"><font color="#0000FF"><a name="PARRILO"></a>
102      [P. A. Parrilo]</font></span>. Structured
103      semidefinite programs and semialgebraic geometry methods in robustness and
104      optimization. PhD Thesis, California Institute of Technology, Pasadena,
105      California, 2000. Available
106      <a target="_blank" href="http://control.ee.ethz.ch/~parrilo/pubs/files/thesis.pdf">on-line</a>.</p>
107      <p style="margin-bottom: 0; margin-top:0">&nbsp;</p>
108      <p style="margin-bottom: 0; margin-top:0">
109      <span style="font-style: normal"><font color="#0000FF"><a name="REZNICK"></a>
110      [B. Reznick]</font></span>. Some concrete
111      aspects of Hilbert's 17th problem. Available
112      <a target="_blank" href="http://www.math.uiuc.edu/~reznick/hil17.pdf">on-line</a>.</p>
113    </blockquote>
114    <h3 style="margin-bottom: 0; margin-top:0">Geometric programming</h3>
115    <blockquote>
116      <p style="margin-bottom: 0; margin-top:0">
117      <span style="font-style: normal"><font color="#0000FF">
118      <a name="BOYDETAL2"></a>
119      [S. Boyd, S. Kim, L. Vandenberghe, A. Hassibi]</font></span>. A Tutorial
120      on Geometric Programming. Available
121      <a target="_blank" href="http://www.stanford.edu/~boyd/reports/gp_tutorial.pdf">on-line</a>.</p>
122    </blockquote>
123    <h3 style="margin-bottom: 0; margin-top:0">Convex programming</h3>
124    <blockquote>
125      <p style="margin-bottom: 0; margin-top:0"><font color="#0000FF"><a name="BOYDVAN2003"></a>
126      <span style="font-style: normal">[S. Boyd and L. Vandenberghe]</span></font>.
127      Convex optimization. Cambridge University Press. Available
128      <a target="_blank" href="http://www.stanford.edu/~boyd/bv_cvxbook.pdf">on-line</a>.</p>
129      <p style="margin-bottom: 0; margin-top:0"><br>
130      <font color="#0000FF">
131      <a name="BENTALNEM"></a>
132      <span style="font-style: normal">[A. Ben-Tal and A. Nemerovskii]</span></font>. Lectures on Modern Convex Optimization -
133      Analysis, Algorithms, and Engineering Applications, MPS-SIAM Series on
134      Optimization, MPS-SIAM.<br>
135&nbsp;</p>
136      <p style="margin-bottom: 0; margin-top:0"><a name="NESNEM94">
137      <span style="font-style: normal"></span></a>
138      <font color="#0000FF">
139      <span style="font-style: normal">[Y. Nesterov
140      and A. Nemirovskii]</span></font><i>. Interior-point polynomial algorithms in convex
141      programming. SIAM Studies in Applied Mathematics</i>.</p>
142    </blockquote>
143    </td>
144  </tr>
145</table>
146
147</div>
148
149</body>
150
151</html>
Note: See TracBrowser for help on using the repository browser.