Pages that link to "Item:Q4509731"

The following pages link to Minimizing Separable Convex Functions Subject to Simple Chain Constraints (Q4509731):

Displaying 12 items.

• A pool-adjacent-violators type algorithm for non-parametric estimation of current status data with dependent censoring (Q509838) (← links)
• Analyzing an extension of the isotonic regression problem (Q745316) (← links)
• Estimating ordered parameters by linear programming (Q928896) (← links)
• An \(O(n)\) algorithm for weighted least squares regression by integer quasi-convex and unimodal or umbrella functions (Q980027) (← links)
• Efficient algorithms for the inverse sorting problem with bound constraints under the \(l_{\infty }\)-norm and the Hamming distance (Q1034103) (← links)
• Optimal deterministic and robust selection of electricity contracts (Q2124812) (← links)
• Non-convex isotonic regression via the Myersonian approach (Q2244532) (← links)
• Projected gradient algorithms for optimization over order simplices (Q2926073) (← links)
• On the Convergence of a Greedy Algorithm for the Solution of the Problem for the Construction of Monotone Regression (Q4634678) (← links)
• A dual active set algorithm for optimal sparse convex regression (Q5230449) (← links)
• Isotone functions, dual cones, and networks (Q5938943) (← links)
• A dynamic programming approach for generalized nearly isotonic optimization (Q6102862) (← links)