Pages that link to "Item:Q3730353"
From MaRDI portal
The following pages link to Successive approximation in separable programming: An improved procedure for convex separable programs (Q3730353):
Displaying 11 items.
- A MILP formulation for generalized geometric programming using piecewise-linear approximations (Q319582) (← links)
- An effective linear approximation method for separable programming problems (Q1036545) (← links)
- Solving highly nonlinear convex separable programs using successive approximation (Q1089265) (← links)
- Successive approximation technique for a class of large-scale NLP problems and its application to dynamic programming (Q1109685) (← links)
- Error analysis for convex separable programs: Bounds on optimal and dual optimal solutions (Q1153654) (← links)
- A branch-and-bound approach for spare unit allocation in a series system (Q1333525) (← links)
- Optimal objective function approximation for separable convex quadratic programming (Q1340073) (← links)
- On the constructive solution of convex programming problems in separable form (Q1776278) (← links)
- A global optimization method for nonconvex separable programming problems (Q1847169) (← links)
- Refined proximity and sensitivity results in linearly constrained convex separable integer programming (Q1899421) (← links)
- Sandwich approximation of univariate convex functions with an application to separable convex programming (Q3987782) (← links)
