6315 search results - page 388 / 1263 » Approximating Solution Structure |
196
Voted
CORR
2002
Springer
15 years 6 months ago
2002
Springer
We describe sequential and parallel algorithms that approximately solve linear programs with no negative coefficients (a.k.a. mixed packing and covering problems). For explicitly ...
184
click to vote
SIAMJO
2000
15 years 6 months ago
2000
Abstract. We propose a BFGS primal-dual interior point method for minimizing a convex function on a convex set defined by equality and inequality constraints. The algorithm generat...
145
click to vote
MOC
2002
15 years 6 months ago
2002
Using the main ideas of Tanaka, the measure-solution {Pt}t of a 3-dimensional spatially homogeneous Boltzmann equation of Maxwellian molecules without cutoff is related to a Poisso...
162
click to vote
ORL
1998
15 years 6 months ago
1998
We present algorithms to calculate the stability radius of optimal or approximate solutions of binary programming problems with a min sum or min max objective function. Our algori...
214
click to vote
SIAMSC
2010
15 years 5 months ago
2010
This paper develops a nested iteration algorithm to solve time-dependent nonlinear systems of partial differential equations. For each time step, Newton’s method is used to form...