Some exact iterative procedures for finding the puncture point of a convex set (Q755157): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
(One intermediate revision by one other user not shown) | |||
Property / cites work | |||
Property / cites work: Optimal Experimental Designs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Übersichtsarbeiten / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Convergent design sequences, for sufficiently regular optimality criteria / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Equivalence Theorems and Cutting Plane Algorithms for a Class of Experimental Design Problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Remez's procedure for finding optimal designs / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/bf00934787 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2072941751 / rank | |||
Normal rank |
Latest revision as of 11:15, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Some exact iterative procedures for finding the puncture point of a convex set |
scientific article |
Statements
Some exact iterative procedures for finding the puncture point of a convex set (English)
0 references
1980
0 references
convex sets
0 references
supporting hyperplanes
0 references
minimax points
0 references
optimal experimental design
0 references
0 references