Phase retrieval seeks to recover a signal x ∈ C^ px∈ C p from the amplitude| A x|| A x| of
linear measurements Ax ∈ C^ n A x∈ C n. We cast the phase retrieval problem as a non …

We implement several warm-start strategies in interior-point methods for linear programming
(LP). We study the situation in which both the original LP instance and the perturbed one …

We study convex conic optimization problems in which the right-hand side and the cost
vectors vary linearly as functions of a scalar parameter. We present a unifying geometric …

We discuss the problem that consists in reconstructing a function from the modulus of its
wavelet transform. In the case where the wavelets are Cauchy wavelets, all analytic …

An appealing feature of interior methods for linear programming is that the number of
iterations required to solve a problem tends to be relatively insensitive to the choice of initial …

It was recently shown by [Halická et al. 2002). On the convergence of the central path in
semidefinite optimization. SIAM J. Optimization, 12 (4), 1090–1099] that, unlike in linear …

In this paper we consider the linear symmetric cone programming (SCP). At a Karush-Kuhn-
Tucker (KKT) point of SCP, we present the important conditions equivalent to the …

Nondegeneracy assumptions are often needed in order to prove the local fast convergence
of suitable algorithms as well as in the sensitivity analysis for semidefinite programs. One of …

This paper gives an overview of verification methods for finite dimensional conic linear
programming problems. Besides the computation of verified tight enclosures for unique non …

This online technical report presents abstracts (short outlines) of papers related to
semidefinite programming. The papers are grouped by subject. This is not an exhaustive list …