Some exact iterative procedures for finding the puncture point of a convex set

DOI10.1007/BF00934787zbMath0417.49045OpenAlexW2072941751MaRDI QIDQ755157

D. Kharzeev

Publication date: 1980

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00934787

zbMATH Keywords

convex setssupporting hyperplanesoptimal experimental designminimax points

Mathematics Subject Classification ID

Programming in abstract spaces (90C48) Existence theories for problems in abstract spaces (49J27) Methods of successive quadratic programming type (90C55)

Cites Work

• Convergent design sequences, for sufficiently regular optimality criteria
• Remez's procedure for finding optimal designs
• Equivalence Theorems and Cutting Plane Algorithms for a Class of Experimental Design Problems
• Optimal Experimental Designs
• Übersichtsarbeiten

This page was built for publication: Some exact iterative procedures for finding the puncture point of a convex set