On the convergence of cone splitting algorithms with \(\omega\)-subdivisions

DOI10.1023/A:1017595513275zbMath1002.90041OpenAlexW353671651MaRDI QIDQ5947265

Brigitte Jaumard, Christophe Meyer

Publication date: 29 May 2002

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1017595513275

zbMATH Keywords

concave minimization\(\omega\)-subdivisionconical algorithms

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26)

Related Items (4)

A generalization of \(\omega \)-subdivision ensuring convergence of the simplicial algorithm ⋮ A convergent simplicial algorithm with \(\omega \)-subdivision and \(\omega \)-bisection strategies ⋮ On convergence of the simplicial branch-and-bound algorithm based on \(\omega\)-subdivisions ⋮ A convergent conical algorithm with \(\omega \)-bisection for concave minimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Convergence of a Tuy-type algorithm for concave minimization subject to linear inequality constraints
• Normal conical algorithm for concave minimization over polytopes
• A simplified convergence proof for the cone partitioning algorithm
• Convergent Algorithms for Minimizing a Concave Function
• Global Maximization of a Convex Function with Linear Inequality Constraints
• Nonlinear Programming: Counterexamples to Two Global Optimization Algorithms
• Convex Analysis

This page was built for publication: On the convergence of cone splitting algorithms with \(\omega\)-subdivisions