convex optimization problem
Global passivity enforcement via convex optimization
... enforcement problem is formulated as a convex optimization problem and efficiently solved based on recently developed interior-point ...The convex optimization is a special class ...
13
Optimal Power Allocation with Channel Inversion Regularization-Based Precoding for MIMO Broadcast Channels
... the problem of CIR scheme becomes a nonlinear nonconvex optimization ...nonconvex optimization problem, we can resort to the global difference of convex ...(d.c.) optimization ...
8
A Different Approach to Cone Convex Optimization
... As a breakthrough to this, Lassere [1] showed that as far as KKT optimality conditions are concerned, the convexity (or any of its generalization) of the constraint functions can be replaced by the convexity of the ...
6
A Direct Method for Building Sparse Kernel Learning Algorithms
... a convex optimization ...original convex optimization problem, such that the sparseness of the resulting ker- nel machine is explicitly controlled while at the same time performance is ...
22
Wireless network positioning as a convex feasibility problem
... positioning problem for both non-coopera- tive and cooperative ...ing problem for positive measurement errors and pro- pose a new OA method for cooperative networks ...feasibility problem that we ...
15
Off -Grid Direction-of-Arrival Estimation Using a Sparse Array Covariance Matrix
... a convex optimization problem and a least-squares (LS) problem is presented to solve for the two sparse vectors in the modified sparse array covariance matrix and the off-grid DOA estimation is ...
6
An Efficient Random Algorithm for Box Constrained Weighted Maximin Dispersion Problem
... dispersion problem as a Qua- dratically constrained quadratic programming (QCQP), noting that (1) is a non-smooth, non-convex optimization problem, because the point-wise mini- mum of ...
7
On ε-optimality conditions for multiobjective fractional optimization problems
... fractional optimization problem (MFP), which consists of more than two fractional objective functions with convex numerator functions and convex denominator functions, finitely many ...
13
Adaptation Based on Generalized Discrepancy
... We present a new algorithm for domain adaptation improving upon a discrepancy minimization algorithm, (DM), previously shown to outperform a number of algorithms for this problem. Unlike many previously proposed ...
30
Filter Design Problems with Convex Optimization
... of convex optimization has been studied for about one ...of convex optimization have been discovered in various fields of applied science and engineering, such as automatic control system, ...
6
Duality Theorems for Convex Semidefinite Optimization Problems with Conic Constraints
... for convex optimization problems, which hold without any constraint ...of convex optimization problem which satisfies -optimality ...for convex semidefinite optimization ...
13
Multi-Stage Multi-Task Feature Learning
... non-convex optimization problem, we propose a Multi-Stage Multi-Task Feature Learning (MSMTFL) algorithm; we also provide intuitive interpretations, detailed con- vergence and reproducibility ...
32
Fekete Szegö Problem for a New Class of Analytic Functions
... which are analytic in the open unit disk U {z : z ∈ C and |z| < 1} and S denote the subclass of A that are univalent in U. A function fz in A is said to be in class S ∗ of starlike functions of order zero in U, if Rzf ...
6
Convex optimization using quantum oracles
... continuous optimization paradigms is convex optimization, which optimizes a convex function over a convex set that is given explicitly (by a set of constraints) or implicitly (by an ...
29
Sparse Recovery via Convex Optimization
... Thus, in this chapter we will not assume signals can be well represented in a basis, but instead will focus on overcomplete signal representations, known as dictionaries. A dictionary is a collection of elements, also ...
158
Extragradient method for convex minimization problem
... point problem of a strictly pseudocontractive ...inequality problem (over the fixed point set of a strictly pseudocontractive map- ping) with constraints of finitely many GMEPs, finitely many variational ...
40
Convergence analysis of the iterative methods for quasi complementarity problems
... It is obvious dat lemma 3.1 implies that if the convex set involved in both tJe quasi variational inequality and the quasi complementarity problem is a convex cone, then both the problem[r] ...
16
Simultaneous Plant and Controller Optimization Based on Non-smooth Techniques
... design optimization of a plant and its ...non-smooth optimization prob- lems under nonlinear and linear ...the convex cutting plane mechanism is ...a problem of steady flow in a graph and in ...
7
Iterative Algorithm for Approximating Solutions of Maximal Monotone Operators in Hilbert Spaces
... the convex minimization problem of finding a minimizer of a proper lower-semicontinuous convex function and the variational problem of finding a solution of a variational in- ...
8
An intermixed iteration for constrained convex minimization problem and split feasibility problem
... We denote the set of solutions of the variational inequality by VI(C, A). Many models of variational inequalities are used in practice, including a mathematical theory, some inter- esting connections to numerous ...
22