5331 search results - page 176 / 1067 » Algebraic Methods for Optimization Problems |
CDC
2008
IEEE
15 years 4 months ago
2008
IEEE
Abstract— We consider a convex unconstrained optimization problem that arises in a network of agents whose goal is to cooperatively optimize the sum of the individual agent objec...
SIAMSC
2008
14 years 10 months ago
2008
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...
108
click to vote
SIAMIS
2010
14 years 5 months ago
2010
This paper analyzes and improves the linearized Bregman method for solving the basis pursuit and related sparse optimization problems. The analysis shows that the linearized Bregma...
GECCO
2007
Springer
15 years 2 months ago
2007
Springer
In this research, we compare four different evaluation methods in coevolution on the Majority Function problem. The size of the problem is selected such that an evaluation against...
88
Voted
IJON
2011
14 years 1 months ago
2011
, Yunde Jia Model structure selection is currently an open problem in modeling data via Gaussian Mixture Models (GMM). This paper proposes a discriminative method to select GMM st...