A new simplicial cover technique in constrained global optimization
DOI10.1007/BF00121299zbMATH Open0784.90078OpenAlexW1999030226MaRDI QIDQ1187367FDOQ1187367
Authors: Reiner Horst, Nguyen Van Thoai, Jakob de Vries 
Publication date: 13 August 1992
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00121299
Recommendations
- On geometry and convergence of a class of simplicial covers
- A simplicial branch-and-bound algorithm conscious of special structures in concave minimization problems
- Subdivision of simplices relative to a cutting plane and finite concave minimization
- BRANCH AND BOUND WITH SIMPLICIAL PARTITIONS FOR GLOBAL OPTIMIZATION
- Finite exact branch-and-bound algorithms for concave minimization over polytopes
constrained global optimizationnonseparable, nonlinearly constrained concave minimizationsimplicial branch and bound-outer approximation technique
Nonlinear programming (90C30) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Cites Work
- Constrained global optimization: algorithms and applications
- An Algorithm for Separable Nonconvex Programming Problems
- Jointly Constrained Biconvex Programming
- An algorithm for nonconvex programming problems
- Title not available (Why is that?)
- On-line and off-line vertex enumeration by adjacency lists
- A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization
- Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems
- A Conical Algorithm for Globally Minimizing a Concave Function Over a Closed Convex Set
- On the convergence of global methods in multiextremal optimization
- A method for globally minimizing concave functions over convex sets
- Concave minimization via conical partitions and polyhedral outer approximation
- Effect of the subdivision strategy on convergence and efficiency of some global optimization algorithms
- Separable concave minimization via partial outer approximation and branch and bound
- An outer approximation method for globally minimizing a concave function over a compact convex set
- A note on the convergence of an algorithm for nonconvex programming problems
- A branch and bound-outer approximation algorithm for concave minimization over a convex set
- Outer approximation by polyhedral convex sets
- On finding new vertices and redundant constraints in cutting plane algorithms for global optimization
- On an outer approximation concept in global optimization
- On geometry and convergence of a class of simplicial covers
- Modification, implementation and comparison of three algorithms for globally solving linearly constrained concave minimization problems
- Using convex envelopes to solve the interactive fixed-charge linear programming problem
Cited In (7)
- BRANCH AND BOUND WITH SIMPLICIAL PARTITIONS FOR GLOBAL OPTIMIZATION
- On determining the cover of a simplex by spheres centered at its vertices
- Deterministic and stochastic global optimization techniques for planar covering with ellipses problems
- On geometry and convergence of a class of simplicial covers
- Primal-relaxed dual global optimization approach
- Constraint decomposition algorithms in global optimization
- \(\alpha BB\): A global optimization method for general constrained nonconvex problems
This page was built for publication: A new simplicial cover technique in constrained global optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1187367)
