Sciweavers

116 search results - page 4 / 24
» Separable convex optimization problems with linear ascending...
Sort
View
CDC
2010
IEEE
144views Control Systems» more  CDC 2010»
13 years 2 months ago
Robust controller design by convex optimization based on finite frequency samples of spectral models
Abstract-- Some frequency-domain controller design problems are solved using a finite number of frequency samples. Consequently, the performance and stability conditions are not gu...
Gorka Galdos, Alireza Karimi, Roland Longchamp
JMLR
2006
124views more  JMLR 2006»
13 years 7 months ago
A Direct Method for Building Sparse Kernel Learning Algorithms
Many kernel learning algorithms, including support vector machines, result in a kernel machine, such as a kernel classifier, whose key component is a weight vector in a feature sp...
Mingrui Wu, Bernhard Schölkopf, Gökhan H...
ICRA
1999
IEEE
186views Robotics» more  ICRA 1999»
14 years 4 days ago
Grasp Analysis as Linear Matrix Inequality Problems
Three fundamental problems in the study of grasping and dextrous manipulation with multifingered robotic hands are as follows. a) Given a robotic hand and a grasp characterized by ...
Li Han, Jeffrey C. Trinkle, Zexiang Li
TSP
2010
13 years 2 months ago
MIMO transceiver optimization with linear constraints on transmitted signal covariance components
Abstract--This correspondence revisits the joint transceiver optimization problem for multiple-input multiple-output (MIMO) channels. The linear transceiver as well as the transcei...
Ching-Chih Weng, P. P. Vaidyanathan
PG
2003
IEEE
14 years 1 months ago
Bounding Recursive Procedural Models Using Convex Optimization
We present an algorithm to construct a tight bounding polyhedron for a recursive procedural model. We first use an iterated function system (IFS) to represent the extent of the p...
Orion Sky Lawlor, John C. Hart