Sciweavers

844 search results - page 83 / 169
» Solving the p
Sort
View
171
Voted
SIAMSC
2008
147views more  SIAMSC 2008»
15 years 5 months ago
Global and Finite Termination of a Two-Phase Augmented Lagrangian Filter Method for General Quadratic Programs
We present a two-phase algorithm for solving large-scale quadratic programs (QPs). In the first phase, gradient-projection iterations approximately minimize an augmented Lagrangian...
Michael P. Friedlander, Sven Leyffer
154
Voted
TSP
2008
124views more  TSP 2008»
15 years 5 months ago
Robust Beamforming via Worst-Case SINR Maximization
Minimum variance beamforming, which uses a weight vector that maximizes the signal-to-interference-plus-noise ratio (SINR), is often sensitive to estimation error and uncertainty i...
Seung-Jean Kim, Alessandro Magnani, Almir Mutapcic...
ANOR
2004
116views more  ANOR 2004»
15 years 5 months ago
Approximations and Randomization to Boost CSP Techniques
Abstract. In recent years we have seen an increasing interest in combining constraint satisfaction problem (CSP) formulations and linear programming (LP) based techniques for solvi...
Carla P. Gomes, David B. Shmoys
HEURISTICS
1998
252views more  HEURISTICS 1998»
15 years 5 months ago
Constraint Handling in Genetic Algorithms: The Set Partitioning Problem
In this paper we present a genetic algorithm-based heuristic for solving the set partitioning problem (SPP). The SPP is an important combinatorial optimisation problem used by man...
P. C. Chu, J. E. Beasley
ML
2002
ACM
127views Machine Learning» more  ML 2002»
15 years 5 months ago
Sparse Regression Ensembles in Infinite and Finite Hypothesis Spaces
We examine methods for constructing regression ensembles based on a linear program (LP). The ensemble regression function consists of linear combinations of base hypotheses generat...
Gunnar Rätsch, Ayhan Demiriz, Kristin P. Benn...