Pages that link to "Item:Q3883930"

The following pages link to A method for globally minimizing concave functions over convex sets (Q3883930):

Displaying 48 items.

• Convexification and concavification for a general class of global optimization problems (Q556003) (← links)
• On a finite branch and bound algorithm for the global minimization of a concave power law over a polytope (Q650234) (← links)
• Delaunay-based derivative-free optimization via global surrogates. I: Linear constraints (Q727384) (← links)
• A branch and bound-outer approximation algorithm for concave minimization over a convex set (Q757243) (← links)
• Delaunay-based derivative-free optimization via global surrogates. III: nonconvex constraints (Q785630) (← links)
• On the global minimization of concave functions (Q800693) (← links)
• Quasiconjugates of functions, duality relationship between quasiconvex minimization under a reverse convex constraint and quasiconvex maximization under a convex constraint, and applications (Q811400) (← links)
• Concave minimization via conical partitions and polyhedral outer approximation (Q811411) (← links)
• Fast Gaussian kernel learning for classification tasks based on specially structured global optimization (Q889286) (← links)
• A filled function method for constrained global optimization (Q925228) (← links)
• Convex programs with an additional reverse convex constraint (Q1071651) (← links)
• Outer approximation by polyhedral convex sets (Q1101351) (← 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)
• Minimizing a quasi-concave function subject to a reverse convex constraint (Q1108198) (← links)
• On the global minimization of a convex function under general nonconvex constraints (Q1111474) (← links)
• On-line and off-line vertex enumeration by adjacency lists (Q1180822) (← links)
• A decomposition method using a pricing mechanism for min concave cost flow problems with a hierarchical structure (Q1184354) (← 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 the duality of a non-convex optimization problem and the strong unicity constant in linear Chebyshev approximation (Q1192138) (← links)
• Convergence qualification of adaptive partition algorithms in global optimization (Q1196187) (← links)
• A global optimization approach for solving the convex multiplicative programming problem (Q1200524) (← links)
• Calculation of bounds on variables satisfying nonlinear inequality constraints (Q1207040) (← links)
• Global optimization conditions for certain nonconvex minimization problems (Q1342899) (← links)
• On global optimality conditions and cutting plane algorithms (Q1407243) (← links)
• The fixed charge transportation problem: a strong formulation based on Lagrangian decomposition and column generation (Q1630276) (← links)
• An exact solution method for reliability optimization in complex systems (Q1772968) (← links)
• Convex minimization under Lipschitz constraints (Q1823144) (← links)
• Least trimmed squares regression, least median squares regression, and mathematical program\-ming (Q1876766) (← links)
• Capacity planning in networks of queues with manufacturing applications (Q1900269) (← links)
• Nonconvex optimization over a polytope using generalized capacity improvement (Q1904646) (← links)
• Canonical DC programming problem: Outer approximation methods revisited (Q1919172) (← 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)
• D.c sets, d.c. functions and nonlinear equations (Q2367918) (← links)
• A branch-and-bound based method for solving monotone optimization problems (Q2501119) (← links)
• Sufficient optimality criterion for linearly constrained, separable concave minimization problems (Q2569195) (← links)
• On solving general reverse convex programming problems by a sequence of linear programs and line searches (Q2638938) (← links)
• A decomposition method for the min concave cost flow problem with a staircase structure (Q3471825) (← links)
• A class of convexification and concavification methods for non-monotone optimization problems (Q3534647) (← links)
• On an outer approximation concept in global optimization (Q3830824) (← links)
• On a Markov Decision Process problem involving the Maximum of the Difference between two functions: Technical Note (Q4718599) (← links)
• Input Efficiency Measures: A Generalized, Encompassing Formulation (Q5144799) (← links)
• Minimizing Piecewise-Concave Functions Over Polyhedra (Q5219555) (← links)
• A NOVEL MONOTONIZATION TRANSFORMATION FOR SOME CLASSES OF GLOBAL OPTIMIZATION PROBLEMS (Q5487849) (← links)
• Level function method for quasiconvex programming. (Q5929422) (← links)
• Semi-discrete optimal transport: hardness, regularization and numerical solution (Q6038666) (← links)