#### Filter Results:

- Full text PDF available (77)

#### Publication Year

1974

2019

- This year (14)
- Last 5 years (41)
- Last 10 years (75)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

In a second-Order cone program (SOCP) a linear function is minimized over the intersection of an affine set and the product of second-Order (quadratic) cones. SOCPs are nonlinear convex Problems that… (More)

Convex programming is a subclass of nonlinear programming (NLP) that unifies and generalizes least squares (LS), linear programming (LP), and convex quadratic programming (QP). This generalization is… (More)

It is well known that convex programs have many attractive properties, including the proven existence of efficient methods to solve them. What is not as widely appreciated, however, is that nonsmooth… (More)

- Siddharth Joshi, Stephen P. Boyd
- IEEE Transactions on Signal Processing
- 2009

We consider the problem of choosing a set of k sensor measurements, from a set of m possible or potential sensor measurements, that minimizes the error in estimating some parameters. Solving this… (More)

CVXGEN is a software tool that takes a high level description of a convex optimization problem family, and automatically generates custom C code that compiles into a reliable, high speed solver for… (More)

- Sunil Kandukuri, Stephen P. Boyd
- IEEE Trans. Wireless Communications
- 2002

We propose a new method of power control for interference limited wireless networks with Rayleigh fading of both the desired and interference signals. Our method explictly takes into account the… (More)

Ahsfract-Using the notion of fading memory we prove very strong versions of two folk theorems. The first is that any time-inuariant (TZ) con~inuou.r nonlinear operator can be approximated by a… (More)

The problem of maximizing the determinant of a matrix subject to linear matrix inequalities arises in many elds, including computational geometry, statistics, system identi cation, experiment design,… (More)

We investigate the convex-concave procedure (CCP), a local heuristic that utilizes the tools of convex optimization to find local optima of difference of convex (DC) programming problems. The class… (More)