Journal article · 1984

Extension of unconstrained minimization methods to linearly constrained problems

Wolfgang Schneiderheinze

Mathematische Operationsforschung und Statistik Series Optimization, 15(2), 231–242 · Published 1 January 1984 · DOI 10.1080/02331938408842929

View at the publisherCite this paper

In brief

“Extension of unconstrained minimization methods to linearly constrained problems” is a 1984 journal article by Wolfgang Schneiderheinze, published in Mathematische Operationsforschung und Statistik Series Optimization. OpenAlex counts 1 citations as of 16 November 2026. The publisher's version is not open access, and OpenAlex records no free legal copy.

Citations
1
Field-weighted impact
0.51
References
13
Authors
1

Abstract

We characterize a class of methods for unconstrained optimization, immediately applicable to linearly constrained problems. For this purpose we give a general scheme of algorithms and convergence theorems. 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

Schneiderheinze, W. (1984). Extension of unconstrained minimization methods to linearly constrained problems. Mathematische Operationsforschung und Statistik Series Optimization, 15(2), 231–242. https://doi.org/10.1080/02331938408842929

MLA 9

Schneiderheinze, Wolfgang. “Extension of unconstrained minimization methods to linearly constrained problems.” Mathematische Operationsforschung und Statistik Series Optimization, vol. 15, no. 2, 1984, pp. 231–242. https://doi.org/10.1080/02331938408842929.

Chicago

Schneiderheinze, Wolfgang. 1984. “Extension of unconstrained minimization methods to linearly constrained problems.” Mathematische Operationsforschung und Statistik Series Optimization 15 (2): 231–242. https://doi.org/10.1080/02331938408842929.

Harvard

Schneiderheinze, W. (1984) ‘Extension of unconstrained minimization methods to linearly constrained problems’, Mathematische Operationsforschung und Statistik Series Optimization, 15(2), pp. 231–242. doi:10.1080/02331938408842929.

IEEE

W. Schneiderheinze, “Extension of unconstrained minimization methods to linearly constrained problems,” Mathematische Operationsforschung und Statistik Series Optimization, vol. 15, no. 2, pp. 231–242, 1984, doi: 10.1080/02331938408842929.

BibTeX

@article{schneiderheinze1984extension,
  title     = {{Extension of unconstrained minimization methods to linearly constrained problems}},
  author    = {Schneiderheinze, Wolfgang},
  journal   = {Mathematische Operationsforschung und Statistik Series Optimization},
  year      = {1984},
  volume    = {15},
  number    = {2},
  pages     = {231--242},
  doi       = {10.1080/02331938408842929},
  url       = {https://doi.org/10.1080/02331938408842929}
}

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

  • unconstrained optimization
  • linearly constrained optimization
  • constrained optimization
  • convergence theorems
  • optimization algorithms

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?

Schneiderheinze, W. (1984). Extension of unconstrained minimization methods to linearly constrained problems. Mathematische Operationsforschung und Statistik Series Optimization, 15(2), 231–242. https://doi.org/10.1080/02331938408842929

How many times has this paper been cited?

1 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?

Wolfgang Schneiderheinze.

What is the DOI of this paper?

10.1080/02331938408842929. The permanent link is https://doi.org/10.1080/02331938408842929.

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.