Sciweavers

240 search results - page 17 / 48
» Nonconvex Robust Optimization for Problems with Constraints
Sort
View
WCNC
2010
IEEE
13 years 5 months ago
On MIMO Cognitive Radios with Antenna Selection
—With the ever increasing interest in multiple-input multiple-output (MIMO) cognitive radio (CR) systems, reducing the costs associated with RF-chains at the radio front end beco...
Muhammad Fainan Hanif, Peter J. Smith
SIAMJO
2010
87views more  SIAMJO 2010»
13 years 5 months ago
A Second Derivative SQP Method: Global Convergence
Abstract. Sequential quadratic programming (SQP) methods form a class of highly efficient algorithms for solving nonlinearly constrained optimization problems. Although second deri...
Nicholas I. M. Gould, Daniel P. Robinson
COCOS
2003
Springer
148views Optimization» more  COCOS 2003»
14 years 21 days ago
Convex Programming Methods for Global Optimization
We investigate some approaches to solving nonconvex global optimization problems by convex nonlinear programming methods. We assume that the problem becomes convex when selected va...
John N. Hooker
WIOPT
2010
IEEE
13 years 5 months ago
Optimizing power allocation in interference channels using D.C. programming
Abstract--Power allocation is a promising approach for optimizing the performance of mobile radio systems in interference channels. In the present paper, the non-convex objective f...
Hussein Al-Shatri, Tobias Weber
TSP
2010
13 years 2 months ago
Cooperative resource allocation games under spectral mask and total power constraints
Resource allocation problems in multi-user systems, modeled as Nash bargaining (NB) cooperative games, are investigated under different constraints. Using the joint time division m...
Jie Gao, Sergiy A. Vorobyov, Hai Jiang