Pages that link to "Item:Q811411"

The following pages link to Concave minimization via conical partitions and polyhedral outer approximation (Q811411):

Displaying 25 items.

• Reverse convex programming approach in the space of extreme criteria for optimization over efficient sets (Q613601) (← links)
• 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)
• An analytical approach to global optimization (Q1181733) (← 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)
• Calculation of bounds on variables satisfying nonlinear inequality constraints (Q1207040) (← links)
• Conical algorithm for the global minimization of linearly constrained decomposable concave minimization problems (Q1321233) (← links)
• A finite concave minimization algorithm using branch and bound and neighbor generation (Q1330802) (← links)
• A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron (Q1332814) (← links)
• Constraint decomposition algorithms in global optimization (Q1342897) (← links)
• On the construction of test problems for concave minimization algorithms (Q1342905) (← links)
• Set variational inequalities (Q1366827) (← links)
• Difference of convex solution of quadratically constrained optimization problems. (Q1810525) (← links)
• Maximizing a concave function over the efficient or weakly-efficient set (Q1847166) (← links)
• A method for solving d.c. programming problems. Application to fuel mixture nonconvex optimization problem (Q1890947) (← links)
• Capacity planning in networks of queues with manufacturing applications (Q1900269) (← links)
• Decomposition approach for the global minimization of biconcave functions over polytopes (Q1918288) (← links)
• DC programming: overview. (Q1969457) (← links)
• A note on adapting methods for continuous global optimization to the discrete case (Q2276877) (← links)
• Separable concave minimization via partial outer approximation and branch and bound (Q2277369) (← links)
• Variations and extension of the convex-concave procedure (Q2358020) (← links)
• On solving general reverse convex programming problems by a sequence of linear programs and line searches (Q2638938) (← links)
• An algorithm for concave integer minimization over a polyhedron (Q3200886) (← links)