Pages that link to "Item:Q1387529"
From MaRDI portal
The following pages link to Near minimax polynomial approximation (Q1387529):
Displaying 10 items.
- The near-best solution of a polynomial minimization problem by the Carathéodory-Fejér method (Q913175) (← links)
- Improved error bounds for near-minimax approximations (Q1176828) (← links)
- Master-slave strategy and polynomial approximation (Q1588828) (← links)
- Error bounds for a near-minimax approximation (Q2366658) (← links)
- Finding exact minimal polynomial by approximations (Q2959025) (← links)
- (Q3219254) (← links)
- Polygonal approximation by the minimax method (Q3318070) (← links)
- (Q3700195) (← links)
- Minimizer Extraction in Polynomial Optimization Is Robust (Q4561225) (← links)
- Polynomially bounded minimization problems which are hard to approximate (Q4630248) (← links)