[PDF] Top 20 Convex Programming Based Phase Retrieval: Theory and Applications

... STFT phase retrieval is equivalent to a series of non-overlapping phase retrieval ...of phase retrieval, most 1D signals are not uniquely ...relative phase, time-shift or ... See full document

... decades, applications that involve abstract algebra and discrete mathematics have become increasingly important, and many science, engineering, and computer science students are now electing to minor in ...Though ... See full document

... in applications to geometric measure theory an interesting field of study in mathematics and to the study of quadratic forms which occur in many applications such as ... See full document

... Wenhua, “A minimax theorem for the quasi-convex functional and the solution of the nonlinear beam equation,” Nonlinear Analysis: Theory, Methods & Applications , vol. Wenhua, “The ex[r] ... See full document

... KKM theory to prove that a family of sets has nonempty intersection is to find a suitable space and a mapping defined on that space such that this mapping is a KKM mapping and the original family of sets has ... See full document

... and convex nonlinearities,” Nonlinear Analysis: Theory, Methods & Applications, ...Analysis: Theory, Methods & Applications, ... See full document

... An integral version of (??) has been employed by S.S. Dragomir and C.J. Goh [?] to obtain different bounds for the entropy, conditional entropy and mutual in- formation of continuous random variable. Also, some ... See full document

... A theory of generalized gradients is presented when both spaces are locally convex and the range space is an order complete vector lattice.. Sample applications to the theory of nonsmoot[r] ... See full document

... (≥ 0) . In what follows we provide some lower bounds for a number of f -divergences that are used in various fields of Information Theory, Probability Theory and Statistics. The total variation distance is ... See full document

... Goh, A counterpart of Jensen’s discrete inequality for differentiable convex mappings and applications in information theory , Math.. Goh, Some bounds on entropy measures in information [r] ... See full document

... Tshinanga, “On multiple solutions of semilinear elliptic equation on unbounded domains with concave and convex nonlinearities,” Nonlinear Analysis: Theory, Methods & Applications , v[r] ... See full document

... for convex functions plays a crucial role in the Theory of Inequalities due to the fact that other inequalities such as the generalised triangle inequality, the arithmetic mean-geometric mean inequality, H¨ ... See full document

... Some inequalities of the Ostrowski type for functions whose mod- ulus of derivatives are convex and applications for special means and to the f and HH − divergences in Information Theory[r] ... See full document

... duality theory for nonlinear programming ...geometric programming based on his work on duality theory [81, ...Geometric Programming, in 1967 ...geometric programming. It ... See full document

... novel convex relaxation that is based on a lifted matrix recovery formulation that allows a non-trivial convex relaxation of the bilinear measurements from ...is based on Rademacher complexity ... See full document

... be convex functional defined on a convex subset C of a Hilbert space and let it be required to minimize on C subject to Let be a point where the minimum is ... See full document

... Stochastic Programming Problems with Mul- tiple Objective Functions,” In: ...Mathematical Programming under Uncertaintly, Klu- wer Academic Publisher, Dordrecht, ... See full document

... the phase space coordinates are properly scaled: the low-power (linear) coordinates u, v should be replaced with U = u /w ( ζ ), V = v w ( ζ ), where w is the half-width pulse waist and ζ is the (temporal and ... See full document

... Semidefinite Programming (SDP) Problem by using Recurrent Neural Networks ...control theory. First we reformulate the prob- lem to a linear programming problem, second we reformulate it to a first ... See full document

... The class of the matrix M has always played a prominent role in the LCP theory since much depends on knowing the matrix through which the particular LCP is defined. The key properties of feasibility, solvability, ... See full document