Mathematical Programming in Neural Networks
From MaRDI portal
Publication:4282266
DOI10.1287/ijoc.5.4.349zbMath0789.90053OpenAlexW2172126414MaRDI QIDQ4282266
Publication date: 24 March 1994
Published in: ORSA Journal on Computing (Search for Journal in Brave)
Full work available at URL: http://digital.library.wisc.edu/1793/59688
Linear programming (90C05) Neural networks for/in biological studies, artificial life and related topics (92B20)
Related Items
On detecting nonlinear patterns in discriminant problems, A NOVEL RECURRENT NEURAL NETWORK FOR SOLVING MLCPs AND ITS APPLICATION TO LINEAR AND QUADRATIC PROGRAMMING PROBLEMS, Convergence analysis of perturbed feasible descent methods, Optimization of neural networks: A comparative analysis of the genetic algorithm and simulated annealing, Smoothing methods for convex inequalities and linear complementarity problems, Approximation accuracy, gradient methods, and error bound for structured convex optimization, Optimization of sparsity-constrained neural networks as a mixed integer linear program, Discrete support vector decision trees via tabu search, A greedy randomized adaptive search procedure (GRASP) for inferring logical clauses from examples in polynomial time and some extensions, Convergence property of gradient-type methods with non-monotone line search in the presence of perturbations, A tabu search with an oscillation strategy for the discriminant analysis problem, The distance between two convex sets, Polyhedral separability through successive LP, Spherical classification of data, a new rule-based learning method, Using neural networks for trauma outcome evaluation, A class of smoothing functions for nonlinear and mixed complementarity problems, Error stability properties of generalized gradient-type algorithms
