Sciweavers

Share
6 search results - page 1 / 2
» A geometric framework for nonconvex optimization duality usi...
Sort
View
JGO
2008
111views more  JGO 2008»
8 years 8 months ago
A geometric framework for nonconvex optimization duality using augmented lagrangian functions
We provide a unifying geometric framework for the analysis of general classes of duality schemes and penalty methods for nonconvex constrained optimization problems. We present a ...
Angelia Nedic, Asuman E. Ozdaglar
ICPR
2008
IEEE
9 years 9 months ago
Solving quadratically constrained geometrical problems using lagrangian duality
In this paper we consider the problem of solving different pose and registration problems under rotational constraints. Traditionally, methods such as the iterative closest point ...
Carl Olsson, Anders Eriksson
MOR
2008
73views more  MOR 2008»
8 years 8 months ago
Separation of Nonconvex Sets with General Augmenting Functions
In this paper, we consider two geometric optimization problems that are dual to each other and characterize conditions under which the optimal values of the two problems are equal...
Angelia Nedic, Asuman E. Ozdaglar
CVPR
2011
IEEE
8 years 3 months ago
A Closed Form Solution to Robust Subspace Estimation and Clustering
We consider the problem of fitting one or more subspaces to a collection of data points drawn from the subspaces and corrupted by noise/outliers. We pose this problem as a rank m...
Paolo Favaro, René, Vidal, Avinash Ravichandran
CDC
2010
IEEE
215views Control Systems» more  CDC 2010»
8 years 3 months ago
Consensus with robustness to outliers via distributed optimization
Over the past few years, a number of distributed algorithms have been developed for integrating the measurements acquired by a wireless sensor network. Among them, average consensu...
Jixin Li, Ehsan Elhamifar, I.-Jeng Wang, Ren&eacut...
books