Amanote Research
Register
Sign In
The Simplex Gradient and Noisy Optimization Problems
doi 10.1007/978-1-4612-1780-0_5
Full Text
Open PDF
Abstract
Available in
full text
Date
January 1, 1998
Authors
D. M. Bortz
C. T. Kelley
Publisher
Birkhäuser Boston
Related search
A Parametric Simplex Algorithm for Linear Vector Optimization Problems
Mathematical Programming, Series B
Mathematics
Software
Asynchronous Proximal Stochastic Gradient Algorithm for Composition Optimization Problems
Proceedings of the AAAI Conference on Artificial Intelligence
Global Convergence of Conjugate Gradient Method in Unconstrained Optimization Problems
Boletim da Sociedade Paranaense de Matematica
Mathematics
On the Numerical Performance of a New Conjugate Gradient Parameter for Solving Unconstrained Optimization Problems
International Journal of Computer Applications
The Complexity of Indefinite Elliptic Problems With Noisy Data
Journal of Complexity
Control
Numerical Analysis
Statistics
Probability
Algebra
Applied Mathematics
Number Theory
Optimization
Mathematics
Multiobjective Evolutionary Algorithm for the Optimization of Noisy Combustion Processes
IEEE Transactions on Systems, Man and Cybernetics, Part C (Applications and Reviews)
Nondegenerate Umbilics, the Path Formulation and Gradient Bifurcation Problems
International Journal of Bifurcation and Chaos in Applied Sciences and Engineering
Modeling
Engineering
Multidisciplinary
Applied Mathematics
Simulation
Optimization on Microcomputers: The Nelder-Mead Simplex Algorithm
A Simplex Algorithm---Gradient Projection Method for Nonlinear Programming
