Pole-fitting for complex functions: enhancing standard techniques by artificial-neural-network classifiers and regressors

Cites Work

Algorithm 778: L-BFGS-B
A Limited Memory Algorithm for Bound Constrained Optimization
An efficient method for finding the minimum of a function of several variables without calculating derivatives
Title not available (Why is that?)
A Simplex Method for Function Minimization
Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
A Family of Variable-Metric Methods Derived by Variational Means
A new approach to variable metric algorithms
Conditioning of Quasi-Newton Methods for Function Minimization
An Algorithm for Least-Squares Estimation of Nonlinear Parameters
Methods of conjugate gradients for solving linear systems
A method for the solution of certain non-linear problems in least squares
The Convergence of a Class of Double-rank Minimization Algorithms 1. General Considerations
Newton-Type Minimization via the Lanczos Method
Preconditioning of Truncated-Newton Methods
A New Algorithm for Unconstrained Optimization
The<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"><mml:mi>S</mml:mi></mml:math>Matrix in Quantum Electrodynamics
Recent advances in trust region algorithms
Title not available (Why is that?)
A Relativistic Equation for Bound-State Problems
Title not available (Why is that?)
Adaptive memory programming for constrained global optimization
Matrix algorithms for solving (in)homogeneous bound state equations
Recent developments in bound-state calculations using the Dyson-Schwinger and Bethe-Salpeter equations
Visual Feature Extraction by a Multilayered Network of Analog Threshold Elements

This page was built for publication: Pole-fitting for complex functions: enhancing standard techniques by artificial-neural-network classifiers and regressors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6178489)