Author

Liang-Ju Li

h-index 1 View on Semantic Scholar

We have 1 of 3 papers

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

NONLINEAR OPTIMIZATION OVER TREES WITH BINARY COUPLING DECISIONS

This paper proposes an exact parametric dynamic programming algorithm that achieves polynomial oracle complexity when the node cost functions belong to a fixed degree weak Chebyshev space, a broad functional class that includes piecewise polynomials.

Liang-Ju Li, Shao-Ning Han · 0 citations