Pages that link to "Item:Q3216399"
From MaRDI portal
The following pages link to Multipoint methods for separable nonlinear networks (Q3216399):
Displaying 16 items.
- An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds (Q922953) (← links)
- Decomposition algorithm model for singly linearly-constrained problems subject to lower and Upper bounds (Q1029281) (← links)
- Performance evaluation of independent superbasic sets on nonlinear replicated networks (Q1068689) (← links)
- A variable-penalty alternating directions method for convex optimization (Q1290650) (← links)
- Computational comparisons of dual conjugate gradient algorithms for strictly convex networks. (Q1406626) (← links)
- Parallel decomposition methods for linearly constrained problems subject to simple bound with application to the SVMs training (Q1790674) (← links)
- Application of the dual active set algorithm to quadratic network optimization (Q2366828) (← links)
- A survey on the continuous nonlinear resource allocation problem (Q2456404) (← links)
- New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds (Q2492668) (← links)
- Implementing an “exact” Newton method for separable convex transportation problems (Q3827809) (← links)
- Computational development of a lagrangian dual approach for quadratic networks (Q3977272) (← links)
- Sandwich approximation of univariate convex functions with an application to separable convex programming (Q3987782) (← links)
- A Two-Phase Gradient Method for Quadratic Programming Problems with a Single Linear Constraint and Bounds on the Variables (Q4687242) (← links)
- Restricted Simplicial Decomposition for Symmetric Convex Cost Flow Problems (Q4695015) (← links)
- An efficient global algorithm for indefinite separable quadratic knapsack problems with box constraints (Q6166655) (← links)
- Mean‐standard deviation model for minimum cost flow problem (Q6179689) (← links)
