1182 search results - page 28 / 237 » Iterative Methods in Combinatorial Optimization |
141
click to vote
GECCO
2005
Springer
15 years 7 months ago
2005
Springer
Many non-cooperative settings that could potentially be studied using game theory are characterized by having very large strategy spaces and payoffs that are costly to compute. Be...
125
click to vote
SIAMJO
2008
15 years 1 months ago
2008
We present an algorithm for large-scale equality constrained optimization. The method is based on a characterization of inexact sequential quadratic programming (SQP) steps that ca...
150
Voted
MP
2011
14 years 8 months ago
2011
Abstract: We propose a first-order interior-point method for linearly constrained smooth optimization that unifies and extends first-order affine-scaling method and replicator d...
123
click to vote
EOR
2010
15 years 1 months ago
2010
We propose a modified alternate direction method for solving convex quadratically constrained quadratic semidefinite optimization problems. The method is a first-order method, the...
122
click to vote
QSIC
2003
IEEE
15 years 7 months ago
2003
IEEE
In this paper, we consider a problem that arises in black box testing: generating small test suites (i.e., sets of test cases) where the combinations that have to be covered are s...