Projections onto order simplexes

DOI10.1007/BF01449044zbMATH Open0577.65049MaRDI QIDQ1065504FDOQ1065504

Authors: S. J. Grotzinger, Christoph Witzgall 

Publication date: 1984

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

Recommendations

• Isotonic regression and isotonic projection
• Active set algorithms for isotonic regression; a unifying framework
• An Exact Algorithm for Projection onto a Polyhedral Cone
• scientific article; zbMATH DE number 1124622
• Least-squares estimation of two-ordered monotone regression curves

zbMATH Keywords

Lagrange multiplierssimplexcurve fittingKuhn-Tucker conditionsIsotonic regressionshortest distance problem

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (21)

• SLOPE-adaptive variable selection via convex optimization
• Projections onto order simplexes
• Combining isotonic regression and EM algorithm to predict genetic risk under monotonicity constraint
• Title not available (Why is that?)
• An algebraic approach to projective uniqueness with an application to order polytopes
• Company rating with support vector machines
• Distribution-free properties of isotonic regression
• Projected gradient algorithms for optimization over order simplices
• Signal Decomposition Using Masked Proximal Operators
• Algorithms for bound constrained quadratic programming problems
• Computation of the nonparametric maximum likelihood estimate of a univariate log-concave density
• The branching orders of a quasi-ordinary projection
• Projecting a simplex onto another one
• A branch and bound method solving the max–min linear discriminant analysis problem
• Dimension-reduced nonparametric maximum likelihood computation for interval-censored data
• Adaptive risk bounds in unimodal regression
• Acceleration of expectation-maximization algorithm for length-biased right-censored data
• On multiple-valued ordered projective planes
• Estimating ordered parameters by linear programming
• Projection onto simplicial cones by Picard's method
• Active set algorithms for isotonic regression; a unifying framework

This page was built for publication: Projections onto order simplexes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1065504)