Minimizing Separable Convex Functions Subject to Simple Chain Constraints
From MaRDI portal
Publication:4509731
DOI10.1137/S1052623497314970zbMath0955.90100MaRDI QIDQ4509731
Michael J. Best, Nilotpal Chakravarti, Vasant A. Ubhaya
Publication date: 19 October 2000
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
computational complexityconvex functionsisotonic regressionmedian regressionpool adjacent violators algorithm
Analysis of algorithms and problem complexity (68Q25) Convex programming (90C25) Monotonic functions, generalizations (26A48)
Related Items
Optimal deterministic and robust selection of electricity contracts ⋮ Projected gradient algorithms for optimization over order simplices ⋮ A dynamic programming approach for generalized nearly isotonic optimization ⋮ Estimating ordered parameters by linear programming ⋮ On the Convergence of a Greedy Algorithm for the Solution of the Problem for the Construction of Monotone Regression ⋮ A pool-adjacent-violators type algorithm for non-parametric estimation of current status data with dependent censoring ⋮ Non-convex isotonic regression via the Myersonian approach ⋮ Isotone functions, dual cones, and networks ⋮ An \(O(n)\) algorithm for weighted least squares regression by integer quasi-convex and unimodal or umbrella functions ⋮ Analyzing an extension of the isotonic regression problem ⋮ A dual active set algorithm for optimal sparse convex regression ⋮ Efficient algorithms for the inverse sorting problem with bound constraints under the \(l_{\infty }\)-norm and the Hamming distance
