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

DOI

10.1007/pl00011414

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

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:18f85042abb4 · see in the full table