Convergence and Efficiency of Subgradient Methods for Quasiconvex Minimization

Kiwiel, K. C. (2001). Convergence and Efficiency of Subgradient Methods for Quasiconvex Minimization. Mathematical Programming, 1-25.

Type

Journal article

Intellectual base

Primary research

Year

2001

Pages

1-25

DOI

10.1007/pl00011414

DOI registrant

Springer Nature

Link

https://doi.org/10.1007/pl00011414

Cited by

1 citation across 1 artifact.

Domain-specific

• Quasiconvex Function
  • Bisection. If constraints \(f(x)\leq t\) have a convex representation, feasible/infeasible tests across (t) locate the optimum without treating (f) as convex.

Verification

Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.

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:18f85042abb4 · see in the full table