Sciweavers

276 search results - page 12 / 56
» Global Optimization of Probabilistically Constrained Linear ...
Sort
View
WCNC
2008
IEEE
14 years 2 months ago
A Collaborative Quasi-Linear Programming Framework for Ad Hoc Sensor Localization
—In this paper, we propose a collaborative localization scheme which utilizes, in addition to the range estimates to nodes with known locations (anchors), the range estimates bet...
Tao Jia, R. Michael Buehrer
SIAMJO
2010
87views more  SIAMJO 2010»
13 years 6 months ago
A Second Derivative SQP Method: Global Convergence
Abstract. Sequential quadratic programming (SQP) methods form a class of highly efficient algorithms for solving nonlinearly constrained optimization problems. Although second deri...
Nicholas I. M. Gould, Daniel P. Robinson
ICCV
2009
IEEE
13 years 5 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
VECPAR
2004
Springer
14 years 1 months ago
Domain Decomposition Methods for PDE Constrained Optimization Problems
Abstract. Optimization problems constrained by nonlinear partial differential equations have been the focus of intense research in scientific computing lately. Current methods for...
Ernesto E. Prudencio, Richard H. Byrd, Xiao-Chuan ...
CP
2005
Springer
14 years 1 months ago
Solving Large-Scale Nonlinear Programming Problems by Constraint Partitioning
Abstract. In this paper, we present a constraint-partitioning approach for finding local optimal solutions of large-scale mixed-integer nonlinear programming problems (MINLPs). Ba...
Benjamin W. Wah, Yixin Chen