Pages that link to "Item:Q1149236"

The following pages link to On the convergence of two branch-and-bound algorithms for nonconvex programming problems (Q1149236):

Displaying 16 items.

• Combined branch-and-bound and cutting plane methods for solving a class of nonlinear programming problems (Q686998) (← links)
• Global optimization algorithms for linearly constrained indefinite quadratic problems (Q810370) (← 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)
• 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)
• Inclusion functions and global optimization. II (Q1102865) (← links)
• Algorithms for parametric nonconvex programming (Q1158344) (← links)
• Method for minimizing a convex-concave function over a convex set (Q1176848) (← links)
• An all-linear programming relaxation algorithm for optimizing over the efficient set (Q1177916) (← links)
• Convergence qualification of adaptive partition algorithms in global optimization (Q1196187) (← links)
• Calculation of bounds on variables satisfying nonlinear inequality constraints (Q1207040) (← links)
• A finite, nonadjacent extreme-point search algorithm for optimization over the efficient set (Q1321160) (← links)
• Deletion-by-infeasibility rule for DC-constrained global optimization (Q1893323) (← links)
• On the selection of subdivision directions in interval branch-and-bound methods for global optimization (Q1904648) (← links)
• Separable concave minimization via partial outer approximation and branch and bound (Q2277369) (← links)
• On solving general reverse convex programming problems by a sequence of linear programs and line searches (Q2638938) (← links)