Minimizing a Symmetric Quasiconvex Function on a Two-Dimensional Lattice

DOI10.1134/S199047891803016XzbMath1413.90307OpenAlexW2888091553MaRDI QIDQ4558294

No author found.

Publication date: 21 November 2018

Published in: Journal of Applied and Industrial Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s199047891803016x

zbMATH Keywords

latticequasiconvex functionoracle integer

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47)

Related Items (3)

Minimization of even conic functions on the two-dimensional integral lattice ⋮ A polynomial algorithm for minimizing discrete convic functions in fixed dimension ⋮ On the complexity of quasiconvex integer minimization problem

Cites Work

• Integer convex minimization by mixed integer linear optimization
• A new Lenstra-type algorithm for quasiconvex polynomial integer minimization with complexity \(2^{O(n\log n)}\)
• Complexity of integer quasiconvex polynomial optimization
• Optimization theory and methods. Nonlinear programming
• Quasiconvex functions can be approximated by quasiconvex polynomials
• Centerpoints: A Link between Optimization and Convex Geometry
• Sequential Minimax Search for a Maximum
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Minimizing a Symmetric Quasiconvex Function on a Two-Dimensional Lattice