1182 search results - page 39 / 237 » Iterative Methods in Combinatorial Optimization |
121
click to vote
CDC
2008
IEEE
15 years 8 months ago
2008
IEEE
— In this paper we develop a new dual decomposition method for optimizing a sum of convex objective functions corresponding to multiple agents but with coupled constraints. In ou...
135
Voted
SODA
2010
ACM
15 years 11 months ago
2010
ACM
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
123
Voted
JMLR
2010
14 years 8 months ago
2010
We consider regularized stochastic learning and online optimization problems, where the objective function is the sum of two convex terms: one is the loss function of the learning...
89
Voted
ICML
2003
IEEE
16 years 2 months ago
2003
IEEE
We study a class of overrelaxed bound optimization algorithms, and their relationship to standard bound optimizers, such as ExpectationMaximization, Iterative Scaling, CCCP and No...
MP
2010
15 years 9 days ago
2010
Abstract We present a matrix-free line search algorithm for large-scale equality constrained optimization that allows for inexact step computations. For sufficiently convex problem...