115 search results - page 6 / 23 » On the LVI-based numerical method (E47 algorithm) for solvin... |
CONSTRAINTS
1999
13 years 7 months ago
1999
Interval constraints can be used to solve problems in numerical analysis. In this paper we show that one can improve the performance of such an interval constraint program by the ...
ICASSP
2009
IEEE
14 years 2 months ago
2009
IEEE
The LCD deblurring problem is considered as a simple bounded quadratic programming problem and is solved using conjugate gradient with early stopping criteria to avoid excessive s...
SCALESPACE
2005
Springer
14 years 1 months ago
2005
Springer
We study the connection between higher order total variation (TV) regularization and support vector regression (SVR) with spline kernels in a one-dimensional discrete setting. We p...
SIAMJO
2010
13 years 6 months ago
2010
Abstract. We present a new “lifting” approach for the solution of nonlinear optimization problems (NLPs) that have objective and constraint functions with intermediate variable...
IPCO
2008
13 years 9 months ago
2008
Abstract. Semidefinite relaxations are known to deliver good approximations for combinatorial optimization problems like graph bisection. Using the spectral bundle method it is pos...