ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let H\mathcal H be the Hilbert space underlying the compact convex set considered, and let PP denote the optimal runtime complexity of its projection operator, while L(0)L(0) denotes the optimal runtime complexity of exact linear minimization. Finite-dimensional complexity claim. If the dimension of H\mathcal H is finite, then

L(0)=O(P).L(0)=\mathcal{O}(P).

This establishes that exact linear minimization is no slower than projection up to a constant factor in finite-dimensional spaces. The surrounding discussion notes that the general relationship between PP and L(0)L(0) warrants further investigation, including whether some compact convex set could satisfy P<L(0)P<L(0); the supplied text does not state whether this finite-dimensional claim has been proved.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.