Pages that link to "Item:Q1057182"

The following pages link to An outer approximation method for globally minimizing a concave function over a compact convex set (Q1057182):

Displaying 31 items.

• On a finite branch and bound algorithm for the global minimization of a concave power law over a polytope (Q650234) (← links)
• An outer approximation method for minimizing the product of several convex functions on a convex set (Q686993) (← links)
• A branch and bound-outer approximation algorithm for concave minimization over a convex set (Q757243) (← links)
• Concave minimization via conical partitions and polyhedral outer approximation (Q811411) (← links)
• Outer approximation method incorporating a quadratic approximation for a DC programming problem (Q848730) (← links)
• Convex programs with an additional reverse convex constraint (Q1071651) (← links)
• A note on the solution of bilinear programming problems by reduction to concave minimization (Q1102190) (← links)
• On finding new vertices and redundant constraints in cutting plane algorithms for global optimization (Q1102872) (← links)
• Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems (Q1106728) (← links)
• The design centering problem as a d.c. programming problem (Q1106730) (← links)
• On the global minimization of a convex function under general nonconvex constraints (Q1111474) (← links)
• A finite method for globally minimizing a concave function over an unbounded polyhedral convex set and its applications (Q1112727) (← links)
• Modification, implementation and comparison of three algorithms for globally solving linearly constrained concave minimization problems (Q1122325) (← links)
• On-line and off-line vertex enumeration by adjacency lists (Q1180822) (← 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)
• Convex minimization under Lipschitz constraints (Q1823144) (← links)
• A method for solving d.c. programming problems. Application to fuel mixture nonconvex optimization problem (Q1890947) (← links)
• Dual approach to minimization on the set of Pareto-optimal solutions (Q1918295) (← links)
• Canonical DC programming problem: Outer approximation methods revisited (Q1919172) (← links)
• Separable concave minimization via partial outer approximation and branch and bound (Q2277369) (← links)
• A new algorithm to find all vertices of a polytope (Q2314411) (← links)
• D.c sets, d.c. functions and nonlinear equations (Q2367918) (← links)
• Finite method of minimizing a concave function under linear constraints and applications (Q3030588) (← links)
• A decomposition method for the min concave cost flow problem with a staircase structure (Q3471825) (← links)
• Deterministic methods in constrained global optimization: Some recent advances and new fields of application (Q3494393) (← links)
• Concave minimization under linear constraints with special structure (Q3710317) (← links)
• Global optimization under Lipschitzian constraints (Q3760303) (← links)
• Parametric approach to a class of nonconvex global optimization problems (Q3787803) (← links)
• A Benson-type algorithm for bounded convex vector optimization problems with vertex selection (Q5043850) (← links)
• Level function method for quasiconvex programming. (Q5929422) (← links)