Pages that link to "Item:Q1340073"
From MaRDI portal
The following pages link to Optimal objective function approximation for separable convex quadratic programming (Q1340073):
Displaying 8 items.
- A MILP formulation for generalized geometric programming using piecewise-linear approximations (Q319582) (← links)
- Positive definite separable quadratic programs for non-convex problems (Q381897) (← links)
- Identifying the optimal partition in convex quadratic programming (Q924889) (← links)
- An effective linear approximation method for separable programming problems (Q1036545) (← links)
- Global optimization of separable objective functions on convex polyhedra via piecewise-linear approximation (Q2432723) (← links)
- A polynomial-time descent method for separable convex optimization problems with linear constraints (Q2802141) (← links)
- Piecewise-Linear Approximation Methods for Nonseparable Convex Optimization (Q3793946) (← links)
- Quadratic Combinatorial Optimization Using Separable Underestimators (Q5136070) (← links)