Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
×
By some definitions, it seems that a convex integer optimization problem is impossible by definition: the very fact of constraining the variables to integer values removes the convexity of the problem, since for a problem to be convex, both the objective function and the feasible set have to be convex.
Sep 20, 2019
At a high level, this thesis focuses on the efficient solvability and approximability of this optimization problem, with the aim of uncovering general ...
Aug 23, 2022 · The proposed method computes feasible solutions while working on a single representation of the polyhedral constraints, leveraging the full ...
Convex optimization is a subfield of mathematical optimization that studies the problem of minimizing convex functions over convex sets Many classes of ...
Sep 20, 2019 · Yes, sometimes. Linear programmes are convex optimisation problems, and sometimes the solution to an integer programme are the same as the ...
Apr 2, 2019 · I presume you mean the constraints are Ax≤b where the coefficient matrix A is totally unimodular and the entries of b are all integers.
Feb 6, 2018 · Khachiyan and Porkolab in 'Integer optimization on convex semialgebraic sets' gave an O(ldO(k4)) algorithm to minimize a degree d form with ...
A new branch--and--bound-based algorithm for smooth nonconvex multiobjective optimization problems with convex constraints is presented. The algorithm computes ...
People also ask
Dec 15, 2023 · Convex optimization is the problem of minimizing a convex function on a convex domain. Convex functions are neat because each local minimum is a ...
Apr 15, 2014 · In this article we study convex integer maximization problems and the closely related projections of the sets of feasible points. Let S ⊂ Z n ...