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

DOI10.1007/S10898-018-0619-0zbMATH Open1402.90132OpenAlexW2793383223MaRDI QIDQ721144FDOQ721144

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

Recommendations

• A convergent simplicial algorithm with \(\omega \)-subdivision and \(\omega \)-bisection strategies
• A generalization of \(\omega \)-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

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)

Cites Work

• Variational Analysis
• Title not available (Why is that?)
• Title not available (Why is that?)
• An Algorithm for Separable Nonconvex Programming Problems
• Title not available (Why is that?)
• Introduction to global optimization
• Convex analysis and global optimization
• Global optimization. Theory, algorithms, and applications
• A generalization of \(\omega \)-subdivision ensuring convergence of the simplicial algorithm
• 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
• Computationally Related Problems
• Minimum concave-cost network flow problems: Applications, complexity, and algorithms
• Title not available (Why is that?)

Cited In (2)

• A generalization of \(\omega \)-subdivision ensuring convergence of the simplicial algorithm
• A convergent simplicial algorithm with \(\omega \)-subdivision and \(\omega \)-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)