Pages that link to "Item:Q1090614"

The following pages link to Branch-and-bound methods for solving systems of Lipschitzian equations and inequalities (Q1090614):

Displaying 11 items.

• Solving nonlinear equation systems via global partition and search: Some experimental results (Q582008) (← links)
• Concave minimization via conical partitions and polyhedral outer approximation (Q811411) (← links)
• Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems (Q1106728) (← links)
• An application of Lipschitzian global optimization to product design (Q1200528) (← links)
• Calculation of bounds on variables satisfying nonlinear inequality constraints (Q1207040) (← links)
• Utility function programs and optimization over the efficient set in multiple-objective decision making (Q1356096) (← links)
• A method for solving d.c. programming problems. Application to fuel mixture nonconvex optimization problem (Q1890947) (← links)
• New LP bound in multivariate Lipschitz optimization: Theory and applications (Q1905038) (← links)
• The cost of not knowing enough: mixed-integer optimization with implicit Lipschitz nonlinearities (Q2136869) (← links)
• A decomposition method for MINLPs with Lipschitz continuous nonlinearities (Q2330657) (← links)
• A successive linear relaxation method for MINLPs with multivariate Lipschitz continuous nonlinearities (Q6050153) (← links)