Robust Solutions to a General Class of Approximation Problems
From MaRDI portal
Recommendations
- An approximation technique for robust nonlinear optimization
- scientific article; zbMATH DE number 776097
- On approximate solutions for robust convex semidefinite optimization problems
- Robust approximation of generalized Biot-Brinkman problems
- On approximate solutions and saddle point theorems for robust convex optimization
- Essential intersection and approximation results for robust optimization
- scientific article; zbMATH DE number 7295977
- scientific article; zbMATH DE number 1748554
- Some characterizations of approximate solutions for robust semi-infinite optimization problems
- An efficient algorithm for a certain class of robust optimization problems
Cited in
(9)- Robust counterparts of errors-in-variables problems
- Data error analysis in unconstrained optimization problems with the CESTAC method
- Essential intersection and approximation results for robust optimization
- scientific article; zbMATH DE number 4200064 (Why is no real title available?)
- scientific article; zbMATH DE number 1748554 (Why is no real title available?)
- Robustness of Solutions of Almost Every System of Equations
- Robust Solutions to Linear Data Fitting Problems
- Robust optimization using computer experiments
- General robust-optimization formulation for nonlinear programming
This page was built for publication: Robust Solutions to a General Class of Approximation Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4652274)
