Approximable minimization problems and optimal solutions on random inputs

DOI10.1007/BFB0049329MaRDI QIDQ4525282zbMATH OpenFDO

Authors Erich Grädel, A. Malmström

Publication date 22 January 2001

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0049329

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 2079029
• Random algorithms for convex minimization problems
• Approximative solutions of stochastic optimization problems
• Solving a Class of Stochastic Minimization Problems
• scientific article; zbMATH DE number 4041633
• scientific article; zbMATH DE number 887502
• Minimization of stochastic functionals and random variational inequalities
• On the hardness of approximating minimization problems
• Stochastic approximation algorithm for minimax problems

Cited in

(5)

• Randomized first order algorithms with applications to \(\ell _{1}\)-minimization
• Minimization Algorithms for Functions with Random Noise
• On the minimal cost of approximating linear problems based on information with deterministic noise
• scientific article; zbMATH DE number 4041633 (Why is no real title available?)
• scientific article; zbMATH DE number 2079029 (Why is no real title available?)

This page was built for publication: Approximable minimization problems and optimal solutions on random inputs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4525282)