Invex Programs¶
Barik, A., Sra, S., & Honorio, J. (2023). Invex Programs: First Order Algorithms and Their Convergence.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Domain-specific¶
- Invex Function
- Invexity permits another map, so a function can fail the straight-line convexity test while retaining a first-order global bound.
This sourceOriginal research paper; the example's derivative-sign argument and displayed piecewise $\eta$ are explicit derivations here from its printed function and definition.
- Invexity permits another map, so a function can fail the straight-line convexity test while retaining a first-order global bound.
Verification¶
Does it exist? Not checked yet. This entry carries no identifier to resolve. It was extracted from the citation as written in the article, normalized, and deduplicated against the rest of the registry.
Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:5b1fb6cc5621 · see in the full table