CBLIB 2014: a benchmark library for conic mixed-integer and continuous optimization
From MaRDI portal
Publication:298162
DOI10.1007/s12532-015-0092-4zbMath1338.90495OpenAlexW2152191514WikidataQ125849078 ScholiaQ125849078MaRDI QIDQ298162
Publication date: 20 June 2016
Published in: Mathematical Programming Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12532-015-0092-4
Convex programming (90C25) Applications of mathematical programming (90C90) Mixed integer programming (90C11)
Related Items
MathOptInterface: A Data Structure for Mathematical Optimization Problems ⋮ Disjunctive cuts in mixed-integer conic optimization ⋮ Performance enhancements for a generic conic interior point algorithm ⋮ Outer approximation with conic certificates for mixed-integer convex problems ⋮ BPPLIB: a library for bin packing and cutting stock problems ⋮ CBLIB ⋮ Linear Convergence of Random Dual Coordinate Descent on Nonpolyhedral Convex Problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solving semidefinite-quadratic-linear programs using SDPT3
- Facial reduction algorithms for conic optimization problems
- An effective implementation of symbolic-numeric cylindrical algebraic decomposition for quantifier elimination
- New stopping criteria for detecting infeasibility in conic optimization
- Applications of second-order cone programming
- Solving certain singly constrained convex optimization problems in production planning
- Second-order cone programming
- The final NETLIB-LP results
- Infeasible-start primal-dual methods and infeasibility detectors for nonlinear programming problems
- Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone
- Strange behaviors of interior-point methods for solving semidefinite programming problems in polynomial optimization
- Warmstarting the homogeneous and self-dual interior point method for linear and conic quadratic problems
- Feasibility and infeasibility in optimization. Algorithms and computational methods.
- Lectures on Modern Convex Optimization
- Algorithms and Software for Convex Mixed Integer Nonlinear Programs
- Extending a CIP Framework to Solve MIQCPs
- A Lifted Linear Programming Branch-and-Bound Algorithm for Mixed-Integer Conic Quadratic Programs
- Convex quadratic and semidefinite programming relaxations in scheduling
- On Handling Free Variables in Interior-Point Methods for Conic Linear Optimization
- Testing a Class of Methods for Solving Minimization Problems with Simple Bounds on the Variables
- Computing Limit Loads by Minimizing a Sum of Norms
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- SDPLIB 1.2, a library of semidefinite programming test problems
- Sensible Rules for Remembering Duals—the S-O-B Method
- Incorporating Condition Measures into the Complexity Theory of Linear Programming
- Solving Conic Optimization Problems via Self-Dual Embedding and Facial Reduction: A Unified Approach
- SPARSE SECOND ORDER CONE PROGRAMMING FORMULATIONS FOR CONVEX OPTIMIZATION PROBLEMS
- Worst-case CVaR based portfolio optimization models with applications to scenario planning
- Computational experience with ill-posed problems in semidefinite programming
