Preprint · 2006
A New Algorithm for Continuous Optimization
RePEc: Research Papers in Economics · Published 4 August 2006
In brief
“A New Algorithm for Continuous Optimization” is a 2006 preprint by Desai Tejas A, published in RePEc: Research Papers in Economics. OpenAlex counts 0 citations as of 16 November 2026. The publisher's version is not open access, and OpenAlex records no free legal copy.
- Citations
- 0
- Authors
- 1
Abstract
We present a new algorithm for continuous, nonlinear or linear, and constrained or unconstrained optimization. After proving its convergence, we apply it to unconstrained and constrained maximum likelihood estimation, and compare its performance to that of the Newton-Raphson algorithm. 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
A, D. T. (2006). A New Algorithm for Continuous Optimization. RePEc: Research Papers in Economics. https://www.iima.ac.in/sites/default/files/rnpfiles/2006-08-04tejasdesai.pdf
MLA 9
A, Desai Tejas. “A New Algorithm for Continuous Optimization.” RePEc: Research Papers in Economics, 2006. https://www.iima.ac.in/sites/default/files/rnpfiles/2006-08-04tejasdesai.pdf.
Chicago
A, Desai Tejas. 2006. “A New Algorithm for Continuous Optimization.” RePEc: Research Papers in Economics. https://www.iima.ac.in/sites/default/files/rnpfiles/2006-08-04tejasdesai.pdf.
Harvard
A, D. T. (2006) ‘A New Algorithm for Continuous Optimization’, RePEc: Research Papers in Economics. Available at: https://www.iima.ac.in/sites/default/files/rnpfiles/2006-08-04tejasdesai.pdf.
IEEE
D. T. A, “A New Algorithm for Continuous Optimization,” RePEc: Research Papers in Economics, 2006.
BibTeX
@misc{a2006algorithm,
title = {{A New Algorithm for Continuous Optimization}},
author = {A, Desai Tejas},
howpublished = {RePEc: Research Papers in Economics},
year = {2006},
url = {https://www.iima.ac.in/sites/default/files/rnpfiles/2006-08-04tejasdesai.pdf}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Topic and keywords
Physical Sciences › Mathematics › Numerical Analysis › Advanced Optimization Algorithms Research
- nonlinear programming
- linear programming
- constrained optimization
- unconstrained optimization
- convergence proof
- maximum likelihood estimation
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?
A, D. T. (2006). A New Algorithm for Continuous Optimization. RePEc: Research Papers in Economics. https://www.iima.ac.in/sites/default/files/rnpfiles/2006-08-04tejasdesai.pdf
How many times has this paper been cited?
0 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?
Desai Tejas A.
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.