Sciweavers

332 search results - page 17 / 67
» Convexity, Duality and Effects
Sort
View
RAM
2008
IEEE
95views Robotics» more  RAM 2008»
14 years 2 months ago
A New Distance Algorithm and Its Application to General Force-Closure Test
This paper presents an algorithm for computing the distance between a point and a convex cone in n-dimensional space. The convex cone is specified by the set of all nonnegative com...
Yu Zheng, Chee-Meng Chew
CORR
2007
Springer
130views Education» more  CORR 2007»
13 years 7 months ago
Lagrangian Relaxation for MAP Estimation in Graphical Models
Abstract— We develop a general framework for MAP estimation in discrete and Gaussian graphical models using Lagrangian relaxation techniques. The key idea is to reformulate an in...
Jason K. Johnson, Dmitry M. Malioutov, Alan S. Wil...
SIAMNUM
2010
96views more  SIAMNUM 2010»
13 years 2 months ago
On the Strong Convergence of Gradients in Stabilized Degenerate Convex Minimization Problems
Infimizing sequences in nonconvex variational problems typically exhibit enforced finer and finer oscillations called microstructures such that the infimal energy is not attained. ...
Wolfgang Boiger, Carsten Carstensen
ICASSP
2009
IEEE
13 years 11 months ago
Design of robust superdirective beamformers as a convex optimization problem
Broadband data-independent beamforming designs aiming at constant beamwidth often lead to superdirective beamformers for low frequencies, if the sensor spacing is small relative t...
Edwin Mabande, Adrian Schad, Walter Kellermann
EOR
2010
160views more  EOR 2010»
13 years 8 months ago
A modified alternating direction method for convex quadratically constrained quadratic semidefinite programs
We propose a modified alternate direction method for solving convex quadratically constrained quadratic semidefinite optimization problems. The method is a first-order method, the...
Jie Sun, Su Zhang