Journal article · 2008

A Recursive Algorithm for Minimizing Non-Smooth Convex Function over n-Dimensional Simplex

E. Y. Morozova, Alexander M. Korsunsky

AIP conference proceedings, 1045, 21–30 · Published 1 January 2008 · DOI 10.1063/1.2991347

View at the publisherCite this paper

In brief

“A Recursive Algorithm for Minimizing Non-Smooth Convex Function over n-Dimensional Simplex” is a 2008 journal article by E. Y. Morozova and Alexander M. Korsunsky, published in AIP conference proceedings. 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
References
6
Authors
2

Abstract

A new method for solving constrained minimization problem when the feasible region is an n‐dimensional simplex is presented. This method generalizes a one‐dimensional bisection method for the case n>1 using a recursive procedure. The convergence of the method for the class of strictly convex functions is proved. The method does not require differentiability of function… 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

Morozova, E. Y., & Korsunsky, A. M. (2008). A Recursive Algorithm for Minimizing Non-Smooth Convex Function over n-Dimensional Simplex. AIP conference proceedings, 1045, 21–30. https://doi.org/10.1063/1.2991347

MLA 9

Morozova, E. Y., and Alexander M. Korsunsky. “A Recursive Algorithm for Minimizing Non-Smooth Convex Function over n-Dimensional Simplex.” AIP conference proceedings, vol. 1045, 2008, pp. 21–30. https://doi.org/10.1063/1.2991347.

Chicago

Morozova, E. Y. and Alexander M. Korsunsky. 2008. “A Recursive Algorithm for Minimizing Non-Smooth Convex Function over n-Dimensional Simplex.” AIP conference proceedings 1045: 21–30. https://doi.org/10.1063/1.2991347.

Harvard

Morozova, E. Y. and Korsunsky, A. M. (2008) ‘A Recursive Algorithm for Minimizing Non-Smooth Convex Function over n-Dimensional Simplex’, AIP conference proceedings, 1045, pp. 21–30. doi:10.1063/1.2991347.

IEEE

E. Y. Morozova and A. M. Korsunsky, “A Recursive Algorithm for Minimizing Non-Smooth Convex Function over n-Dimensional Simplex,” AIP conference proceedings, vol. 1045, pp. 21–30, 2008, doi: 10.1063/1.2991347.

BibTeX

@article{morozova2008recursive,
  title     = {{A Recursive Algorithm for Minimizing Non-Smooth Convex Function over n-Dimensional Simplex}},
  author    = {Morozova, E. Y. and Korsunsky, Alexander M.},
  journal   = {AIP conference proceedings},
  year      = {2008},
  volume    = {1045},
  pages     = {21--30},
  doi       = {10.1063/1.2991347},
  url       = {https://doi.org/10.1063/1.2991347}
}

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

  • nonsmooth convex optimization
  • simplex
  • constrained minimization
  • recursive algorithm
  • strictly convex functions
  • convergence analysis
  • derivative-free optimization

Work with this paper

Most-cited papers in Mathematics

All highly cited Mathematics papers

Questions about this paper

How do I cite this paper in APA style?

Morozova, E. Y., & Korsunsky, A. M. (2008). A Recursive Algorithm for Minimizing Non-Smooth Convex Function over n-Dimensional Simplex. AIP conference proceedings, 1045, 21–30. https://doi.org/10.1063/1.2991347

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?

E. Y. Morozova, Alexander M. Korsunsky.

What is the DOI of this paper?

10.1063/1.2991347. The permanent link is https://doi.org/10.1063/1.2991347.

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.