Browsing 1 - Oberwolfach Preprints (OWP) by MSC "90"
Now showing items 1-5 of 5
-
Infeasibility certificates for linear matrix inequalities
[OWP-2011-28] (Mathematisches Forschungsinstitut Oberwolfach, 2011-05-25)Farkas' lemma is a fundamental result from linear programming providing linear certi cates for infeasibility of systems of linear inequalities. In semidefinite programming, such linear certificates only exist for strongly ... -
On Dykstra’s Algorithm with Bregman Projections
[OWP-2024-04] (Mathematisches Forschungsinstitut Oberwolfach, 2024-04-16)We provide quantitative results on the asymptotic behavior of Dykstra’s algorithm with Bregman projections, a combination of the well-known Dykstra’s algorithm and the method of cyclic Bregman projections, designed to find ... -
Proof Mining and the Convex Feasibility Problem : the Curious Case of Dykstra's Algorithm
[OWP-2024-06] (Mathematisches Forschungsinstitut Oberwolfach, 2024-07-15)In a recent proof mining application, the proof-theoretical analysis of Dykstra's cyclic projections algorithm resulted in quantitative information expressed via primitive recursive functionals in the sense of Gödel. This ... -
A real algebra perspective on multivariate tight wavelet frames
[OWP-2012-11] (Mathematisches Forschungsinstitut Oberwolfach, 2012-08-13)Recent results from real algebraic geometry and the theory of polynomial optimization are related in a new framework to the existence question of multivariate tight wavelet frames whose generators have at least one vanishing ... -
Weak-duality based adaptive finite element methods for PDE-constrained optimization with pointwise gradient state-constraints
[OWP-2010-15] (Mathematisches Forschungsinstitut Oberwolfach, 2010)Adaptive finite element methods for optimization problems for second order linear elliptic partial di erential equations subject to pointwise constraints on the $\ell^2$-norm of the gradient of the state are considered. ...