Pages that link to "Item:Q5897050"

The following pages link to Global Optimization and Constraint Satisfaction (Q5897050):

Displaying 34 items.

• Linear and parabolic relaxations for quadratic constraints (Q300753) (← links)
• A reliable affine relaxation method for global optimization (Q496103) (← links)
• Reverse propagation of McCormick relaxations (Q496587) (← links)
• Global optimization test problems based on random field composition (Q523165) (← links)
• A metaheuristic methodology based on the limitation of the memory of interval branch and bound algorithms (Q645553) (← links)
• Filter-based DIRECT method for constrained global optimization (Q721164) (← links)
• A review of recent advances in global optimization (Q842710) (← links)
• Efficient interval partitioning for constrained global optimization (Q956597) (← links)
• Evaluating ASP and commercial solvers on the CSPLib (Q1020490) (← links)
• Best practices for comparing optimization algorithms (Q1642983) (← links)
• Efficient solution of many instances of a simulation-based optimization problem utilizing a partition of the decision space (Q1657403) (← links)
• A comparison of complete global optimization solvers (Q1780958) (← links)
• Benchmarking nonlinear optimization software in technical computing environments (Q1948530) (← links)
• Global minimization using an augmented Lagrangian method with variable lower-level constraints (Q1960193) (← links)
• Rigorous verification of feasibility (Q2018466) (← links)
• Branching and bounding improvements for global optimization algorithms with Lipschitz continuity properties (Q2018512) (← links)
• Convergent upper bounds in global minimization with nonlinear equality constraints (Q2020617) (← links)
• On rigorous upper bounds to a global optimum (Q2250091) (← links)
• Exclusion regions for optimization problems (Q2250096) (← links)
• Efficient computation of spectral bounds for Hessian matrices on hyperrectangles for global optimization (Q2250109) (← links)
• First order rejection tests for multiple-objective optimization (Q2250111) (← links)
• On tightness and anchoring of McCormick and other relaxations (Q2274852) (← links)
• A derivative-free algorithm for constrained global optimization based on exact penalty functions (Q2342135) (← links)
• The optimization test environment (Q2357211) (← links)
• Improved constraint consensus methods for seeking feasibility in nonlinear programs (Q2377177) (← links)
• A general framework for convexity analysis in deterministic global optimization (Q2392103) (← links)
• A DIRECT-type approach for derivative-free constrained global optimization (Q2397821) (← links)
• A robust approach for finding all well-separated solutions of sparse systems of nonlinear equations (Q2408155) (← links)
• Solving kinematics problems by efficient interval partitioning (Q2443368) (← links)
• Efficient interval partitioning-local search collaboration for constraint satisfaction (Q2459380) (← links)
• Constrained circles packing test problems: all the optimal solutions known (Q3066942) (← links)
• Improved Automatic Computation of Hessian Matrix Spectral Bounds (Q5739795) (← links)
• Constraint aggregation for rigorous global optimization (Q5962722) (← links)
• Node selection strategies in interval branch and bound algorithms (Q5964243) (← links)