Pages that link to "Item:Q3783055"

The following pages link to Relaxation Methods for Network Flow Problems with Convex Arc Costs (Q3783055):

Displaying 34 items.

• On the linear convergence of the alternating direction method of multipliers (Q517301) (← links)
• Relaxation methods for monotropic programs (Q909583) (← links)
• Matrix scaling, entropy minimization, and conjugate duality. II: The dual problem (Q910459) (← links)
• A survey of dynamic network flows (Q917417) (← links)
• Models for multimode multicommodity location problems with interdepot balancing requirements (Q920012) (← links)
• A combinatorial arc tolerance analysis for network flow problems (Q930771) (← links)
• Dual coordinate step methods for linear network flow problems (Q1115790) (← links)
• Decomposition algorithm for convex differentiable minimization (Q1176837) (← links)
• On the dual coordinate ascent approach for nonlinear networks (Q1207203) (← links)
• The auction algorithm: A distributed relaxation method for the assignment problem (Q1320412) (← links)
• Descent methods for convex essentially smooth minimization (Q1321119) (← links)
• On the convergence of the coordinate descent method for convex differentiable minimization (Q1321135) (← links)
• Asymptotic properties of the Fenchel dual functional and applications to decomposition problems (Q1321191) (← links)
• A unified description of iterative algorithms for traffic equilibria (Q1322143) (← links)
• Data parallel computing for network-structured optimization problems (Q1328430) (← links)
• Computational comparisons of dual conjugate gradient algorithms for strictly convex networks. (Q1406626) (← links)
• Asynchronous gradient algorithms for a class of convex separable network flow problems (Q1915768) (← links)
• Network games; adaptations to Nash-Cournot equilibrium (Q1918427) (← links)
• Solving multistage stochastic network programs on massively prallel computers (Q1918923) (← links)
• Application of the dual active set algorithm to quadratic network optimization (Q2366828) (← links)
• Proximal minimizations with \(D\)-functions and the massively parallel solution of linear network programs (Q2366829) (← links)
• A survey on the continuous nonlinear resource allocation problem (Q2456404) (← links)
• A bilinear relaxation based algorithm for concave piecewise linear network flow problems (Q2468881) (← links)
• Convergent Lagrangian heuristics for nonlinear minimum cost network flows (Q2480971) (← links)
• A modified self-adaptive dual ascent method with relaxed stepsize condition for linearly constrained quadratic convex optimization (Q2691343) (← links)
• Relaxation methods for problems with strictly convex separable costs and linear constraints (Q3777809) (← links)
• (Q3827812) (← links)
• A partial linearization method for the traffic assignment problem (Q3835623) (← links)
• An ε-Relaxation method for generalized separable convex cost network flow problems (Q4645915) (← links)
• About saddle values of a class of convex-concave functions (Q4764855) (← links)
• PARALLELIZATION STRATEGIES OF A ROW-ACTION METHOD FOR MULTICOMMODITY NETWORK FLOW PROBLEMS (Q4820107) (← links)
• (Q5020878) (← links)
• A proximal subgradient projection algorithm for linearly constrained strictly convex problems (Q5436924) (← links)
• Flots entiers et multiflots fractionnaires couplés par une contrainte de capacité (Q5479860) (← links)