Cited in
(only showing first 100 items - show all)- Linear matrix inequalities in control systems with uncertainty
- Managing randomization in the multi-block alternating direction method of multipliers for quadratic optimization
- Return-mapping algorithms for associative isotropic hardening plasticity using conic optimization
- PAVER 2.0: an open source environment for automated performance analysis of benchmarking data
- On Handling Free Variables in Interior-Point Methods for Conic Linear Optimization
- The tracial moment problem and trace-optimization of polynomials
- A robust algorithm for semidefinite programming
- A computational study of primal heuristics inside an MI(NL)P solver
- Variational Methods for Denoising Matrix Fields
- The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs
- Assessment of a non-adaptive deterministic global optimization algorithm for problems with low-dimensional non-convex subspaces
- Sieve-SDP: a simple facial reduction algorithm to preprocess semidefinite programs
- An interior-point algorithm for nonconvex nonlinear programming
- The optimization test environment
- Improving the accuracy of linear programming solvers with iterative refinement
- Advances in the parallelization of the simplex method
- Benchmarking optimization software -- a (Hi)story
- A Newton-CG augmented Lagrangian method for semidefinite programming
- An extension of the elimination method for a sparse SOS polynomial
- Machine Learning: ECML 2004
- Semidefinite optimization models for limit and shakedown analysis problems involving matrix spreads
- On verified numerical computations in convex programming
- A computational study of parametric tabu search for 0-1 mixed integer programs
- An inexact smoothing method for SOCCPs based on a one-parametric class of smoothing function
- Integer programming techniques for the nurse rostering problem
- Lower bound limit analysis of cohesive-frictional materials using second-order cone programming
- Algorithm 875
- NCSOStools: a computer algebra system for symbolic and numerical computation with noncommutative polynomials
- Computational enhancements in low-rank semidefinite programming
- How to generate weakly infeasible semidefinite programs via Lasserre's relaxations for polynomial optimization
- Feasibility pump 2.0
- Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT
- Every convex free basic semi-algebraic set has an LMI representation
- Second-order cone programming approaches to static shakedown analysis in steel plasticity
- Integer-programming software systems
- Support vector machines maximizing geometric margins for multi-class classification
- Conditions for error bounds and bounded level sets of some merit functions for the second-order cone complementarity problem
- Algorithms – ESA 2005
- A boundary point method to solve semidefinite programs
- Rapid learning for binary programs
- Optimization-based design of plant-friendly multisine signals using geometric discrepancy criteria
- Glider routing and trajectory optimisation in disaster assessment
- Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons
- Local cuts for mixed-integer programming
- Constrained trace-optimization of polynomials in freely noncommuting variables
- Performance evaluation of multiobjective multiclass support vector machines maximizing geometric margins
- A branch-and-cut algorithm for solving mixed-integer semidefinite optimization problems
- Facial reduction algorithms for conic optimization problems
- An exact cutting plane algorithm to solve the selective graph coloring problem in perfect graphs
- High-Accuracy Semidefinite Programming Bounds for Kissing Numbers
- Learning sparse representations by non-negative matrix factorization and sequential cone programming
- Using diversification, communication and parallelism to solve mixed-integer linear programs
- Computational formulation of shakedown analysis as a conic quadratic optimization problem
- Optimal size of linear matrix inequalities in semidefinite approaches to polynomial optimization
- Solving large-scale semidefinite programs in parallel
- A computational study of a gradient-based log-barrier algorithm for a class of large-scale SDPs
- Basin hopping networks of continuous global optimization problems
- Best practices for comparing optimization algorithms
- Application of facial reduction to \(H_\infty\) state feedback control problem
- Branching rules revisited
- Free material optimization: recent progress†
- Scheduling a non-professional indoor football league: a tabu search based approach
- An independent benchmarking of SDP and SOCP solvers
- Upper bound limit analysis using simplex strain elements and second-order cone programming
- Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion
- complib
- CSDP
- SDPLIB
- Sdpsol
- SCIP
- SCIL
- ASYNPLEX
- SDPHA
- LFTB
- SDPA
- SCCP
- LIBOPT
- SeDuMi
- SDPT3
- MIPLIB
- UG
- testenv
- GloptiPoly
- SoPlex
- DSDP5
- PENNON
- Zimpl
- SparsePOP
- COL
- FEASPUMP
- QSopt_ex
- SMCP
- SDPLR
- OPALQP
- CLP
- SparseCoLO
- QSopt-Exact
- PENSDP
- CG+
- csminwel
This page was built for software: Benchmarks for Optimization Software
