Sciweavers

309 search results - page 2 / 62
» Smooth Optimization with Approximate Gradient
Sort
View
WINE
2007
Springer
166views Economy» more  WINE 2007»
13 years 11 months ago
Gradient-Based Algorithms for Finding Nash Equilibria in Extensive Form Games
We present a computational approach to the saddle-point formulation for the Nash equilibria of two-person, zero-sum sequential games of imperfect information. The algorithm is a ï¬...
Andrew Gilpin, Samid Hoda, Javier Peña, Tuo...
TCAD
2008
68views more  TCAD 2008»
13 years 5 months ago
Highly Efficient Gradient Computation for Density-Constrained Analytical Placement
Abstract--Recent analytical global placers use density constraints to approximate nonoverlap constraints, and these show very successful results. This paper unifies a wide range of...
Jason Cong, Guojie Luo, Eric Radke
PLDI
2010
ACM
13 years 10 months ago
Smooth interpretation
We present smooth interpretation, a method to systematically approximate numerical imperative programs by smooth mathematical functions. This approximation facilitates the use of ...
Swarat Chaudhuri, Armando Solar-Lezama
GECCO
2004
Springer
117views Optimization» more  GECCO 2004»
13 years 10 months ago
Comparing Search Algorithms for the Temperature Inversion Problem
Several inverse problems exist in the atmospheric sciences that are computationally costly when using traditional gradient based methods. Unfortunately, many standard evolutionary ...
Monte Lunacek, L. Darrell Whitley, Philip Gabriel,...
SIAMCO
2002
121views more  SIAMCO 2002»
13 years 4 months ago
Consistent Approximations and Approximate Functions and Gradients in Optimal Control
As shown in [7], optimal control problems with either ODE or PDE dynamics can be solved efficiently using a setting of consistent approximations obtained by numerical discretizati...
Olivier Pironneau, Elijah Polak