Local minima, marginal functions, and separating hyperplanes in discrete optimization

DOI10.1016/J.CRMA.2007.10.047MaRDI QIDQ2473013zbMATH OpenOpenAlexFDO

Authors Christer O. Kiselman

Publication date 26 February 2008

Published in Comptes Rendus. Mathématique. Académie des Sciences, Paris (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.crma.2007.10.047

Mathematics Subject Classification ID

Integer programming (90C10) Convex programming (90C25) Combinatorial optimization (90C27)

Recommendations

• scientific article; zbMATH DE number 3949169
• A note on discrete convexity and local optimality
• More on conditions of local and global minima coincidence in discrete optimization problems
• Local approximability of max-min and min-max linear programs
• Local minima of nonconvex problems
• scientific article; zbMATH DE number 3898626
• scientific article; zbMATH DE number 1086728
• The hierarchy of local minimums in polynomial optimization
• The depth and width of local minima in discrete solution spaces
• Minimization of Locally Lipschitzian Functions

Cites work

• Discrete Convex Analysis
• scientific article; zbMATH DE number 3904328 (Why is no real title available?)
• Theory of capacities

Cited in

(5)

• Discrete convexity built on differences
• A note on discrete convexity and local optimality
• Questions inspired by Mikael Passare's mathematics
• scientific article; zbMATH DE number 221051 (Why is no real title available?)
• Local approximability of max-min and min-max linear programs

This page was built for publication: Local minima, marginal functions, and separating hyperplanes in discrete optimization

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