Sciweavers

1659 search results - page 14 / 332
» From Functional Analysis to Iterative Methods
Sort
View
CISS
2008
IEEE
14 years 2 months ago
Subgradient methods in network resource allocation: Rate analysis
— We consider dual subgradient methods for solving (nonsmooth) convex constrained optimization problems. Our focus is on generating approximate primal solutions with performance ...
Angelia Nedic, Asuman E. Ozdaglar
MP
2011
12 years 10 months ago
An interior-point piecewise linear penalty method for nonlinear programming
We present an interior-point penalty method for nonlinear programming (NLP), where the merit function consists of a piecewise linear penalty function (PLPF) and an 2-penalty functi...
Lifeng Chen, Donald Goldfarb
ICRA
2009
IEEE
227views Robotics» more  ICRA 2009»
14 years 2 months ago
Adaptive autonomous control using online value iteration with gaussian processes
— In this paper, we present a novel approach to controlling a robotic system online from scratch based on the reinforcement learning principle. In contrast to other approaches, o...
Axel Rottmann, Wolfram Burgard
IJBRA
2006
61views more  IJBRA 2006»
13 years 7 months ago
Finding functional promoter motifs by computational methods: a word of caution
: The standard practice in the analysis of promoters is to select promoter regions of convenient length. This may lead to false results when searching for Transcription Factor Bind...
Rajesh Chowdhary, Limsoon Wong, Vladimir B. Bajic
SIGGRAPH
1994
ACM
13 years 11 months ago
A framework for the analysis of error in global illumination algorithms
In this paper we identify sources of error in global illumination algorithms and derive bounds for each distinct category. Errors arise from three sources: inaccuracies in the bou...
James Arvo, Kenneth E. Torrance, Brian E. Smits