The following pages link to Robert L. Smith (Q200435):
Displaying 50 items.
- Parameter-free sampled fictitious play for solving deterministic dynamic programming problems (Q289136) (← links)
- Fastest-path planning for direction-dependent speed functions (Q368729) (← links)
- Solving infinite horizon optimization problems through analysis of a one-dimensional global optimization problem (Q524908) (← links)
- Sampled fictitious play for approximate dynamic programming (Q547121) (← links)
- Pattern discrete and mixed hit-and-run for global optimization (Q645554) (← links)
- Denumerable state nonhomogeneous Markov decision processes (Q805501) (← links)
- Convergence of selections with applications in optimization (Q805503) (← links)
- Convergence of minimum norm elements of projections and intersections of nested affine spaces in Hilbert space (Q874958) (← links)
- Adaptive search with stochastic acceptance probabilities for global optimization (Q943781) (← links)
- Characterizing extreme points as basic feasible solutions in infinite linear programs (Q1002074) (← links)
- Pure adaptive search in Monte Carlo optimization (Q1119467) (← links)
- Duality in infinite dimensional linear programming (Q1184338) (← links)
- Pure adaptive search in global optimization (Q1184353) (← links)
- Convergence of best approximations from unbounded sets (Q1191775) (← links)
- Finite dimensional approximation in infinite dimensional mathematical programming (Q1196721) (← links)
- Parallel algorithms for solving aggregated shortest-path problems (Q1304488) (← links)
- Optimal average value convergence in nonhomogeneous Markov decision processes (Q1323097) (← links)
- Simulated annealing for constrained global optimization (Q1337127) (← links)
- Optimal estimation of univariate black-box Lipschitz functions with upper and lower error bounds. (Q1422350) (← links)
- Solving nonstationary infinite horizon stochastic production planning problems (Q1593714) (← links)
- Markov perfect equilibrium existence for a class of undiscounted infinite-horizon dynamic games (Q1594882) (← links)
- Extreme point characterization of constrained nonstationary infinite-horizon Markov decision processes with finite state space (Q1785223) (← links)
- Solvability in infinite horizon optimization (Q1785414) (← links)
- A paradox in equipment replacement under technological improvement (Q1870011) (← links)
- Existence of efficient solutions in infinite horizon optimization under continuous and discrete controls (Q1886804) (← links)
- Solution existence for time-varying infinite horizon quadratic programming (Q1909990) (← links)
- Solving nonstationary infinite horizon dynamic optimization problems (Q1977807) (← links)
- Dual-based methods for solving infinite-horizon nonstationary deterministic dynamic programs (Q2020606) (← links)
- A greedy algorithm for finding maximum spanning trees in infinite graphs (Q2102829) (← links)
- Improving hit-and-run for global optimization (Q2366968) (← links)
- Conditions for the discovery of solution horizons (Q2368078) (← links)
- Infinite horizon optimality criteria for equipment replacement under technological change (Q2457266) (← links)
- An analytically derived cooling schedule for simulated annealing (Q2460137) (← links)
- A dynamic programming approach to efficient sampling from Boltzmann distributions (Q2517788) (← links)
- An elementary proof of the duality theorem of linear programming (Q2556273) (← links)
- Optimality criteria for deterministic discrete-time infinite horizon optimization (Q2569984) (← links)
- Single observation adaptive search for discrete and continuous stochastic optimization (Q2661541) (← links)
- Shadow prices in infinite-dimensional linear programming (Q2757532) (← links)
- Existence and discovery of average optimal solutions in deterministic infinite horizon optimization (Q2757542) (← links)
- Approximating extreme points of infinite-dimensional convex sets (Q2757544) (← links)
- Direction choice for accelerated convergence in hit-and-run sampling (Q2781135) (← links)
- Infinite horizon production planning in time-varying systems with convex production and inventory costs (Q2784036) (← links)
- Hit-and-run algorithms for the identification of nonredundant linear inequalities (Q3026740) (← links)
- A Shadow Simplex Method for Infinite Linear Programs (Q3098281) (← links)
- Discrete Hit-and-Run for Sampling Points from Arbitrary Distributions Over Subsets of Integer Hyperrectangles (Q3100380) (← links)
- Average Optimality in Nonhomogeneous Infinite Horizon Markov Decision Processes (Q3169135) (← links)
- A Simplex Method for Uncapacitated Pure-supply Infinite Network Flow Problems (Q3174805) (← links)
- Random Procedures for Nonredundant Constraint Identification in Stochastic Linear Programs (Q3217951) (← links)
- Efficient Monte Carlo Procedures for Generating Points Uniformly Distributed over Bounded Regions (Q3345655) (← links)
- Conditions for the Existence of Planning Horizons (Q3347585) (← links)
