Journal article · 1999
Fortified-Descent Simplicial Search Method: A General Approach
SIAM Journal on Optimization, 10(1), 269–288 · Published 1 January 1999 · DOI 10.1137/s1052623495282857
In brief
“Fortified-Descent Simplicial Search Method: A General Approach” is a 1999 journal article by Paul Tseng, published in SIAM Journal on Optimization. OpenAlex counts 89 citations as of 16 November 2026. The publisher's version is not open access, and OpenAlex records no free legal copy.
- Citations
- 89
- Most cited in
- 2017 (5)
- Field-weighted impact
- 4.20
- References
- 25
- Authors
- 1
Abstract
We propose a new simplex-based direct search method for unconstrained minimization of a real-valued function f of n variables. As in other methods of this kind, the intent is to iteratively improve an n-dimensional simplex through certain reflection/expansion/contraction steps. The method has three novel features. First, a user-chosen integer $\bar m_k$ specifies the number of… Read the full abstract at the publisher.
Excerpt. This paper is not open access.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Tseng, P. (1999). Fortified-Descent Simplicial Search Method: A General Approach. SIAM Journal on Optimization, 10(1), 269–288. https://doi.org/10.1137/s1052623495282857
MLA 9
Tseng, Paul. “Fortified-Descent Simplicial Search Method: A General Approach.” SIAM Journal on Optimization, vol. 10, no. 1, 1999, pp. 269–288. https://doi.org/10.1137/s1052623495282857.
Chicago
Tseng, Paul. 1999. “Fortified-Descent Simplicial Search Method: A General Approach.” SIAM Journal on Optimization 10 (1): 269–288. https://doi.org/10.1137/s1052623495282857.
Harvard
Tseng, P. (1999) ‘Fortified-Descent Simplicial Search Method: A General Approach’, SIAM Journal on Optimization, 10(1), pp. 269–288. doi:10.1137/s1052623495282857.
IEEE
P. Tseng, “Fortified-Descent Simplicial Search Method: A General Approach,” SIAM Journal on Optimization, vol. 10, no. 1, pp. 269–288, 1999, doi: 10.1137/s1052623495282857.
BibTeX
@article{tseng1999fortified,
title = {{Fortified-Descent Simplicial Search Method: A General Approach}},
author = {Tseng, Paul},
journal = {SIAM Journal on Optimization},
year = {1999},
volume = {10},
number = {1},
pages = {269--288},
doi = {10.1137/s1052623495282857},
url = {https://doi.org/10.1137/s1052623495282857}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Citations by year
| Year | Citations | Share of the best year |
|---|---|---|
| 2017 | 5 | |
| 2018 | 3 | |
| 2019 | 3 | |
| 2020 | 4 | |
| 2021 | 5 | |
| 2022 | 3 | |
| 2023 | 3 | |
| 2024 | 2 | |
| 2025 | 1 | |
| 2026 | 2 |
Its field-weighted citation impact is 4.20: it has been cited 4.20 times as often as the average work of the same field, type and year (1.00 is the world average).
Topic and keywords
Physical Sciences › Mathematics › Numerical Analysis › Advanced Optimization Algorithms Research
- direct search methods
- simplex method
- unconstrained optimization
- critical points
- convergence analysis
Work with this paper
Most-cited papers in Mathematics
- Random ForestsLeo Breiman · Machine Learning · 2001 · 142,830 citations
- Controlling the False Discovery Rate: A Practical and Powerful Approach to Multiple TestingYoav Benjamini, Yosef Hochberg · Journal of the Royal Statistical Society Series B (Statistical Methodology) · 1995 · 113,923 citations
- Fitting Linear Mixed-Effects Models Using lme4Douglas M. Bates, Martin Maechler, Benjamin M. Bolker and 1 more · Journal of Statistical Software · 2015 · 100,328 citations
- The moderator-mediator variable distinction in social psychological research: Conceptual, strategic, and statistical considerations.Reuben M. Baron, David A. Kenny · Journal of Personality and Social Psychology · 1986 · 95,866 citations
- Using multivariate statisticsBarbara Gerson Tabachnick, Linda S. Fidell · 1983 · 79,867 citations
Questions about this paper
How do I cite this paper in APA style?
Tseng, P. (1999). Fortified-Descent Simplicial Search Method: A General Approach. SIAM Journal on Optimization, 10(1), 269–288. https://doi.org/10.1137/s1052623495282857
How many times has this paper been cited?
89 times, according to OpenAlex on 16 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.
Is this paper free to read?
OpenAlex records no free legal copy. Check your library's access, the authors' pages or a repository, or ask the corresponding author for a copy.
Who wrote this paper?
Paul Tseng.
What is the DOI of this paper?
10.1137/s1052623495282857. The permanent link is https://doi.org/10.1137/s1052623495282857.
Bibliographic data from OpenAlex (CC0), last checked 16 November 2026. ResearchGuru does not host this paper; the links go to the publisher or the repository that does.