Sciweavers

383 search results - page 4 / 77
» A new infeasible interior-point algorithm for linear program...
Sort
View
NIPS
2003
13 years 8 months ago
Image Reconstruction by Linear Programming
— One way of image denoising is to project a noisy image to the subspace of admissible images derived, for instance by PCA. However, a major drawback of this method is that all p...
Koji Tsuda, Gunnar Rätsch
JMLR
2012
11 years 10 months ago
Fast interior-point inference in high-dimensional sparse, penalized state-space models
We present an algorithm for fast posterior inference in penalized high-dimensional state-space models, suitable in the case where a few measurements are taken in each time step. W...
Eftychios A. Pnevmatikakis, Liam Paninski
SIAMJO
2002
122views more  SIAMJO 2002»
13 years 7 months ago
Robust Filtering via Semidefinite Programming with Applications to Target Tracking
In this paper we propose a novel finite-horizon, discrete-time, time-varying filtering method based on the robust semidefinite programming (SDP) technique. The proposed method prov...
Lingjie Li, Zhi-Quan Luo, Timothy N. Davidson, Kon...
SIAMJO
2008
100views more  SIAMJO 2008»
13 years 7 months ago
On the Global Solution of Linear Programs with Linear Complementarity Constraints
This paper presents a parameter-free integer-programming based algorithm for the global resolution of a linear program with linear complementarity constraints (LPCC). The cornersto...
Jing Hu, John E. Mitchell, Jong-Shi Pang, Kristin ...
NETCOOP
2007
Springer
14 years 1 months ago
A New Necessary Condition for Shortest Path Routing
In shortest path routing, traffic is routed along shortest paths defined by link weights. However, not all path systems are feasible in that they can be realized in this way. This...
Mats Petter Pettersson, Krzysztof Kuchcinski