<--- Back to Details
First PageDocument Content
Cybernetics / Operations research / Genetic algorithms / Quasi-Newton method / BFGS method / Evolutionary algorithm / Gauss–Newton algorithm / Linear programming / Mutation / Mathematical optimization / Numerical analysis / Applied mathematics
Date: 2002-07-06 02:24:26
Cybernetics
Operations research
Genetic algorithms
Quasi-Newton method
BFGS method
Evolutionary algorithm
Gauss–Newton algorithm
Linear programming
Mutation
Mathematical optimization
Numerical analysis
Applied mathematics

Genetic Optimization Using Derivatives∗ by Jasjeet S. Sekhon† and Walter R. Mebane, Jr.‡

Add to Reading List

Source URL: sekhon.berkeley.edu

Download Document from Source Website

File Size: 244,87 KB

Share Document on Facebook

Similar Documents

Leveraging Linear and Mixed Integer Programming for SMT Tim King1 Clark Barrett1 1 New

Leveraging Linear and Mixed Integer Programming for SMT Tim King1 Clark Barrett1 1 New

DocID: 1xVFF - View Document

Exploiting Anonymity in Approximate Linear Programming: Scaling to Large Multiagent MDPs

Exploiting Anonymity in Approximate Linear Programming: Scaling to Large Multiagent MDPs

DocID: 1xUZo - View Document

Mixed-Integer Linear Programming �LP�Branch-and-Bound Search

Mixed-Integer Linear Programming LPBranch-and-Bound Search

DocID: 1voVH - View Document

DECOMPOSITION METHODS FOR INTEGER LINEAR PROGRAMMING by  Matthew Galati

DECOMPOSITION METHODS FOR INTEGER LINEAR PROGRAMMING by Matthew Galati

DocID: 1vkrh - View Document

Approximate Linear Programming for Constrained Partially Observable Markov Decision Processes Pascal Poupart† , Aarti Malhotra† , Pei Pei† , Kee-Eung Kim§ , Bongseok Goh§ and Michael Bowling‡ †  David R. Cher

Approximate Linear Programming for Constrained Partially Observable Markov Decision Processes Pascal Poupart† , Aarti Malhotra† , Pei Pei† , Kee-Eung Kim§ , Bongseok Goh§ and Michael Bowling‡ † David R. Cher

DocID: 1vcNT - View Document