1 citations · 1 across the 3 of their papers we have counts for
5 papers
Optimality conditions for mathematical programs with orthogonality type constraints
Sebastian Lämmel, Vladimir Shikhman
We consider the class of mathematical programs with orthogonality type constraints (MPOC). Orthogonality type constraints appear by reformulating the sparsity constraint via auxili…
Cardinality-constrained optimization problems in general position and beyond
Vladimir Shikhman, Sebastian Lämmel
We study cardinality-constrained optimization problems (CCOP) in general position, i. e. those optimization-related properties that are fulfilled for a dense and open subset of the…
Critical point theory for sparse recovery
Sebastian Lämmel, Vladimir Shikhman
We study the problem of sparse recovery in the context of compressed sensing. This is to minimize the sensing error of linear measurements by sparse vectors with at most non-ze…
On nondegenerate M-stationary points for sparsity constrained nonlinear optimization
Sebastian Lämmel, Vladimir Shikhman
We study sparsity constrained nonlinear optimization (SCNO) from a topological point of view. Special focus will be on M-stationary points from Burdakov et al. (2016). We introduce…
Shannon's comparison of channels characterized by optimal decision making
Sebastian Lämmel, Vladimir Shikhman
According to Blackwell's Theorem it is equivalent to compare channels by either a garbling order or optimal decision making. This equivalence does not hold anymore if also allowing…