The complexity of anl p method for discrete Tchebycheff approximation in exact arithmetic

DOI10.1007/BF02591956zbMath0571.90077MaRDI QIDQ3688114

Allen A. Goldstein

Publication date: 1985

Published in: Mathematical Programming (Search for Journal in Brave)

zbMATH Keywords

greedy algorithmepsilon optimality\(l_ p\) normcomplexity of discrete Tchebycheff approximation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Best approximation, Chebyshev systems (41A50)

Cites Work

• Optimal short-term scheduling of large-scale power systems
• Projected Newton Methods for Optimization Problems with Simple Constraints
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The complexity of anl p method for discrete Tchebycheff approximation in exact arithmetic