Loading...
Please wait, while we are loading the content...
Second-order cone programming (2004)
| Content Provider | CiteSeerX |
|---|---|
| Author | Alizadeh, F. Goldfarb, D. |
| Description | Second-order cone programming (SOCP) problems are convex optimization problems in which a linear function is minimized over the intersection of an affine linear manifold with the Cartesian product of second-order (Lorentz) cones. Lin-ear programs, convex quadratic programs and quadratically constrained convex |
| File Format | |
| Language | English |
| Publisher | MIT Press |
| Publisher Date | 2004-01-01 |
| Publisher Institution | Mathematical Programming, Series |
| Access Restriction | Open |
| Subject Keyword | Quadratic Program Convex Optimization Problem Linear Function Cartesian Product Affine Linear Manifold Lin-ear Program Second-order Cone Programming |
| Content Type | Text |
| Resource Type | Article |