Minimizing a symmetric quasiconvex function on a two-dimensional lattice
From MaRDI portal
Publication:4558294
Recommendations
- Minimization of quasi-convex symmetric and of discretely quasi-convex symmetric functions
- A polynomial algorithm for minimizing discrete convic functions in fixed dimension
- On the complexity of quasiconvex integer minimization problem
- Minimization of even conic functions on the two-dimensional integral lattice
- A method for minimizing a quasiconvex function in a two-dimensional plane without computing derivatives
Cites work
- scientific article; zbMATH DE number 3972626 (Why is no real title available?)
- scientific article; zbMATH DE number 1234104 (Why is no real title available?)
- scientific article; zbMATH DE number 3233290 (Why is no real title available?)
- A new Lenstra-type algorithm for quasiconvex polynomial integer minimization with complexity \(2^{O(n\log n)}\)
- Centerpoints: a link between optimization and convex geometry
- Complexity of integer quasiconvex polynomial optimization
- Integer convex minimization by mixed integer linear optimization
- Optimization theory and methods. Nonlinear programming
- Quasiconvex functions can be approximated by quasiconvex polynomials
- Sequential Minimax Search for a Maximum
Cited in
(5)- Minimization of even conic functions on the two-dimensional integral lattice
- A method for minimizing a quasiconvex function in a two-dimensional plane without computing derivatives
- Minimum energy configurations on a toric lattice as a quadratic assignment problem
- A polynomial algorithm for minimizing discrete convic functions in fixed dimension
- On the complexity of quasiconvex integer minimization problem
This page was built for publication: Minimizing a symmetric quasiconvex function on a two-dimensional lattice
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4558294)
