Pages that link to "Item:Q1106728"

The following pages link to Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems (Q1106728):

Displaying 38 items.

• Optimization methods for mixed integer weakly concave programming problems (Q489113) (← links)
• The theoretical and empirical rate of convergence for geometric branch-and-bound methods (Q609566) (← links)
• Combined branch-and-bound and cutting plane methods for solving a class of nonlinear programming problems (Q686998) (← links)
• Branch and Win: OR tree search algorithms for solving combinatorial optimisation problems. (Q703298) (← links)
• Certified efficient global roundness evaluation (Q779864) (← links)
• Methods for solving multi-extremal problems (global search) (Q811399) (← 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)
• On the global minimization of a convex function under general nonconvex constraints (Q1111474) (← 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)
• Effect of the subdivision strategy on convergence and efficiency of some global optimization algorithms (Q1177911) (← links)
• Mathematical programs with a two-dimensional reverse convex constraint (Q1186268) (← 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)
• GBSSS: The generalized big square small square method for planar single- facility location (Q1196029) (← links)
• Calculation of bounds on variables satisfying nonlinear inequality constraints (Q1207040) (← links)
• Hybrid approach for solving multiple-objective linear programs in outcome space (Q1265035) (← links)
• On the topological complexity of DC-sets (Q1318268) (← links)
• A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron (Q1332814) (← links)
• Branch-and-bound decomposition approach for solving quasiconvex-concave programs (Q1333350) (← links)
• DC decomposition of nonconvex polynomials with algebraic techniques (Q1749445) (← links)
• New LP bound in multivariate Lipschitz optimization: Theory and applications (Q1905038) (← links)
• Decomposition approach for the global minimization of biconcave functions over polytopes (Q1918288) (← links)
• Canonical DC programming problem: Outer approximation methods revisited (Q1919172) (← links)
• A branch-and-reduce approach to global optimization (Q1924068) (← links)
• The cost of not knowing enough: mixed-integer optimization with implicit Lipschitz nonlinearities (Q2136869) (← links)
• A modified proximal point method for DC functions on Hadamard manifolds (Q2191784) (← links)
• A solution algorithm for non-convex mixed integer optimization problems with only few continuous variables (Q2255939) (← links)
• Outer approximation algorithms for canonical DC problems (Q2269586) (← 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)
• A proximal point method for difference of convex functions in multi-objective optimization with application to group dynamic problems (Q2301136) (← links)
• A decomposition method for MINLPs with Lipschitz continuous nonlinearities (Q2330657) (← links)
• Variations and extension of the convex-concave procedure (Q2358020) (← links)
• On the exhaustivity of simplicial partitioning (Q2442641) (← links)
• On solving general reverse convex programming problems by a sequence of linear programs and line searches (Q2638938) (← links)
• Convex Maximization via Adjustable Robust Optimization (Q5106408) (← links)
• A successive linear relaxation method for MINLPs with multivariate Lipschitz continuous nonlinearities (Q6050153) (← links)