Sciweavers

39 search results - page 4 / 8
» A modified layered-step interior-point algorithm for linear ...
Sort
View
SIAMJO
2002
77views more  SIAMJO 2002»
13 years 7 months ago
Modifying SQP for Degenerate Problems
Most local convergence analyses of the sequential quadratic programming (SQP) algorithm for nonlinear programming make strong assumptions about the solution, namely, that the activ...
Stephen J. Wright
SIAMJO
2010
100views more  SIAMJO 2010»
13 years 2 months ago
Explicit Sensor Network Localization using Semidefinite Representations and Facial Reductions
The sensor network localization, SNL , problem in embedding dimension r, consists of locating the positions of wireless sensors, given only the distances between sensors that are ...
Nathan Krislock, Henry Wolkowicz
TIT
2008
122views more  TIT 2008»
13 years 7 months ago
An Efficient Pseudocodeword Search Algorithm for Linear Programming Decoding of LDPC Codes
Abstract--In linear programming (LP) decoding of a low-density parity-check (LDPC) code one minimizes a linear functional, with coefficients related to log-likelihood ratios, over ...
Michael Chertkov, Mikhail G. Stepanov
EUROGP
2005
Springer
14 years 25 days ago
Understanding Evolved Genetic Programs for a Real World Object Detection Problem
We describe an approach to understanding evolved programs for a real world object detection problem, that of finding orthodontic landmarks in cranio-facial X-Rays. The approach in...
Victor Ciesielski, Andrew Innes, Sabu John, John M...
ISPD
2006
ACM
158views Hardware» more  ISPD 2006»
14 years 1 months ago
Effective linear programming based placement methods
Linear programming (LP) based methods are attractive for solving the placement problem because of their ability to model Half-Perimeter Wirelength (HPWL) and timing. However, it h...
Sherief Reda, Amit Chowdhary