1182 search results - page 49 / 237 » Iterative Methods in Combinatorial Optimization |
248
click to vote
SIAMIS
2011
14 years 12 months ago
2011
The convergence rate is analyzed for the sparse reconstruction by separable approximation (SpaRSA) algorithm for minimizing a sum f(x) + ψ(x), where f is smooth and ψ is convex, ...
141
Voted
SIAMSC
2010
14 years 11 months ago
2010
We present a line-search algorithm for large-scale continuous optimization. The algorithm is matrix-free in that it does not require the factorization of derivative matrices. Inste...
135
Voted
GECCO
2006
Springer
15 years 8 months ago
2006
Springer
This paper presents an automatic design method for piping arrangement. A pipe arrangement design problem is proposed for a space in which many pipes and objects co-exist. This pro...
157
click to vote
GECCO
2005
Springer
15 years 10 months ago
2005
Springer
Designing efficient sorting networks has been a challenging combinatorial optimization problem since the early 1960’s. The application of evolutionary computing to this problem ...
157
click to vote
CP
2003
Springer
15 years 10 months ago
2003
Springer
This paper aims to show that Constraint Programming can be an efficient technique to solve a well-known combinatorial optimization problem: the search for a maximum clique in a gra...