Convex mixed-integer optimization with Frank-Wolfe methods
From MaRDI portal
Cites work
- A feasible active set method with reoptimization for convex quadratic mixed-integer programming
- A framework for solving mixed-integer semidefinite programs
- A Frank-Wolfe based branch-and-bound algorithm for mean-risk optimization
- A Mixed-Integer Fractional Optimization Approach to Best Subset Selection
- A unified approach to mixed-integer optimization problems with logical constraints
- An algorithmic framework for convex mixed integer nonlinear programs
- An Alternating Method for Cardinality-Constrained Optimization: A Computational Study for the Best Subset Selection and Sparse Portfolio Problems
- An exploratory computational analysis of dual degeneracy in mixed-integer programming
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- BARON: A general purpose global optimization software package
- Best subset selection via a modern optimization lens
- Enabling research through the SCIP Optimization Suite 8.0
- Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON
- Fast best subset selection: coordinate descent and local combinatorial optimization algorithms
- FrankWolfe.jl: A High-Performance and Flexible Toolbox for Frank–Wolfe Algorithms and Conditional Gradients
- George Dantzig's contributions to integer programming
- scientific article; zbMATH DE number 1943822 (Why is no real title available?)
- scientific article; zbMATH DE number 5066287 (Why is no real title available?)
- Improved algorithms and novel applications of the FrankWolfe.jl library
- MathOptInterface: A Data Structure for Mathematical Optimization Problems
- Minotaur: a mixed-integer nonlinear optimization toolkit
- MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library
- Numerical Experience with Lower Bounds for MIQP Branch-And-Bound
- Optimal methods of smooth convex minimization
- Parallelizing the dual revised simplex method
- Presolve Reductions in Mixed Integer Programming
- Restarting Frank-Wolfe: faster rates under Hölderian error bounds
- Scalable Frank-Wolfe on generalized self-concordant functions via simple steps
- Some comments on Wolfe's ‘away step’
- The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming
- The Frank-Wolfe algorithm: a short introduction
- The supporting hyperplane optimization toolkit for convex MINLP
- Three enhancements for optimization-based bound tightening
This page was built for publication: Convex mixed-integer optimization with Frank-Wolfe methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6891997)
