Sciweavers

240 search results - page 11 / 48
» On the numerical solution to linear problems using stochasti...
Sort
View
COMPGEOM
1990
ACM
15 years 1 months ago
Finding Compact Coordinate Representations for Polygons and Polyhedra
Practical solid modeling systems are plagued by numerical problems that arise from using oatingpoint arithmetic. For example, polyhedral solids are often represented by a combinat...
Victor Milenkovic, Lee R. Nackman
JCAM
2010
84views more  JCAM 2010»
14 years 4 months ago
An interior-point method for large constrained discrete ill-posed problems
Ill-posed problems are numerically underdetermined. It is therefore often beneficial to impose known properties of the desired solution, such as nonnegativity, during the solution...
Serena Morigi, Lothar Reichel, Fiorella Sgallari
AUTOMATICA
2011
14 years 4 months ago
Distributed dynamic programming for discrete-time stochastic control, and idempotent algorithms
Previously, idempotent methods have been found to be extremely fast for solution of dynamic programming equations associated with deterministic control problems. The original meth...
William M. McEneaney
CCE
2010
14 years 7 months ago
A simple heuristic for reducing the number of scenarios in two-stage stochastic programming
In this work we address the problem of solving multiscenario optimization models that are deterministic equivalents of two-stage stochastic programs. We present a heuristic approx...
Ramkumar Karuppiah, Mariano Martín, Ignacio...
CEC
2007
IEEE
15 years 4 months ago
Finding trade-off solutions close to KKT points using evolutionary multi-objective optimization
— Despite having a wide-spread applicability of evolutionary optimization procedures over the past few decades, EA researchers still face criticism about the theoretical optimali...
Kalyanmoy Deb, Rahul Tewari, Mayur Dixit, Joydeep ...