7 June 1995 Semidefinite programming for quadratically constrained quadratic programs
Author Affiliations +
Abstract
We consider the linear least squares problem subject to multiple quadratic constraints, which is motivated by a practical application in controller design. We use the techniques of convex optimization, in particluar, interior-point methods for semi-definite programming. We reduce a quasi-convex potential function. Each iteration requires calculating a primal and dual search direction and minimizing along the plane defined by these search directions. The primal search direction requires solving a least squares problem whose matrix is composed of a block- Toeplitz portion plus other structured matrices. We make use of Kronecker products and FFTs to greatly reduce the calculation. In addition, the matrix updates and matrix inverses in the plane search are actually low-rank updates to structured matrices so we are able to further reduce the flops required. Consequently, we can design controllers for problems of considerable size.
© (1995) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Julia A. Olkin, Paul James Titterton, "Semidefinite programming for quadratically constrained quadratic programs", Proc. SPIE 2563, Advanced Signal Processing Algorithms, (7 June 1995); doi: 10.1117/12.211397; https://doi.org/10.1117/12.211397
PROCEEDINGS
12 PAGES


SHARE
KEYWORDS
Matrices

Computer programming

Actuators

Sensors

Convex optimization

Software development

Algorithms

RELATED CONTENT

Intelligent electromechanical actuators
Proceedings of SPIE (May 24 1996)
Design and implementation of a teleautonomous hummer
Proceedings of SPIE (January 25 1998)
The Saxpy-1M: Architecture and Algorithms
Proceedings of SPIE (July 28 1986)
Charging phenomena in e-beam metrology
Proceedings of SPIE (July 01 1991)

Back to Top