A generalization of -subdivision ensuring convergence of the simplicial algorithm

DOI10.1007/S10589-015-9817-6zbMATH Open1370.90192OpenAlexW2227210696MaRDI QIDQ286595FDOQ286595

Authors: Takahito Kuno, Tomohiro Ishihama 

Publication date: 25 May 2016

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

Full work available at URL: https://doi.org/10.1007/s10589-015-9817-6

Recommendations

• A convergent simplicial algorithm with \(\omega \)-subdivision and \(\omega \)-bisection strategies
• A modified simplicial algorithm for convex maximization based on an extension of \(\omega \)-subdivision
• On convergence of the simplicial branch-and-bound algorithm based on \(\omega\)-subdivisions
• Finiteness of conical algorithms with \(\omega\)-subdivisions
• Finiteness result for the simplicial branch-and-bound algorithm based on \(\omega\)-subdivisions

zbMATH Keywords

global optimizationbranch-and-bound\(\omega \)-subdivisionsimplicial algorithmstrictly convex maximization

Mathematics Subject Classification ID

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

Cites Work

• Convex Analysis
• Finiteness of conical algorithms with \(\omega\)-subdivisions
• Title not available (Why is that?)
• Introduction to global optimization
• Convex analysis and global optimization
• Normal conical algorithm for concave minimization over polytopes
• A simplified convergence proof for the cone partitioning algorithm
• A convergent conical algorithm with \(\omega \)-bisection for concave minimization
• Global optimization. Theory, algorithms, and applications
• Convergent Algorithms for Minimizing a Concave Function
• An algorithm for nonconvex programming problems
• A convergent simplicial algorithm with \(\omega \)-subdivision and \(\omega \)-bisection strategies
• Title not available (Why is that?)
• On convergence of the simplicial branch-and-bound algorithm based on \(\omega\)-subdivisions
• Finiteness result for the simplicial branch-and-bound algorithm based on \(\omega\)-subdivisions
• On the convergence of cone splitting algorithms with \(\omega\)-subdivisions

Cited In (3)

• A convergent simplicial algorithm with \(\omega \)-subdivision and \(\omega \)-bisection strategies
• A modified simplicial algorithm for convex maximization based on an extension of \(\omega \)-subdivision
• Finiteness of conical algorithms with \(\omega\)-subdivisions

This page was built for publication: A generalization of \(\omega \)-subdivision ensuring convergence of the simplicial algorithm

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