An Enhancement of the Bisection Method Average Performance Preserving Minmax Optimality

DOI10.1145/3423597OpenAlexW3112697985WikidataQ113309901 ScholiaQ113309901MaRDI QIDQ5025219FDOQ5025219

Authors: I. F. D. Oliveira, R. H. C. Takahashi 

Publication date: 1 February 2022

Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3423597

Recommendations

• A multiple penalty function method for solving max-bisection problems
• Asymptotic near optimality of the bisection method
• scientific article; zbMATH DE number 2063458
• A 2-approximation for the maximum satisfying bisection problem
• An effective iterated tabu search for the maximum bisection problem
• An improved semidefinite programming hierarchies rounding approximation algorithm for maximum graph bisection problems
• An Improved Semidefinite Programming Hierarchies Rounding Approximation Algorithm for Maximum Graph Bisection Problems
• An improved kernel for max-bisection above tight lower bound
• A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems
• scientific article; zbMATH DE number 1762086

zbMATH Keywords

bisection methodorder of convergenceworst-case performanceminmaxaverage performancezero findingregula-falsi methodroot searching

Mathematics Subject Classification ID

Numerical analysis (65-XX)

Cited In (3)

• An incremental descent method for multi-objective optimization
• Newton-based methods for finding the positive ground state of Gross-Pitaevskii equations
• Average-Case Optimality of a Hybrid Secant-Bisection Method

This page was built for publication: An Enhancement of the Bisection Method Average Performance Preserving Minmax Optimality

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