Pages that link to "Item:Q5265166"
From MaRDI portal
The following pages link to Mirror-Descent Methods in Mixed-Integer Convex Optimization (Q5265166):
Displaying 10 items.
- Algorithms of inertial mirror descent in stochastic convex optimization problems (Q1699880) (← links)
- Integer convex minimization by mixed integer linear optimization (Q1785273) (← links)
- Constructing lattice-free gradient polyhedra in dimension two (Q2118128) (← links)
- Mirror Prox algorithm for multi-term composite minimization and semi-separable problems (Q2350862) (← links)
- Mirror descent and convex optimization problems with non-smooth inequality constraints (Q2415205) (← links)
- Minimizing cubic and homogeneous polynomials over integers in the plane (Q2806816) (← links)
- Two-step MIR inequalities for mixed integer programs (Q2899057) (← links)
- Constructing Lattice-Free Gradient Polyhedra in Dimension Two (Q5041758) (← links)
- Using Nemirovski's Mirror-Prox method as basic procedure in Chubanov's method for solving homogeneous feasibility problems (Q5058382) (← links)
- Complexity of optimizing over the integers (Q6160281) (← links)