Pages that link to "Item:Q1962863"

The following pages link to Deterministic global optimization. Theory, methods and applications (Q1962863):

Displaying 32 items.

• DEFT-FUNNEL: an open-source global optimization solver for constrained grey-box and black-box problems (Q2245001) (← links)
• Linearization-based algorithms for mixed-integer nonlinear programs with convex continuous relaxation (Q2250087) (← links)
• ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations (Q2250093) (← links)
• How to solve a semi-infinite optimization problem (Q2253347) (← links)
• Integrated multi-site aggregate production-pricing planning in a two-echelon supply chain with multiple demand classes (Q2294947) (← links)
• Deterministic upper bounds for spatial branch-and-bound methods in global minimization with nonconvex constraints (Q2355020) (← links)
• An efficient convexification method for solving generalized geometric problems (Q2358874) (← links)
• Linear scaling and the DIRECT algorithm (Q2392126) (← links)
• Improved logarithmic linearizing method for optimization problems with free-sign pure discrete signomial terms (Q2397434) (← links)
• An algorithm for bounded-error identification of nonlinear systems based on DC functions (Q2440614) (← links)
• An intelligent genetic algorithm designed for global optimization of multi-minima functions (Q2507830) (← links)
• A Lagrangian heuristic for concave cost facility location problems: the plant location and technology acquisition problem (Q2629912) (← links)
• Kuhn-Tucker sufficiency for global minimum of multi-extremal mathematical programming problems (Q2642150) (← links)
• Optimising portfolio diversification and dimensionality (Q2679246) (← links)
• Modified DIRECT Algorithm for Scaled Global Optimization Problems (Q2942499) (← links)
• Parallel Global Optimization in Multidimensional Scaling (Q3613502) (← links)
• Challenges in Enterprise Wide Optimization for the Process Industries (Q3638498) (← links)
• Overcoming the Key Challenges in De Novo Protein Design: Enhancing Computational Efficiency and Incorporating True Backbone Flexibility (Q4607140) (← links)
• Approximate Global Minimizers to Pairwise Interaction Problems via Convex Relaxation (Q4608088) (← links)
• Competitive facility location problem with attractiveness adjustment of the follower on the closed supply chain (Q4966769) (← links)
• Finding all global optima of engineering design problems with discrete signomial terms (Q5059294) (← links)
• MultiComposite Nonconvex Optimization for Training Deep Neural Networks (Q5114402) (← links)
• A Partition Based Bayesian Multi-objective Optimization Algorithm (Q5122343) (← links)
• Efficient Convexification Strategy for Generalized Geometric Programming Problems (Q5138255) (← links)
• Stationary probability density of stochastic search processes in global optimization (Q5239420) (← links)
• Model Development and Optimization for Space Engineering: Concepts, Tools, Applications, and Perspectives (Q5270058) (← links)
• Performance of convex underestimators in a branch-and-bound framework (Q5963232) (← links)
• An extension of the \(\alpha\mathrm{BB}\)-type underestimation to linear parametric Hessian matrices (Q5964239) (← links)
• Subdomain separability in global optimization (Q6173955) (← links)
• Optimization of the optimal value function in problems of convex parametric programming (Q6194911) (← links)
• A branch-and-bound algorithm with growing datasets for large-scale parameter estimation (Q6586253) (← links)
• A branch-and-bound algorithm for nonconvex Nash equilibrium problems (Q6622755) (← links)