Login / Signup
A Simplicial Algorithm for the Nonlinear Stationary Point Problem on an Unbounded Polyhedron.
Yang Dai
Gerard van der Laan
A. J. J. Talman
Yoshitsugu Yamamoto
Published in:
SIAM J. Optim. (1991)
Keyphrases
</>
computational complexity
np hard
dynamic programming
cost function
optimization algorithm
convex hull
stationary points
learning algorithm
constrained optimization
objective function
optimal solution
search space
probabilistic model
simulated annealing
convergence rate