Generalized -valid cut procedure for concave minimization

DOI10.1023/A:1021776323080MaRDI QIDQ1807817zbMATH OpenOpenAlexFDO

Authors Harold P. Benson

Publication date 14 June 2000

Published in Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1021776323080

zbMATH Keywords

\(\gamma\)-valid cutconcave minimizationglobal optimizationTuy cut

Mathematics Subject Classification ID

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

Recommendations

• On the hierarchy of γ-valid cuts in global optimization
• Globally convergent cutting plane method for nonconvex nonsmooth minimization
• A general iterative method for solving constrained convex minimization problems
• An improved cutting plane method for convex optimization, convex-concave games, and its applications
• Modified cutting plane method for minimization of a convex function
• Publication:4955984
• Generalized -convex and related functions with applications to optimality
• scientific article; zbMATH DE number 7514021
• On the convergence of cutting plane algorithms for a class of nonconvex mathematical programs
• Finitely convergent cutting planes for concave minimization

Cites work

• A new pivoting rule for solving various degeneracy problems
• Checking local optimality in constrained quadratic programming is NP- hard
• Convex Analysis
• Deterministic algorithms for constrained concave minimization: A unified critical survey
• scientific article; zbMATH DE number 757675 (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?)
• Methods for Global Concave Minimization: A Bibliographic Survey

Cited in

(4)

• Two-stage optimization problems with multivariate stochastic order constraints
• Cut elimination for GLS using the terminability of its regress process
• On the hierarchy of γ-valid cuts in global optimization
• When can \(l_p\)-norm objective functions be minimized via graph cuts?

This page was built for publication: Generalized \(\gamma\)-valid cut procedure for concave minimization

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