Sciweavers

422 search results - page 9 / 85
» On Non-Approximability for Quadratic Programs
Sort
View
MP
2006
137views more  MP 2006»
13 years 8 months ago
New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds
There are many applications related to singly linearly constrained quadratic programs subjected to upper and lower bounds. In this paper, a new algorithm based on secant approximat...
Yu-Hong Dai, Roger Fletcher
NN
2008
Springer
13 years 8 months ago
Two k-winners-take-all networks with discontinuous activation functions
This paper presents two k-winners-take-all (k-WTA) networks with discontinuous activation functions. The k-WTA operation is first converted equivalently into linear and quadratic ...
Qingshan Liu, Jun Wang
CDC
2010
IEEE
147views Control Systems» more  CDC 2010»
12 years 11 months ago
Partial pole placement with minimum norm controller
— The problem of placing an arbitrary subset (m) of the (n) closed loop eigenvalues of a nth order continuous time single input linear time invariant(LTI) system, using full stat...
Subashish Datta, Balarko Chaudhuri, Debraj Chakrab...
TSP
2010
13 years 2 months 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
OL
2007
156views more  OL 2007»
13 years 7 months ago
A trust region SQP algorithm for mixed-integer nonlinear programming
We propose a modified sequential quadratic programming (SQP) method for solving mixed-integer nonlinear programming problems. Under the assumption that integer variables have a s...
Oliver Exler, Klaus Schittkowski