Pages that link to "Item:Q3977272"

The following pages link to Computational development of a lagrangian dual approach for quadratic networks (Q3977272):

Displaying 17 items.

• Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies (Q319183) (← links)
• On the linear convergence of the alternating direction method of multipliers (Q517301) (← links)
• Simple solution methods for separable mixed linear and quadratic knapsack problem (Q693416) (← links)
• A Newton's method for the continuous quadratic knapsack problem (Q892383) (← links)
• Variable fixing algorithms for the continuous quadratic Knapsack problem (Q927220) (← links)
• An algorithm for solving quadratic network flow problems (Q1175149) (← links)
• Computational comparisons of dual conjugate gradient algorithms for strictly convex networks. (Q1406626) (← links)
• Variable fixing method by weighted average for the continuous quadratic knapsack problem (Q2074624) (← links)
• A survey on the continuous nonlinear resource allocation problem (Q2456404) (← links)
• Breakpoint searching algorithms for the continuous quadratic knapsack problem (Q2465658) (← 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)
• Solving chance-constrained optimization problems with stochastic quadratic inequalities (Q2830767) (← links)
• Lagrangian dual coordinatewise maximization algorithm for network transportation problems with quadratic costs (Q3712122) (← links)
• An Efficient Hybrid Algorithm for the Separable Convex Quadratic Knapsack Problem (Q5270754) (← links)
• A proximal subgradient projection algorithm for linearly constrained strictly convex problems (Q5436924) (← links)
• Effective algorithms for separable nonconvex quadratic programming with one quadratic and box constraints (Q6166654) (← links)