Pages that link to "Item:Q1186290"
From MaRDI portal
The following pages link to Dual algorithms for solving convex partially separable optimization problems (Q1186290):
Displaying 13 items.
- A decomposition-dualization approach for solving constrained convex minimization problems with applications to discretized obstacle problems (Q1113621) (← links)
- Two algorithms for maximizing a separable concave function over a polymatroid feasible region (Q1179000) (← links)
- Unconstrained duals to partially separable constrained programs (Q1196186) (← links)
- Powell-Sabin splines in range restricted interpolation of scattered data (Q1337636) (← links)
- New dual-type decomposition algorithm for non-convex separable optimization problems (Q1826106) (← links)
- Positive quartic, monotone quintic \(C^ 2\)-spline interpolation in one and two dimensions (Q1891036) (← links)
- Dualize, split, randomize: toward fast nonsmooth optimization algorithms (Q2082232) (← links)
- Regularity and well-posedness of a dual program for convex best \(C^{1}\)-spline interpolation (Q2385542) (← links)
- A survey on dual decomposition methods (Q2392956) (← links)
- Dual multilevel optimization (Q2465655) (← links)
- (Q3783081) (← links)
- (Q4209091) (← links)
- Explicit model of dual programming and solving method for a class of separable convex programming problems (Q5059225) (← links)
