The following pages link to (Q4241608):
Displaying 8 items.
- Approximate level method for nonsmooth convex minimization (Q415377) (← links)
- An approach for solving nonlinear multi-objective separable discrete optimization problem with one constraint (Q706934) (← links)
- Approximation to nonproper problems of convex programming (Q799481) (← links)
- Solving highly nonlinear convex separable programs using successive approximation (Q1089265) (← links)
- On nonconvex optimization problems with separated nonconvex variables (Q1187838) (← links)
- A global optimization method for nonconvex separable programming problems (Q1847169) (← links)
- Approximate separable multichoice optimization over monotone systems (Q2673246) (← links)
- Equivalence of \(\varepsilon\)-approximate separation and optimization in fixed dimensions. (Q5943664) (← links)