A Fast Scaling Algorithm for Minimizing Separable Convex Functions Subject to Chain Constraints

DOI10.1287/opre.49.5.784.10601zbMath1163.90695OpenAlexW1984313645MaRDI QIDQ3635035

Ravindra K. Ahuja, James B. Orlin

Publication date: 3 July 2009

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.49.5.784.10601

Mathematics Subject Classification ID

General nonlinear regression (62J02) Convex programming (90C25)

Related Items

Optimal deterministic and robust selection of electricity contracts, Maximum likelihood estimation for ordered expectations of correlated binary variables, Projected gradient algorithms for optimization over order simplices, An improved earliness--tardiness timing algorithm, Weighted \(L_{\infty}\) isotonic regression, Inverse sorting problem by minimizing the total weighted number of changes and partial inverse sorting problems, A dynamic programming approach for generalized nearly isotonic optimization, Learning from incomplete data in Bayesian networks with qualitative influences, Pooling adjacent violators under interval constraints, Strict \(L_{\infty }\) isotonic regression, A Faster Algorithm Solving a Generalization of Isotonic Median Regression and a Class of Fused Lasso Problems, Isotonic regression via partitioning, Recent progress of local search in handling the time window constraints of the vehicle routing problem, On the Convergence of a Greedy Algorithm for the Solution of the Problem for the Construction of Monotone Regression, An iterated local search algorithm for the vehicle routing problem with convex time penalty functions, The minmax regret inverse maximum weight problem, An iterated local search algorithm for the time-dependent vehicle routing problem with time windows, Non-convex isotonic regression via the Myersonian approach, Recent progress of local search in handling the time window constraints of the vehicle routing problem, Learning Bayesian network parameters under order constraints, Unimodal regression via prefix isotonic regression, 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