Sciweavers

95 search results - page 3 / 19
» Solving Large-Scale Nonlinear Programming Problems by Constr...
Sort
View
SIAMSC
2008
182views more  SIAMSC 2008»
13 years 7 months ago
A Distributed SDP Approach for Large-Scale Noisy Anchor-Free Graph Realization with Applications to Molecular Conformation
We propose a distributed algorithm for solving Euclidean metric realization problems arising from large 3D graphs, using only noisy distance information, and without any prior kno...
Pratik Biswas, Kim-Chuan Toh, Yinyu Ye
ICTAI
2008
IEEE
14 years 2 months ago
Finding Good Starting Points for Solving Structured and Unstructured Nonlinear Constrained Optimization Problems
In this paper, we develop heuristics for finding good starting points when solving large-scale nonlinear constrained optimization problems (COPs). We focus on nonlinear programmi...
Soomin Lee, Benjamin W. Wah
CEC
2008
IEEE
14 years 2 months ago
EA-MP: An evolutionary algorithm for a mine planning problem
In this paper we introduce an evolutionary algorithm for solving a copper mine planning problem. In the last 10 years this realworld problem has been tackled using linear integer p...
María-Cristina Riff, Teddy Alfaro, Xavier B...
INFORMS
2008
55views more  INFORMS 2008»
13 years 7 months ago
Mathematical Programming Algorithms for Two-Path Routing Problems with Reliability Considerations
Most traditional routing problems assume perfect operability of all arcs and nodes. However, when independent arc failure probabilities exist, a secondary objective must be presen...
April K. Andreas, J. Cole Smith
CAV
2003
Springer
108views Hardware» more  CAV 2003»
14 years 23 days ago
Linear Invariant Generation Using Non-linear Constraint Solving
Abstract. We present a new method for the generation of linear invariants which reduces the problem to a non-linear constraint solving problem. Our method, based on Farkas’ Lemma...
Michael Colón, Sriram Sankaranarayanan, Hen...