Pages that link to "Item:Q757243"
From MaRDI portal
The following pages link to A branch and bound-outer approximation algorithm for concave minimization over a convex set (Q757243):
Displaying 13 items.
- On a finite branch and bound algorithm for the global minimization of a concave power law over a polytope (Q650234) (← links)
- An all-linear programming relaxation algorithm for optimizing over the efficient set (Q1177916) (← links)
- On solving a d.c. programming problem by a sequence of linear programs (Q1186273) (← links)
- A new simplicial cover technique in constrained global optimization (Q1187367) (← links)
- On nonconvex optimization problems with separated nonconvex variables (Q1187838) (← links)
- A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron (Q1332814) (← links)
- Capacity planning in networks of queues with manufacturing applications (Q1900269) (← links)
- A norm minimization-based convex vector optimization algorithm (Q2156397) (← links)
- On solving general reverse convex programming problems by a sequence of linear programs and line searches (Q2638938) (← links)
- Computational Methods for Solving Nonconvex Block-Separable Constrained Quadratic Problems (Q2810546) (← links)
- Deterministic methods in constrained global optimization: Some recent advances and new fields of application (Q3494393) (← links)
- On the Linear Convergence of Descent Methods for Convex Essentially Smooth Minimization (Q3988952) (← links)
- On geometry and convergence of a class of simplicial covers (Q4327931) (← links)
