Sciweavers

86 search results - page 2 / 18
» Non-convex quadratic minimization problems with quadratic co...
Sort
View
TSP
2010
13 years 3 days ago
A dual perspective on separable semidefinite programming with applications to optimal downlink beamforming
This paper considers the downlink beamforming optimization problem that minimizes the total transmission power subject to global shaping constraints and individual shaping constrai...
Yongwei Huang, Daniel Pérez Palomar
COCOS
2003
Springer
117views Optimization» more  COCOS 2003»
13 years 10 months ago
A Method for Global Optimization of Large Systems of Quadratic Constraints
In previous work, we have presented a novel global feasibility solver for the large system of quadratic constraints that arise as subproblems in the solving of hard hybrid problems...
Nitin Lamba, Mark Dietz, Daniel P. Johnson, Mark S...
CORR
2011
Springer
215views Education» more  CORR 2011»
12 years 9 months ago
Lasserre Hierarchy, Higher Eigenvalues, and Approximation Schemes for Quadratic Integer Programming with PSD Objectives
We present an approximation scheme for optimizing certain Quadratic Integer Programming problems with positive semidefinite objective functions and global linear constraints. Thi...
Venkatesan Guruswami, Ali Kemal Sinop
INFORMS
2010
147views more  INFORMS 2010»
13 years 2 months ago
Exact Algorithms for the Quadratic Linear Ordering Problem
The quadratic linear ordering problem naturally generalizes various optimization problems, such as bipartite crossing minimization or the betweenness problem, which includes linear...
Christoph Buchheim, Angelika Wiegele, Lanbo Zheng
ICAL
2011
301views more  ICAL 2011»
12 years 5 months ago
On the LVI-based numerical method (E47 algorithm) for solving quadratic programming problems
— In this paper, a numerical method (termed, E47 algorithm) based on linear variational inequalities (LVI) is presented and investigated to solve quadratic programming (QP) probl...
Yunong Zhang, Senbo Fu, Zhijun Zhang, Lin Xiao, Xu...