نتایج جستجو برای: convex feasibility problem

تعداد نتایج: 1015611  

Journal: :Discrete Applied Mathematics 2008

2015
Guido Dartmann Gerd Ascheid

Multicast downlink transmission in a multi-cell network with multiple users is investigated. Max–min beamforming (MB) enables a fair distribution of the signal-to-interferenceplus-noise-ratio among all users in a network for given power constraints at the base stations of the network. The multicast MB problem (MBP) is proved to be NP-hard and non-convex in general. However, the MBP has an equiv...

2001
Yuri I. Abramovich Nicholas K. Spencer

ABSTRACT We derive an algorithm to compute a maximum-likelihood (ML) estimate of a Toeplitz covariance matrix whose rank is known a priori that is “locally optimal”, by maximising the likelihood ratio in the neighborhood of . This problem arises, for example, in the detection and/or direction-of-arrival (DOA) estimation of uncorrelated plane-wave sources using a nonuniform (sparse) sensor linea...

Journal: :iranian journal of mathematical sciences and informatics 0
m. r. peyghami faculty of matematics s. fathi hafshejani faculty of matematics

in this paper, we consider convex quadratic semidefinite optimization problems and provide a primal-dual interior point method (ipm) based on a new kernel function with a trigonometric barrier term. iteration complexity of the algorithm is analyzed using some easy to check and mild conditions. although our proposed kernel function is neither a self-regular (sr) function nor logarithmic barrier ...

2016
Hideaki Iiduka

This paper considers the fixed point problem for a nonexpansive mapping on a real Hilbert space and proposes novel line search fixed point algorithms to accelerate the search. The termination conditions for the line search are based on the well-known Wolfe conditions that are used to ensure the convergence and stability of unconstrained optimization algorithms. The directions to search for fixe...

Journal: :Journal of Nonlinear Sciences and Applications 2016

Journal: :SIAM J. Control and Optimization 2000
Patrick L. Combettes

The strong convergence of a broad class of outer approximation methods for minimizing a convex function over the intersection of an arbitrary number of convex sets in a reflexive Banach space is studied in a unified framework. The generic outer approximation algorithm under investigation proceeds by successive minimizations over the intersection of convex supersets of the feasibility set determ...

2004
Bruno Codenotti Kasturi Varadarajan

We consider the problem of computing equilibrium prices for exchange economies. We tackle this problem under the assumption that the traders have either CES (constant elasticity of substitution) utility functions or a subfamily of ASC (additively separable concave) utilities. For the subfamily of ASC functions, and for a range of CES functions which include some CES functions that do not satisf...

2003
Li Yu Qing-Long Han Shiming Yu Jinfeng Gao

This paper is concerned with the robust absolute stability analysis problem for a class of uncertain time-delay systems with nonlinearities satisfying a given sector condition. Based on the Lyapunov stability theory and the linear matrix inequality (LMI) approach, a delay-dependent sufficient condition for the robust absolute stability is derived and is expressed as the feasibility problem of a...

Journal: :Logical Methods in Computer Science 2011
Manuel Bodirsky Peter Jonsson Timo von Oertzen

Let Γ be a structure with a finite relational signature and a first-order definition in (R; ∗,+) with parameters from R, that is, a relational structure over the real numbers where all relations are semi-algebraic sets. In this article, we study the computational complexity of constraint satisfaction problem (CSP) for Γ: the problem to decide whether a given primitive positive sentence is true ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید