The following pages link to Benchmarks for Optimization Software (Q16788):
Displaying 50 items.
- OSQP: An Operator Splitting Solver for Quadratic Programs (Q78613) (← links)
- An inexact smoothing method for SOCCPs based on a one-parametric class of smoothing function (Q279269) (← links)
- Integer programming techniques for the nurse rostering problem (Q284423) (← links)
- Support vector machines maximizing geometric margins for multi-class classification (Q287612) (← links)
- Conic optimization via operator splitting and homogeneous self-dual embedding (Q301735) (← links)
- Mixed integer programming models for job shop scheduling: A computational analysis (Q342439) (← links)
- Algorithmic aspects of sums of Hermitian squares of noncommutative polynomials (Q354616) (← links)
- A homotopy method for nonlinear semidefinite programming (Q360377) (← links)
- Facial reduction algorithms for conic optimization problems (Q368590) (← links)
- Second-order cone programming with warm start for elastoplastic analysis with von Mises yield criterion (Q400001) (← links)
- Every convex free basic semi-algebraic set has an LMI representation (Q456669) (← links)
- A polynomial primal-dual affine scaling algorithm for symmetric conic optimization (Q523579) (← links)
- An algebraic approach to integer portfolio problems (Q541725) (← links)
- Branching on general disjunctions (Q543420) (← links)
- Performance evaluation of multiobjective multiclass support vector machines maximizing geometric margins (Q550519) (← links)
- A convex relaxation bound for subgraph isomorphism (Q666533) (← links)
- A computational study of primal heuristics inside an MI(NL)P solver (Q683729) (← links)
- ZI round, a MIP rounding heuristic (Q707735) (← links)
- The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs (Q708779) (← links)
- A computational study of parametric tabu search for 0-1 mixed integer programs (Q709185) (← links)
- Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons (Q717135) (← links)
- SCIP: solving constraint integer programs (Q734351) (← links)
- A hybrid branch-and-bound approach for exact rational mixed-integer programming (Q744213) (← links)
- RENS. The optimal rounding (Q744216) (← links)
- On the robustness and scalability of semidefinite relaxation for optimal power flow problems (Q779755) (← links)
- Comparative assessment of algorithms and software for global optimization (Q813366) (← links)
- Integer-programming software systems (Q817202) (← links)
- Managing randomization in the multi-block alternating direction method of multipliers for quadratic optimization (Q823888) (← links)
- Moments and sums of squares for polynomial optimization and related problems (Q842714) (← links)
- On verified numerical computations in convex programming (Q849186) (← links)
- Two classes of merit functions for the second-order cone complementarity problem (Q857837) (← links)
- A boundary point method to solve semidefinite programs (Q858180) (← links)
- On the solution of large-scale SDP problems by the modified barrier method using iterative solvers (Q868465) (← links)
- Solving large-scale semidefinite programs in parallel (Q868469) (← links)
- Restoration of matrix fields by second-order cone programming (Q946475) (← links)
- A Max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO) (Q951124) (← links)
- A one-parametric class of merit functions for the second-order cone complementarity problem (Q967218) (← links)
- Towards a practical parallelisation of the simplex method (Q970132) (← links)
- Active-constraint variable ordering for faster feasibility of mixed integer linear programs (Q985305) (← links)
- Computational formulation of shakedown analysis as a conic quadratic optimization problem (Q986816) (← links)
- Erratum to: ``On the solution of large-scale SDP problems by the modified barrier method using iterative solvers'' (Q1016358) (← links)
- Feasibility pump 2.0 (Q1043854) (← links)
- An interior-point algorithm for nonconvex nonlinear programming (Q1294828) (← links)
- Applications of convex optimization in signal processing and digital communication (Q1403287) (← links)
- A computational study of a gradient-based log-barrier algorithm for a class of large-scale SDPs (Q1411645) (← links)
- An independent benchmarking of SDP and SOCP solvers (Q1411647) (← links)
- Basin hopping networks of continuous global optimization problems (Q1642814) (← links)
- Best practices for comparing optimization algorithms (Q1642983) (← links)
- Parallelizing the dual revised simplex method (Q1646685) (← links)
- Using diversification, communication and parallelism to solve mixed-integer linear programs (Q1667215) (← links)
