#### Filter Results:

- Full text PDF available (8)

#### Publication Year

1960

2012

- This year (0)
- Last 5 years (1)
- Last 10 years (7)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn 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 the problem family. The current implementation targets problem families that can be transformed, using disciplined convex programming techniques, to convex… (More)

- Jacob Mattingley, Yang Wang, Stephen Boyd
- CACSD
- 2010

Receding horizon control (RHC), also known as model predictive control (MPC), is a general purpose control scheme that involves repeatedly solving a constrained optimization problem, using predictions of future costs, disturbances, and constraints over a moving time horizon to choose the control action. RHC handles constraints, such as limits on control… (More)

Branch and bound algorithms are methods for global optimization in nonconvex problems [LW66, Moo91]. They are nonheuristic, in the sense that they maintain a provable upper and lower bound on the (globally) optimal objective value; they terminate with a certificate proving that the suboptimal point found is ǫ-suboptimal. Branch and bound algorithms can be… (More)

This chapter concerns the use of convex optimization in real-time embedded systems, in areas such as signal processing, automatic control, real-time estimation , real-time resource allocation and decision making, and fast automated trading. By 'embedded' we mean that the optimization algorithm is part of a larger, fully automated system, that executes… (More)

R eceding horizon control (RHC), also known as model predictive control (MPC), [1]–[5] is a feedback control technique that became popular in the 1980s. With RHC, an optimization problem is solved at each time step to determine a plan of action over a fi xed time horizon. The fi rst input from this plan is applied to the system. At the next time step we… (More)

- Jacob Mattingley
- 2007

This report presents an algorithm which matches photographs of paintings to a small database. The algorithm uses a modified SIFT approach to match keypoints between paintings. The algorithm is somewhat invariant to size and rotation, highly invariant to perspective change and noise, and can tolerate multiple images in the field of view. Significant… (More)

- Jacob Mattingley
- Biomedical chromatography : BMC
- 1986

In the clinical laboratory, paper chromatography is still the most useful, simple, inexpensive procedure for initial identification of abnormalities of amino acid excretion. The results of its use for more than 8000 paediatric and adult renal patients is surveyed. Nonspecific generalized aminoaciduria was the most frequent abnormality found, comprising some… (More)

- Jacob Mattingley
- The New Zealand medical journal
- 1961

- Philippe Carson, Jacob Mattingley
- The New Zealand medical journal
- 1960

- Jacob Mattingley
- 2010

1053-5888/10/$26.00©2010IEEE C onvex optimization has been used in signal processing for a long time to choose coefficients for use in fast (linear) algorithms, such as in filter or array design; more recently, it has been used to carry out (nonlinear) processing on the signal itself. Examples of the latter case include total variation denoising, compressed… (More)