Pages that link to "Item:Q3934118"

The following pages link to A scaled reduced gradient algorithm for network flow problems with convex separable costs (Q3934118):

Displayed 18 items.

• On large scale nonlinear network optimization (Q908858) ‎ (← links)
• Performance evaluation of independent superbasic sets on nonlinear replicated networks (Q1068689) ‎ (← links)
• Dual gradient method for linearly constrained, strongly convex, separable mathematical programming problems (Q1078076) ‎ (← links)
• An algorithm for solving quadratic network flow problems (Q1175149) ‎ (← links)
• Decomposition algorithm for convex differentiable minimization (Q1176837) ‎ (← links)
• On the equivalence of constrained and unconstrained flows (Q1339398) ‎ (← links)
• A smooth penalty function algorithm for network-structured problems (Q1388940) ‎ (← links)
• Computational comparisons of dual conjugate gradient algorithms for strictly convex networks. (Q1406626) ‎ (← links)
• The convergence of equilibrium algorithms with non-monotone line search technique. (Q1415258) ‎ (← links)
• Application of the dual active set algorithm to quadratic network optimization (Q2366828) ‎ (← links)
• Truncated-Newton algorithms for large-scale unconstrained optimization (Q3037163) ‎ (← links)
• On optimizing a maximin nonlinear function subject to replicated quasi- arborescence-like constraints (Q3361814) ‎ (← links)
• A Newton method for convex separable network flow problems (Q3668258) ‎ (← links)
• Dealing with degeneracy in reduced gradient algorithms (Q3691433) ‎ (← links)
• A hybrid algorithm for solving convex separable network flow problems (Q3706799) ‎ (← links)
• Implementing an “exact” Newton method for separable convex transportation problems (Q3827809) ‎ (← links)
• Sandwich approximation of univariate convex functions with an application to separable convex programming (Q3987782) ‎ (← links)
• Ripples, complements, and substitutes in singly constrained monotropic parametric network flow problems (Q4305123) ‎ (← links)