Minimization of convex functions on the convex hull of a point set

DOI10.1007/s00186-005-0018-4zbMath1109.90066OpenAlexW2159705467MaRDI QIDQ2433235

Josef Stoer, Nikolai D. Botkin

Publication date: 27 October 2006

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00186-005-0018-4

zbMATH Keywords

Barycentric coordinatesConvex functions on simplexesProjection of directions on simplexes

Mathematics Subject Classification ID

Convex programming (90C25) Methods of reduced gradient type (90C52)

Related Items (3)

An interior-point method for minimizing convex functions on the convex hull of a point set ⋮ Construction of constrained experimental designs on finite spaces for a modified \(\mathrm{E}_k\)-optimality criterion ⋮ Sensor network scheduling for identification of spatially distributed processes

Cites Work

• A finite algorithm for finding the projection of a point onto the canonical simplex of \({\mathbb R}^ n\)
• The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
• Projected gradient methods for linearly constrained problems
• Projected Newton Methods for Optimization Problems with Simple Constraints
• The Gradient Projection Method for Nonlinear Programming. Part II. Nonlinear Constraints

This page was built for publication: Minimization of convex functions on the convex hull of a point set