Benchmarks for Optimization Software
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Erratum to: ``On the solution of large-scale SDP problems by the modified barrier method using iterative solvers
- Feasibility pump 2.0
- complib
- CSDP
- An interior-point algorithm for nonconvex nonlinear programming
- SDPSymmetryReduction.jl
- HiGHS
- RACQP
- SDPLIB
- Sdpsol
- SCIP
- SCIL
- Applications of convex optimization in signal processing and digital communication
- A computational study of a gradient-based log-barrier algorithm for a class of large-scale SDPs
- An independent benchmarking of SDP and SOCP solvers
- ASYNPLEX
- SDPHA
- LFTB
- SDPA
- SCCP
- UG
- SeDuMi
- testenv
- SDPT3
- LIBOPT
- SoPlex
- Zimpl
- MIPLIB
- Basin hopping networks of continuous global optimization problems
- Best practices for comparing optimization algorithms
- Parallelizing the dual revised simplex method
- SparsePOP
- PENNON
- GloptiPoly
- DSDP5
- Using diversification, communication and parallelism to solve mixed-integer linear programs
- Convex quadratic relaxations for mixed-integer nonlinear programs in power systems
- QSopt_ex
- SMCP
- SDPLR
- SparseCoLO
- COL
- FEASPUMP
- Domain reduction techniques for global NLP and MINLP optimization
- SCIP-Jack -- a solver for STP and variants with parallelization extensions
- OPALQP
- CLP
- QSopt-Exact
- PENSDP
- csminwel
- CG+
- Glider routing and trajectory optimisation in disaster assessment
- lambda
- OPAL
- Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone
- Valse-XT
- DipPy
- SAS/OR
- ParaSCIP
- MULKNAP
- EXTRACOL
- Branching rules revisited
- Interior point methods for second-order cone programming and OR applications
- NCSOStools
- SCR
- MATPOWER
- SpeeDP: an algorithm to compute SDP bounds for very large max-cut instances
- How to generate weakly infeasible semidefinite programs via Lasserre's relaxations for polynomial optimization
- Polynomial Toolbox
- HQP
- The tracial moment problem and trace-optimization of polynomials
- A brief history of linear and mixed-integer programming computation
- Maximum-weight stable sets and safe lower bounds for graph coloring
- MIPLIB2003
- SDPARA
- SBmethod
- NCAlgebra
- Return-mapping algorithms for associative isotropic hardening plasticity using conic optimization
- An exact cutting plane algorithm to solve the selective graph coloring problem in perfect graphs
- DEVEX
- Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion
- COPS
- MaxCliqueDyn
- MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library
- Adaptive XIGA shakedown analysis for problems with holes
- MOPS
- Satin
- On a primal-dual Newton proximal method for convex quadratic programs
- PAVER
- PyEvalGui
- Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT
- Learning to steer nonlinear interior-point methods
- Lurupa
- DINS
- Benchmarking optimization software -- a (Hi)story
- Bilevel cutting-plane algorithm for cardinality-constrained mean-CVaR portfolio optimization
- COSMO: a conic operator splitting method for convex conic problems
- SIMPAR
- PAVER 2.0: an open source environment for automated performance analysis of benchmarking data
- Pivot-and-reduce cuts: an approach for improving Gomory mixed-integer cuts
This page was built for software: Benchmarks for Optimization Software
