An unconditional lower bound for the active-set method in convex quadratic maximization

Documenti analoghi

• An unconditional lower bound for the active-set method on the hypercube
  di: Disser, Yann, et al.
  Pubblicazione: (2025)
• A unified worst case for classical simplex and policy iteration pivot rules
  di: Disser, Yann, et al.
  Pubblicazione: (2023)
• Isometric path complexity of graphs
  di: Chakraborty, Dibyayan, et al.
  Pubblicazione: (2022)
• Enumeration of minimal transversals of hypergraphs of bounded VC-dimension
  di: Mary, Arnaud
  Pubblicazione: (2024)
• Algorithms and complexity for monitoring edge-geodetic sets in graphs
  di: Foucaud, Florent, et al.
  Pubblicazione: (2024)