Projections onto order simplexes

DOI10.1007/BF01449044zbMath0577.65049MaRDI QIDQ1065504

S. J. Grotzinger, Christoph Witzgall

Publication date: 1984

Published in: Applied Mathematics and Optimization (Search for Journal in Brave)

zbMATH Keywords

Lagrange multiplierscurve fittingsimplexKuhn-Tucker conditionsIsotonic regressionshortest distance problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20)

Related Items

Projected gradient algorithms for optimization over order simplices, Company rating with support vector machines, Acceleration of expectation-maximization algorithm for length-biased right-censored data, Algorithms for bound constrained quadratic programming problems, Combining isotonic regression and EM algorithm to predict genetic risk under monotonicity constraint, A branch and bound method solving the max–min linear discriminant analysis problem, SLOPE-adaptive variable selection via convex optimization, Adaptive risk bounds in unimodal regression, Estimating ordered parameters by linear programming, Dimension-reduced nonparametric maximum likelihood computation for interval-censored data, Active set algorithms for isotonic regression; a unifying framework, Distribution-free properties of isotonic regression, Projections onto order simplexes, Projection onto simplicial cones by Picard's method, Signal Decomposition Using Masked Proximal Operators

Cites Work

• Projections onto order simplexes
• Multidimensional scaling by optimizing goodness of fit to a nonmetric hypothesis
• Nonmetric multidimensional scaling. A numerical method
• A polynomially bounded algorithm for a singly constrained quadratic program
• Validation of subgradient optimization
• The Differentiation of Pseudo-Inverses and Nonlinear Least Squares Problems Whose Variables Separate