QPsimplex

swMATH31751MaRDI QIDQ43462FDOQ43462

Author name not available (Why is that?)

Source code repository: https://zenodo.org/record/1489153#.XjvEf8ZKjmI

Described by source

• Simplex QP-based methods for minimizing a conic quadratic objective over polyhedra

Cited In (4)

• A Mixed-Integer Fractional Optimization Approach to Best Subset Selection
• Submodularity in Conic Quadratic Mixed 0–1 Optimization
• An active set algorithm for robust combinatorial optimization based on separation oracles
• Successive Quadratic Upper-Bounding for Discrete Mean-Risk Minimization and Network Interdiction

This page was built for software: QPsimplex