Sciweavers

422 search results - page 10 / 85
» On Non-Approximability for Quadratic Programs
Sort
View
JGO
2011
149views more  JGO 2011»
13 years 2 months ago
A logarithmic-quadratic proximal point scalarization method for multiobjective programming
We present a proximal point method to solve multiobjective problems based on the scalarization for maps. We build a family of a convex scalar strict representation of a convex map...
Ronaldo Gregório, Paulo Roberto Oliveira
ICASSP
2011
IEEE
12 years 11 months ago
Optimum multi-user detection by nonsmooth optimization
—The optimum multiuser detection (OMD) is a discrete (binary) optimization. The previously developed approaches often relax it by a semi-definite program (SDP) and then employ r...
Hoang Duong Tuan, Tran Thai Son, Hoang Tuy, Ha H. ...
MP
2010
128views more  MP 2010»
13 years 6 months ago
Perspective reformulations of mixed integer nonlinear programs with indicator variables
Abstract. We study mixed integer nonlinear programs (MINLP)s that are driven by a collection of indicator variables where each indicator variable controls a subset of the decision ...
Oktay Günlük, Jeff Linderoth
SIAMSC
2010
116views more  SIAMSC 2010»
13 years 6 months ago
Recursively Accelerated Multilevel Aggregation for Markov Chains
A recursive acceleration method is proposed for multiplicative multilevel aggregation algorithms that calculate the stationary probability vector of large, sparse, and irreducible ...
Hans De Sterck, K. Miller, G. Sanders, M. Winlaw
SIAMJO
2000
113views more  SIAMJO 2000»
13 years 7 months ago
Cones of Matrices and Successive Convex Relaxations of Nonconvex Sets
Let F be a compact subset of the n-dimensional Euclidean space Rn represented by (finitely or infinitely many) quadratic inequalities. We propose two methods, one based on successi...
Masakazu Kojima, Levent Tunçel