A convergent conical algorithm with \(\omega \)-bisection for concave minimization

DOI10.1007/s10898-014-0197-8zbMath1311.90110OpenAlexW1982028266MaRDI QIDQ2018479

Takahito Kuno, Tomohiro Ishihama

Publication date: 24 March 2015

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-014-0197-8

zbMATH Keywords

global optimizationconcave minimizationconical algorithm\(\omega \)-subdivisionbisection

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Related Items

A generalization of \(\omega \)-subdivision ensuring convergence of the simplicial algorithm

Uses Software

• GLPK

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Normal conical algorithm for concave minimization over polytopes
• Effect of the subdivision strategy on convergence and efficiency of some global optimization algorithms
• A simplified convergence proof for the cone partitioning algorithm
• Finiteness of conical algorithms with \(\omega\)-subdivisions
• Exhaustive Nondegenerate Conical Processes for Concave Minimization on Convex Polytopes
• Convergent Algorithms for Minimizing a Concave Function
• Global Maximization of a Convex Function with Linear Inequality Constraints
• Computationally Related Problems
• Nonlinear Programming: Counterexamples to Two Global Optimization Algorithms
• Convex Analysis
• Convex analysis and global optimization
• On the convergence of cone splitting algorithms with \(\omega\)-subdivisions