Pages that link to "Item:Q1780958"
From MaRDI portal
The following pages link to A comparison of complete global optimization solvers (Q1780958):
Displaying 15 items.
- Extended reverse-convex programming: an approximate enumeration approach to global optimization (Q288222) (← links)
- Linear and parabolic relaxations for quadratic constraints (Q300753) (← links)
- Integrated experimental design and nonlinear optimization to handle computationally expensive models under resource constraints (Q367165) (← links)
- A reliable affine relaxation method for global optimization (Q496103) (← links)
- A class of nonlinear nonseparable continuous Knapsack and multiple-choice knapsack problems (Q623462) (← links)
- An approach to constrained global optimization based on exact penalty functions (Q693136) (← links)
- Augmented Lagrangians with possible infeasibility and finite termination for global nonlinear programming (Q742114) (← links)
- A review of recent advances in global optimization (Q842710) (← links)
- To be fair or efficient or a bit of both (Q925820) (← links)
- Moving-horizon state estimation for nonlinear discrete-time systems: new stability results and approximation schemes (Q958266) (← links)
- Evaluating ASP and commercial solvers on the CSPLib (Q1020490) (← links)
- Basin hopping networks of continuous global optimization problems (Q1642814) (← links)
- Best practices for comparing optimization algorithms (Q1642983) (← links)
- How difficult is nonlinear optimization? A practical solver tuning approach, with illustrative results (Q1657404) (← links)
- A computational study of global optimization solvers on two trust region subproblems (Q1668805) (← links)
