Sciweavers

1477 search results - page 10 / 296
» Random Convex Programs
Sort
View
ICCV
2009
IEEE
13 years 6 months ago
Consensus set maximization with guaranteed global optimality for robust geometry estimation
Finding the largest consensus set is one of the key ideas used by the original RANSAC for removing outliers in robust-estimation. However, because of its random and non-determinis...
Hongdong Li
COCOS
2003
Springer
148views Optimization» more  COCOS 2003»
14 years 1 months ago
Convex Programming Methods for Global Optimization
We investigate some approaches to solving nonconvex global optimization problems by convex nonlinear programming methods. We assume that the problem becomes convex when selected va...
John N. Hooker
HYBRID
2005
Springer
14 years 2 months ago
Primal-Dual Tests for Safety and Reachability
Abstract. A methodology for safety verification using barrier certificates has been proposed recently. Conditions that must be satisfied by a barrier certificate can be formula...
Stephen Prajna, Anders Rantzer
WIOPT
2010
IEEE
13 years 7 months ago
Optimal slotted random access in coded wireless packet networks
Abstract—We consider the problem of jointly optimizing random access and subgraph selection in coded wireless packet networks. As opposed to the corresponding scheduling approach...
Maximilian Riemensberger, Michael Heindlmaier, And...
MP
1998
134views more  MP 1998»
13 years 8 months ago
Second-order global optimality conditions for convex composite optimization
In recent years second-order sufficient conditions of an isolated local minimizer for convex composite optimization problems have been established. In this paper, second-order opt...
Xiaoqi Yang