Isotone optimization. II

DOI10.1016/0021-9045(74)90075-6zbMath0292.41026OpenAlexW4210573247MaRDI QIDQ1211676

Vasant A. Ubhaya

Publication date: 1974

Published in: Journal of Approximation Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0021-9045(74)90075-6

Mathematics Subject Classification ID

Best approximation, Chebyshev systems (41A50) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65)

Related Items (29)

Quasi-convex optimization ⋮ Box-constrained monotone approximations to Lipschitz regularizations, with applications to robust testing ⋮ The structure of isotonic regression class for LAD problems with quasi- order constraints ⋮ Consistency of \(L_ p\)-best monotone approximations ⋮ Linear time isotonic and unimodal regression in the \(L_{1}\) and \(L_{\infty }\) norms ⋮ Generalized isotone approximation and related topics ⋮ On the estimation of monotone uniform approximations ⋮ An O(n) algorithm for discrete n-point convex approximation with applications to continuous case ⋮ Strict \(L_{\infty }\) isotonic regression ⋮ On the characterization and computation of best monotone approximation in \(L_ p[0,1\) for \(1\leq p<\infty\)] ⋮ Construction of the best monotone approximation on \(L_ p[0,1\)] ⋮ An isotonic regression problem for infinite-dimensional parameters ⋮ A duality approach to best uniform convex approximation ⋮ Almost monotone approximation in \(L_\infty\) ⋮ Uniform approximation by classes of functions closed under translation and pointwise supremum ⋮ O(n) algorithms for discrete n-point approximation by quasi-convex functions ⋮ Duality in approximation and conjugate cones in normed linear spaces ⋮ Uniform approximation by classes of functions closed under translation and pointwise supremum ⋮ The computation of a best monotoneL_papproximation for 1 ≤p< ∞ ⋮ Generalized isotone optimization with applications to starshaped functions ⋮ Analyzing an extension of the isotonic regression problem ⋮ Efficient algorithms for the inverse sorting problem with bound constraints under the \(l_{\infty }\)-norm and the Hamming distance ⋮ Determination of Chebyshev approximations by nonlinear admissible subsets ⋮ Isotone optimization. I ⋮ Linear time algorithms for convex and monotone approximation ⋮ The Polya algorithm in \(L_ \infty\) approximation ⋮ Best quasi-convex uniform approximation ⋮ Lipschitz condition in minimum norm problems on bounded functions ⋮ Best piecewise monotone uniform approximation

Cites Work

• Isotone optimization. I
• A simple optimal control problem involving approximation by monotone functions
• A generalized Radon-Nikodym derivative
• Conditional Expectation Given A $\sigma$-Lattice and Applications
• A Characterization of a Conditional Expectation with Respect to a $\Sigma$- Lattice
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Isotone optimization. II