A convergent conical algorithm with -bisection for concave minimization

DOI10.1007/S10898-014-0197-8zbMATH Open1311.90110OpenAlexW1982028266MaRDI QIDQ2018479FDOQ2018479

Authors: 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

Recommendations

• Finiteness of conical algorithms with \(\omega\)-subdivisions
• On the convergence of cone splitting algorithms with \(\omega\)-subdivisions
• Normal conical algorithm for concave minimization over polytopes
• scientific article; zbMATH DE number 1795202
• Concave minimization via conical partitions and polyhedral outer approximation

zbMATH Keywords

global optimization\(\omega \)-subdivisionconcave minimizationbisectionconical algorithm

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Cites Work

• Convex Analysis
• Finiteness of conical algorithms with \(\omega\)-subdivisions
• Convex analysis and global optimization
• Normal conical algorithm for concave minimization over polytopes
• A simplified convergence proof for the cone partitioning algorithm
• Convergent Algorithms for Minimizing a Concave Function
• Title not available (Why is that?)
• On the convergence of cone splitting algorithms with \(\omega\)-subdivisions
• Computationally Related Problems
• Title not available (Why is that?)
• Exhaustive Nondegenerate Conical Processes for Concave Minimization on Convex Polytopes
• Finite element method. A practical introduction to GNU Octave/MATLAB
• Nonlinear Programming: Counterexamples to Two Global Optimization Algorithms
• Effect of the subdivision strategy on convergence and efficiency of some global optimization algorithms
• Global Maximization of a Convex Function with Linear Inequality Constraints

Cited In (4)

• Conical algorithm for the global minimization of linearly constrained decomposable concave minimization problems
• A generalization of \(\omega \)-subdivision ensuring convergence of the simplicial algorithm
• On the convergence of cone splitting algorithms with \(\omega\)-subdivisions
• A new successive partition algorithm for concave minimization based on cone decomposition and decomposition cuts

Uses Software

• GLPK

This page was built for publication: A convergent conical algorithm with \(\omega \)-bisection for concave minimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2018479)