Benchmarks for Optimization Software

swMATH4617MaRDI QIDQ16788FDOQ16788

Author name not available (Why is that?)

Cited In (only showing first 100 items - show all)

• On Handling Free Variables in Interior-Point Methods for Conic Linear Optimization
• PAVER 2.0: an open source environment for automated performance analysis of benchmarking data
• The tracial moment problem and trace-optimization of polynomials
• Variational Methods for Denoising Matrix Fields
• Sieve-SDP: a simple facial reduction algorithm to preprocess semidefinite programs
• The optimization test environment
• An interior-point algorithm for nonconvex nonlinear programming
• A Newton-CG augmented Lagrangian method for semidefinite programming
• Machine Learning: ECML 2004
• An extension of the elimination method for a sparse SOS polynomial
• Computational enhancements in low-rank semidefinite programming
• Lower bound limit analysis of cohesive-frictional materials using second-order cone programming
• NCSOStools: a computer algebra system for symbolic and numerical computation with noncommutative polynomials
• An inexact smoothing method for SOCCPs based on a one-parametric class of smoothing function
• Integer programming techniques for the nurse rostering problem
• Feasibility pump 2.0
• Every convex free basic semi-algebraic set has an LMI representation
• Integer-programming software systems
• Support vector machines maximizing geometric margins for multi-class classification
• A boundary point method to solve semidefinite programs
• Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons
• A branch-and-cut algorithm for solving mixed-integer semidefinite optimization problems
• Performance evaluation of multiobjective multiclass support vector machines maximizing geometric margins
• Facial reduction algorithms for conic optimization problems
• Learning sparse representations by non-negative matrix factorization and sequential cone programming
• Using diversification, communication and parallelism to solve mixed-integer linear programs
• A computational study of a gradient-based log-barrier algorithm for a class of large-scale SDPs
• Branching rules revisited
• Free material optimization: recent progress†
• Upper bound limit analysis using simplex strain elements and second-order cone programming
• An independent benchmarking of SDP and SOCP solvers
• Branching on general disjunctions
• Constraint Integer Programming: A New Approach to Integrate CP and MIP
• FiberSCIP—A Shared Memory Parallelization of SCIP
• Detecting ``dense columns in interior point methods for linear programs
• A brief history of linear and mixed-integer programming computation
• Measuring the impact of primal heuristics
• A feasibility pump heuristic for general mixed-integer problems
• Conflict analysis in mixed integer programming
• Improving the feasibility pump
• Multiobjective multiclass soft-margin support vector machine and its solving technique based on Benson's method
• OSQP: an operator splitting solver for quadratic programs
• Variational methods with higher-order derivatives in image processing
• RENS. The optimal rounding
• Moments and sums of squares for polynomial optimization and related problems
• An algebraic approach to integer portfolio problems
• A new library of structured semidefinite programming instances
• Mixed integer programming models for job shop scheduling: A computational analysis
• Restoration of matrix fields by second-order cone programming
• Towards a practical parallelisation of the simplex method
• An unconstrained smooth minimization reformulation of the second-order cone complementarity problem
• Solving conic optimization problems via self-dual embedding and facial reduction: A unified approach
• ZI round, a MIP rounding heuristic
• Active-constraint variable ordering for faster feasibility of mixed integer linear programs
• Second-order cone programming with warm start for elastoplastic analysis with von Mises yield criterion
• SCIP: solving constraint integer programs
• The consultation timetabling problem at Danish high schools
• Maximum-weight stable sets and safe lower bounds for graph coloring
• Algorithmic aspects of sums of Hermitian squares of noncommutative polynomials
• On the solution of large-scale SDP problems by the modified barrier method using iterative solvers
• Conic optimization via operator splitting and homogeneous self-dual embedding
• A Max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO)
• Second-Order Cone Representation for Convex Sets in the Plane
• A homotopy method for nonlinear semidefinite programming
• Benchmarking optimization software with performance profiles.
• Applications of convex optimization in signal processing and digital communication
• A linear-programming approximation of AC power flows
• Two classes of merit functions for the second-order cone complementarity problem
• An exact rational mixed-integer programming solver
• Heuristics of the branch-cut-and-price-framework SCIP
• The interplay of optimization and machine learning research
• A one-parametric class of merit functions for the second-order cone complementarity problem
• Interior point methods for second-order cone programming and OR applications
• SCIP-Jack -- a solver for STP and variants with parallelization extensions
• Correlative sparsity structures and semidefinite relaxations for concave cost transportation problems with change of variables
• SpeeDP: an algorithm to compute SDP bounds for very large max-cut instances
• Comparative assessment of algorithms and software for global optimization
• Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone
• MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library
• Computing in operations research using Julia
• 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
• A robust algorithm for semidefinite programming
• Assessment of a non-adaptive deterministic global optimization algorithm for problems with low-dimensional non-convex subspaces
• Optimal Size of Linear Matrix Inequalities in Semidefinite Approaches to Polynomial Optimization
• A computational study of primal heuristics inside an MI(NL)P solver
• The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs
• Improving the accuracy of linear programming solvers with iterative refinement
• Advances in the parallelization of the simplex method
• Benchmarking optimization software -- a (Hi)story
• Semidefinite optimization models for limit and shakedown analysis problems involving matrix spreads
• Algorithm 875
• On verified numerical computations in convex programming
• A computational study of parametric tabu search for 0-1 mixed integer programs
• Second-order cone programming approaches to static shakedown analysis in steel plasticity
• How to generate weakly infeasible semidefinite programs via Lasserre's relaxations for polynomial optimization
• Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT
• Algorithms – ESA 2005
• Rapid learning for binary programs
• Conditions for error bounds and bounded level sets of some merit functions for the second-order cone complementarity problem

This page was built for software: Benchmarks for Optimization Software