Benchmarks for Optimization Software

No author found.

Related Items (only showing first 100 items - show all)

Upper bound limit analysis using discontinuous quadratic displacement fields ⋮ Advances in the Parallelization of the Simplex Method ⋮ Detecting ``dense columns in interior point methods for linear programs ⋮ Computing in Operations Research Using Julia ⋮ Second-order cone programming approaches to static shakedown analysis in steel plasticity ⋮ Linear matrix inequalities in control systems with uncertainty ⋮ A Linear-Programming Approximation of AC Power Flows ⋮ Unnamed Item ⋮ The ‘Idiot’ crash quadratic penalty algorithm for linear programming and its application to linearizations of quadratic assignment problems ⋮ FiberSCIP—A Shared Memory Parallelization of SCIP ⋮ Constraint Integer Programming: A New Approach to Integrate CP and MIP ⋮ Permutations in the Factorization of Simplex Bases ⋮ On Handling Free Variables in Interior-Point Methods for Conic Linear Optimization ⋮ Simultaneous Higher-Order Optical Flow Estimation and Decomposition ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Heuristics of the Branch-Cut-and-Price-Framework SCIP ⋮ Algorithm 875 ⋮ Why Is Maximum Clique Often Easy in Practice? ⋮ Rigid plastic model of incremental sheet deformation using second-order cone programming ⋮ An Exact Rational Mixed-Integer Programming Solver ⋮ Rapid Learning for Binary Programs ⋮ High-Accuracy Semidefinite Programming Bounds for Kissing Numbers ⋮ Application of facial reduction to H _∞ state feedback control problem ⋮ Optimal Size of Linear Matrix Inequalities in Semidefinite Approaches to Polynomial Optimization ⋮ Assessment of a non-adaptive deterministic global optimization algorithm for problems with low-dimensional non-convex subspaces ⋮ Upper bound limit analysis using simplex strain elements and second-order cone programming ⋮ Intensity modulated radiotherapy treatment planning by use of a barrier-penalty multiplier method ⋮ A Newton-CG Augmented Lagrangian Method for Semidefinite Programming ⋮ Benchmarking optimization software with performance profiles. ⋮ Free material optimization: recent progress† ⋮ A robust algorithm for semidefinite programming ⋮ Machine Learning: ECML 2004 ⋮ Constrained trace-optimization of polynomials in freely noncommuting variables ⋮ The State-of-the-Art in Conic Optimization Software ⋮ PENNON: Software for Linear and Nonlinear Matrix Inequalities ⋮ Worst-case CVaR based portfolio optimization models with applications to scenario planning ⋮ A server for automated performance analysis of benchmarking data ⋮ Variational Methods for Denoising Matrix Fields ⋮ Computational enhancements in low-rank semidefinite programming ⋮ Algorithms – ESA 2005 ⋮ Projection methods for conic feasibility problems: applications to polynomial sum-of-squares decompositions ⋮ NCSOStools: a computer algebra system for symbolic and numerical computation with noncommutative polynomials ⋮ Multiobjective Multiclass Soft-Margin Support Vector Machine and Its Solving Technique Based on Benson’s Method ⋮ Variational, Geometric, and Level Set Methods in Computer Vision ⋮ Improving the accuracy of linear programming solvers with iterative refinement ⋮ Unnamed Item ⋮ Second-Order Cone Representation for Convex Sets in the Plane ⋮ An unconstrained smooth minimization reformulation of the second-order cone complementarity problem ⋮ Lower bound limit analysis of cohesive-frictional materials using second-order cone programming ⋮ AN EXTENSION OF THE ELIMINATION METHOD FOR A SPARSE SOS POLYNOMIAL(<Special Issue>SCOPE (Seminar on Computation and OPtimization for new Extensions)) ⋮ Solving Conic Optimization Problems via Self-Dual Embedding and Facial Reduction: A Unified Approach ⋮ The consultation timetabling problem at Danish high schools ⋮ Managing randomization in the multi-block alternating direction method of multipliers for quadratic optimization ⋮ Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT ⋮ An inexact smoothing method for SOCCPs based on a one-parametric class of smoothing function ⋮ Integer programming techniques for the nurse rostering problem ⋮ Support vector machines maximizing geometric margins for multi-class classification ⋮ Branching rules revisited ⋮ Interior point methods for second-order cone programming and OR applications ⋮ Conic optimization via operator splitting and homogeneous self-dual embedding ⋮ Moments and sums of squares for polynomial optimization and related problems ⋮ Improved constraint consensus methods for seeking feasibility in nonlinear programs ⋮ Basin hopping networks of continuous global optimization problems ⋮ On verified numerical computations in convex programming ⋮ Best practices for comparing optimization algorithms ⋮ Implementation of a primal-dual method for SDP on a shared memory parallel architecture ⋮ Parallelizing the dual revised simplex method ⋮ Two classes of merit functions for the second-order cone complementarity problem ⋮ A boundary point method to solve semidefinite programs ⋮ Mixed integer programming models for job shop scheduling: A computational analysis ⋮ Correlative sparsity structures and semidefinite relaxations for concave cost transportation problems with change of variables ⋮ Local cuts for mixed-integer programming ⋮ 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 ⋮ Solving large-scale semidefinite programs in parallel ⋮ A homotopy method for nonlinear semidefinite programming ⋮ Verifying integer programming results ⋮ Using diversification, communication and parallelism to solve mixed-integer linear programs ⋮ Facial reduction algorithms for conic optimization problems ⋮ Learning to steer nonlinear interior-point methods ⋮ 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 ⋮ Second-order cone programming with warm start for elastoplastic analysis with von Mises yield criterion ⋮ Convex quadratic relaxations for mixed-integer nonlinear programs in power systems ⋮ Applications of convex optimization in signal processing and digital communication ⋮ The tracial moment problem and trace-optimization of polynomials ⋮ On vector and matrix median computation ⋮ Domain reduction techniques for global NLP and MINLP optimization ⋮ SCIP-Jack -- a solver for STP and variants with parallelization extensions ⋮ A brief history of linear and mixed-integer programming computation ⋮ Maximum-weight stable sets and safe lower bounds for graph coloring ⋮ 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 ⋮ Every convex free basic semi-algebraic set has an LMI representation ⋮ Measuring the impact of primal heuristics ⋮ Benchmarking optimization software -- a (Hi)story ⋮ Optimization-based design of plant-friendly multisine signals using geometric discrepancy criteria ⋮ Semidefinite optimization models for limit and shakedown analysis problems involving matrix spreads ⋮ Bilevel cutting-plane algorithm for cardinality-constrained mean-CVaR portfolio optimization

This page was built for software: Benchmarks for Optimization Software