scientific article; zbMATH DE number 903760
From MaRDI portal
Publication:4885374
Recommendations
- scientific article; zbMATH DE number 994413
- Branch- and bound algorithms for solving global optimization problems with Lipschitzian structure
- scientific article; zbMATH DE number 1199856
- Multisection in interval branch-and-bound methods for global optimization. II: Numerical tests
- A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization
- Second-order global optimality conditions for optimization problems
- Global optimization of nonlinear least-squares problems by branch-and-bound and optimality constraints
- Branching and bounding improvements for global optimization algorithms with Lipschitz continuity properties
- Multisection in interval branch-and-bound methods for global optimization. I: Theoretical results
- A branch and bound algorithm for globally solving a class of nonconvex programming problems
Cited in
(6)- A second-order pruning step for verified global optimization
- On the selection of subdivision directions in interval branch-and-bound methods for global optimization
- A rigorous deterministic global optimization approach for the derivation of secondary information in digital maps
- Solving a huff-like competitive location and design model for profit maximization in the plane
- New results on verified global optimization
- New interval methods for constrained global optimization
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4885374)
