Pages that link to "Item:Q3896852"
From MaRDI portal
The following pages link to Secant approximation methods for convex optimization (Q3896852):
Displaying 6 items.
- Benefit sharing in holding situations (Q707151) (← links)
- A variable-penalty alternating directions method for convex optimization (Q1290650) (← links)
- Optimal objective function approximation for separable convex quadratic programming (Q1340073) (← links)
- Computational aspects of two-segment separable programming (Q3664835) (← links)
- A hybrid algorithm for solving convex separable network flow problems (Q3706799) (← links)
- Sandwich approximation of univariate convex functions with an application to separable convex programming (Q3987782) (← links)
