相关论文: Minimization of convex functionals over frame oper…

We give an iteration scheme for finding zeros of maximal monotone operators in Hilbert spaces. We assume that the operator is defined in the whole space. The iterates converge strongly to a solution if there exists any, otherwise they tend…

We prove the existence of minimizers for functionals defined over the class of convex domains contained inside a bounded set D of R^N and with prescribed volume. Some applications are given, in particular we prove that the eigenvalues of…

In this paper, a new optimization framework is defined that includes the optimization framework recently proposed in [1]-[2] as a special case. The convex optimization in [1]-[2] includes centralized optimization and distributed…

We consider the problem of maximizing a convex function over a closed convex set in a real Hilbert space. For linear functions, we show that a single orthogonal projection suffices to obtain an approximate solution. For continuous convex…

Given a finite sequence of vectors $\mathcal F_0$ in $\C^d$ we characterize in a complete and explicit way the optimal completions of $\mathcal F_0$ obtained by adding a finite sequence of vectors with prescribed norms, where optimality is…

In this article we consider means of positive bounded linear operators on a Hilbert space. We present a complete theory that provides a framework which extends the theory of the Karcher mean, its approximating matrix power means, and a…

This paper is devoted to general nonconvex problems of multiobjective optimization in Hilbert spaces. Based on Mordukhovich's limiting subgradients, we define a new notion of Pareto critical points for such problems, establish necessary…

We consider minimization of functions that are compositions of convex or prox-regular functions (possibly extended-valued) with smooth vector functions. A wide variety of important optimization problems fall into this framework. We describe…

A Parseval frame is a spanning set for a Hilbert space which satisfies the Parseval identity: a vector can be expressed as a linear combination of the frame whose coefficients are inner products with the frame vectors. There is considerable…

We apply Lax-Milgram theorem to characterize scalable and piecewise scalable frame in finite and infinite-dimensional Hilbert spaces. We also introduce a method for approximating the inverse frame operator using finite-dimensional linear…

Scalarization in vector optimization is essentially based on the minimization of Gerstewitz functionals. In this paper, the minimizer sets of Gerstewitz functionals are investigated. Conditions are given under which such a set is nonempty…

Convergence of a projected stochastic gradient algorithm is demonstrated for convex objective functionals with convex constraint sets in Hilbert spaces. In the convex case, the sequence of iterates ${u_n}$ converges weakly to a point in the…

A finite-dimensional Hilbert space is usually described in terms of an orthonormal basis, but in certain approaches or applications a description in terms of a finite overcomplete system of vectors, called a finite tight frame, may offer…

We present several matrix and operator inequalities of Hermite-Hadamard type. We first establish a majorization version for monotone convex functions on matrices. We then utilize the Mond-Pecaric method to get an operator version for convex…

Finding the minimum and the minimizers of convex functions has been of primary concern in convex analysis since its conception. It is well-known that if a convex function has a minimum, then that minimum is global. The minimizers, however,…

To every nearly convex optimization problem, that is a minimization problem with a nearly convex objective function and a nearly convex constraint set, we associate a uniquely defined convex optimization problem with a lower semicontinuous…

This paper is focused on some properties of paramonotone operators on Banach spaces and their application to certain feasibility problems for convex sets in a Hilbert space and convex systems in the Euclidean space. In particular, it shows…

In this paper, we state some characterizations of $h$-convex function is defined on a convex set in a linear space. By doing so, we extend the Jensen-Mercer inequality for $h$-convex function. We will also define $h$-convex function for…

Given a frame in a finite dimensional Hilbert space we construct additive perturbations which decrease the condition number of the frame. By iterating this perturbation, we introduce an algorithm that produces a tight frame in a finite…

Let T be a bounded operator on a Hilbert space H, and F = {f_j: j in J} an at most countable set of vectors in H. In this note, we characterize the pairs {T, F} such that {T^n f: f in F, n in I} form a frame of H, for the cases of I = N_0…