1989
DOI: 10.1016/0022-2364(89)90204-7
|View full text |Cite
|
Sign up to set email alerts
|

Spectral deconvolution by simulated annealing

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
4
0

Year Published

1990
1990
1998
1998

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 9 publications
(4 citation statements)
references
References 25 publications
0
4
0
Order By: Relevance
“…Other analytical applications of SA have included calibration sample selection (19), optimizing calibration designs in multicomponent analysis (20), NMR spectral deconvolution (21), and nonlinear least-squares curve fitting of noisy fluorescence decay data (22). The latter used simulated annealing to find the region containing the globally optimal parameter estimates, which were then precisely located using the more traditional sequential simplex approach.…”
Section: Miscellaneousmentioning
confidence: 99%
“…Other analytical applications of SA have included calibration sample selection (19), optimizing calibration designs in multicomponent analysis (20), NMR spectral deconvolution (21), and nonlinear least-squares curve fitting of noisy fluorescence decay data (22). The latter used simulated annealing to find the region containing the globally optimal parameter estimates, which were then precisely located using the more traditional sequential simplex approach.…”
Section: Miscellaneousmentioning
confidence: 99%
“…Primarily used in combinatorial problems, like the traveling salesman problem (341, chip routing, or time schedule optimization (35), increasing computer power now allows use of these ideas for the optimization of continuous functions too (36)(37)(38)(39).…”
Section: Introductionmentioning
confidence: 99%
“…Heuristic optimization processes such as genetic algorithms (GA) (24)(25)(26)(27)(28)(29)(30) and simulated annealing (SA) (31,32) offer promising alternatives, since they reportedly avoid these drawbacks and explore a larger part of the landscape in a reasonable computing time (33). Primarily used in combinatorial problems, like the traveling salesman problem (341, chip routing, or time schedule optimization (35), increasing computer power now allows use of these ideas for the optimization of continuous functions too (36)(37)(38)(39).…”
Section: Introductionmentioning
confidence: 99%
“…Simulated annealing method has recently been utilized to reduce the difficulty of guessing initial values. However, this method requires very long processing time [5].…”
Section: Introductionmentioning
confidence: 99%