Pages that link to "Item:Q800693"

The following pages link to On the global minimization of concave functions (Q800693):

Displaying 21 items.

• A hybrid method for quantum global optimization (Q427367) (← links)
• Global optimization algorithms for linearly constrained indefinite quadratic problems (Q810370) (← 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)
• A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization (Q1067978) (← links)
• Global optimization on convex sets (Q1089268) (← links)
• Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reserve convex constraints, DC-programming and Lipschitzian optimization (Q1090607) (← links)
• Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems (Q1106728) (← links)
• Modification, implementation and comparison of three algorithms for globally solving linearly constrained concave minimization problems (Q1122325) (← links)
• Normal conical algorithm for concave minimization over polytopes (Q1177231) (← 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)
• Calculation of bounds on variables satisfying nonlinear inequality constraints (Q1207040) (← links)
• Average shadow prices in mathematical programming (Q1321203) (← 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)
• Global optimization conditions for certain nonconvex minimization problems (Q1342899) (← links)
• An algorithm for maximizing a convex function over a simple set (Q1918984) (← links)
• Separable concave minimization via partial outer approximation and branch and bound (Q2277369) (← links)
• Lagrangian duality of concave minimization subject to linear constraints and an additional facial reverse convex constraint (Q2564166) (← links)
• On solving general reverse convex programming problems by a sequence of linear programs and line searches (Q2638938) (← links)