Surrogate optimization for p-norms
From MaRDI portal
(Redirected from Publication:2010926)
Surrogate optimization for \(p\)-norms (scientific article; zbMATH DE number 7138069)
Surrogate optimization for \(p\)-norms (scientific article; zbMATH DE number 7138069)
Recommendations
Cites work
- scientific article; zbMATH DE number 3534506 (Why is no real title available?)
- scientific article; zbMATH DE number 3544074 (Why is no real title available?)
- scientific article; zbMATH DE number 3073200 (Why is no real title available?)
- All-norm approximation algorithms
- All-norms and all-L_p-norms approximation algorithms
- An Analysis of the Greedy Heuristic for Independence Systems
- Combinatorial optimization. Theory and algorithms.
- Fairness Measures for Resource Allocation
- Greedy in Approximation Algorithms
- Nash equilibria with minimum potential in undirected broadcast games
- Potential games
- Robust Matchings
- Robust independence systems
- Robust matchings and matroid intersections
- Selfish load balancing
- Simultaneous optimization via approximate majorization for concave profits or convex costs
- Sparse Approximate Solutions to Linear Systems
- Surrogate optimization for p-norms
- The Price of Stability for Network Design with Fair Cost Allocation
Cited in
(2)
This page was built for publication: Surrogate optimization for \(p\)-norms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2010926)