Sciweavers

61 search results - page 2 / 13
» Domain Decomposition Methods for PDE Constrained Optimizatio...
Sort
View
EVOW
2007
Springer
14 years 5 months ago
Combining Lagrangian Decomposition with an Evolutionary Algorithm for the Knapsack Constrained Maximum Spanning Tree Problem
We present a Lagrangian decomposition approach for the Knapsack Constrained Maximum Spanning Tree problem yielding upper bounds as well as heuristic solutions. This method is furth...
Sandro Pirkwieser, Günther R. Raidl, Jakob Pu...
CDC
2009
IEEE
124views Control Systems» more  CDC 2009»
13 years 12 months ago
Inverse modeling for open boundary conditions in channel network
Abstract-- An inverse modeling problem for systems governed by first-order, hyperbolic partial differential equations subject to periodic forcing is investigated. The problem is de...
Qingfang Wu, Mohammad Rafiee, Andrew Tinka, Alexan...
SIAMSC
2010
158views more  SIAMSC 2010»
13 years 9 months ago
Solving Constrained Total-variation Image Restoration and Reconstruction Problems via Alternating Direction Methods
In this paper, we study alternating direction methods for solving constrained total-variation image restoration and reconstruction problems. Alternating direction methods can be im...
Michael K. Ng, Pierre Weiss, Xiaoming Yuan
MOC
2002
144views more  MOC 2002»
13 years 10 months ago
Convergence rate analysis of an asynchronous space decomposition method for convex Minimization
Abstract. We analyze the convergence rate of an asynchronous space decomposition method for constrained convex minimization in a reflexive Banach space. This method includes as spe...
Xue-Cheng Tai, Paul Tseng
FAW
2008
Springer
127views Algorithms» more  FAW 2008»
14 years 18 days ago
Visiting a Polygon on the Optimal Way to a Query Point
Abstract. We study a constrained version of the shortest path problem in polygonal domains, in which the path must visit a given target polygon. We provide an efficient algorithm f...
Ramtin Khosravi, Mohammad Ghodsi