Pith. sign in

REVIEW 4 cited by

Benchmarking Optimization Software with Performance Profiles

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv cs/0102001 v2 pith:MPBGSJ6Z submitted 2001-02-01 cs.MS

Benchmarking Optimization Software with Performance Profiles

classification cs.MS
keywords performancebenchmarkingoptimizationprofilessoftwarebestcombinecomparing
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

We propose performance profiles-distribution functions for a performance metric-as a tool for benchmarking and comparing optimization software. We show that performance profiles combine the best features of other tools for performance evaluation.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 4 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Localized Photon Absorption in a Single-Crystalline Material

    physics.optics 2026-04 unverdicted novelty 7.0

    Laser pulses trigger nanometer-scale localized phase transitions in VO2 matching the photon number despite insufficient total energy, indicating localized photon energies.

  2. Localized Photon Absorption in a Single-Crystalline Material

    physics.optics 2026-04 unverdicted novelty 7.0

    Ultrafast electron diffraction shows nanometer-scale VO2 phase-transition spots whose number matches absorbed photons, even when average pulse energy is below the latent heat.

  3. Loss-aware state space geometry for quantum variational algorithms

    quant-ph 2026-04 unverdicted novelty 6.0

    Loss-aware natural gradient variants are introduced by embedding the loss hypersurface in a statistical manifold or using quantum state overlaps, yielding conformal updates that adjust effective step size.

  4. Engineering Algorithms for Dynamic Greedy Set Cover

    cs.DS 2026-04 unverdicted novelty 6.0

    First experimental study of dynamic greedy set cover algorithms reveals practical tradeoffs in quality and efficiency across real instances.