Sciweavers

5331 search results - page 32 / 1067
» Algebraic Methods for Optimization Problems
Sort
View
ICASSP
2011
IEEE
13 years 1 months ago
An ALPS view of sparse recovery
We provide two compressive sensing (CS) recovery algorithms based on iterative hard-thresholding. The algorithms, collectively dubbed as algebraic pursuits (ALPS), exploit the res...
Volkan Cevher
SIAMNUM
2010
113views more  SIAMNUM 2010»
13 years 4 months ago
Inexact Restoration for Runge-Kutta Discretization of Optimal Control Problems
A numerical method is presented for Runge
C. Yalçin Kaya
ANOR
2005
120views more  ANOR 2005»
13 years 9 months ago
Solving the Vehicle Routing Problem with Stochastic Demands using the Cross-Entropy Method
An alternate formulation of the classical vehicle routing problem with stochastic demands (VRPSD) is considered. We propose a new heuristic method to solve the problem. The algori...
Krishna Chepuri, Tito Homem-de-Mello
CDC
2008
IEEE
111views Control Systems» more  CDC 2008»
13 years 12 months ago
A Hamiltonian approximation method for the reduction of controlled systems
Abstract-- This paper considers the problem of model reduction for controlled systems. The paper considers a dual/adjoint formulation of the general optimization problem to minimiz...
Siep Weiland
TRANSCI
2008
80views more  TRANSCI 2008»
13 years 9 months ago
An Efficient Method to Compute Traffic Assignment Problems with Elastic Demands
The traffic assignment problem with elastic demands can be formulated as an optimization problem, whose objective is sum of a congestion function and a disutility function. We pro...
Frédéric Babonneau, Jean-Philippe Vi...