A modified simplicial algorithm for convex maximization based on an extension of -subdivision

DOI10.1007/S10898-018-0619-0MaRDI QIDQ721144zbMATH OpenOpenAlexFDO

Authors Takahito Kuno

Publication date 18 July 2018

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

Full work available at URL https://doi.org/10.1007/s10898-018-0619-0

zbMATH Keywords

global optimizationbranch-and-bound\(\omega \)-subdivisionsimplicial algorithmconvex maximization

Mathematics Subject Classification ID

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

Recommendations

• A convergent simplicial algorithm with -subdivision and -bisection strategies
• A generalization of -subdivision ensuring convergence of the simplicial algorithm
• 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
• An algorithm for maximizing a convex function over a simple set

Cites work

• scientific article; zbMATH DE number 3854804 (Why is no real title available?)
• scientific article; zbMATH DE number 1349588 (Why is no real title available?)
• scientific article; zbMATH DE number 914364 (Why is no real title available?)
• scientific article; zbMATH DE number 3215121 (Why is no real title available?)
• scientific article; zbMATH DE number 3074659 (Why is no real title available?)
• A convergent simplicial algorithm with -subdivision and -bisection strategies
• A generalization of -subdivision ensuring convergence of the simplicial algorithm
• An Algorithm for Separable Nonconvex Programming Problems
• An algorithm for nonconvex programming problems
• Computationally Related Problems
• Convex analysis and global optimization
• Finiteness result for the simplicial branch-and-bound algorithm based on \(\omega\)-subdivisions
• Global optimization. Theory, algorithms, and applications
• Introduction to global optimization
• Minimum concave-cost network flow problems: Applications, complexity, and algorithms
• On convergence of the simplicial branch-and-bound algorithm based on \(\omega\)-subdivisions
• Variational Analysis

Cited in

(2)

• A generalization of -subdivision ensuring convergence of the simplicial algorithm
• A convergent simplicial algorithm with -subdivision and -bisection strategies

This page was built for publication: A modified simplicial algorithm for convex maximization based on an extension of \(\omega \)-subdivision

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