QPLIB: a library of quadratic programming instances (Q2281448)

scientific article

Language	Label	Description	Also known as
English	QPLIB: a library of quadratic programming instances	scientific article

Statements

instance of

scholarly article

0 references

title

QPLIB: a library of quadratic programming instances (English)

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

Nikolaos V. Sahinidis

0 references

0 references

0 references

0 references

0 references

Mathematical Programming Computation

0 references

publication date

19 December 2019

0 references

full work available at URL

https://basepub.dauphine.fr/handle/123456789/19154

0 references

zbMATH Keywords

instance library

0 references

quadratic programming

0 references

mixed integer quadratically constrained quadratic programming

0 references

binary quadratic programming

0 references

cites work

Ipopt

0 references

SCIP: solving constraint integer programs

0 references

Solving the Trust-Region Subproblem By a Generalized Eigenvalue Problem

0 references

A multi-commodity flow formulation for the generalized pooling problem

0 references

On implementing a primal-dual interior-point method for conic quadratic optimization

0 references

Q4496016

0 references

Global Approaches for Facility Layout and VLSI Floorplanning

0 references

Recent advances in the solution of quadratic assignment problems

0 references

The small hexagon and heptagon with maximum sum of distances between vertices

0 references

The small octagon with longest perimeter

0 references

Simple polygons of maximum perimeter contained in a unit disk

0 references

The largest small octagon

0 references

Maximal perimeter, diameter and area of equilateral unit-width convex polygons

0 references

Branching and bounds tighteningtechniques for non-convex MINLP

0 references

Quadratic Programming with Computer Programs

0 references

An efficient compact quadratic convex reformulation for general integer quadratic programs

0 references

Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method

0 references

Q2712822

0 references

On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines

0 references

Q3145799

0 references

An algorithmic framework for convex mixed integer nonlinear programs

0 references

On the optimal design of water distribution networks: a practical MINLP approach

0 references

Semidefinite relaxations for non-convex quadratic mixed-integer programming

0 references

Copositive Programming

0 references

The MILP Road to MIQCP

0 references

Q5493572

0 references

Perspective Reformulations of the CTA Problem with <i>L</i><sub>2</sub> Distances

0 references

A primal-dual trust-region algorithm for non-convex nonlinear programming

0 references

A tree-search algorithm for mixed integer programming problems

0 references

Valid Inequalities for the Pooling Problem with Binary Variables

0 references

Relaxing Nonconvex Quadratic Functions by Multiple Adaptive Diagonal Perturbations

0 references

Optimal quadratic programming algorithms. With applications to variational inequalities

0 references

CONOPT: A GRG code for large sparse dynamic nonlinear optimization problems

0 references

CONOPT—A Large-Scale GRG Code

0 references

An outer-approximation algorithm for a class of mixed-integer nonlinear programs

0 references

A Subspace Minimization Method for the Trust-Region Step

0 references

Stable reduced Hessian updates for indefinite quadratic programming

0 references

Approximated perspective relaxations: a project and lift approach

0 references

Delay-constrained shortest paths: approximation algorithms and second-order cone models

0 references

Delay-constrained routing problems: accurate scheduling models and admission control

0 references

Perspective cuts for a class of convex 0-1 mixed integer programs

0 references

SDP diagonalizations and perspective cuts for a class of nonseparable MIQP

0 references

A computational comparison of reformulations of the perspective relaxation: SOCP vs. cutting planes

0 references

Projected Perspective Reformulations with Applications in Design Problems

0 references

A New Algorithm for MINLP Applied to Gas Transport Energy Cost Minimization

0 references

The travelling salesman problem with neighbourhoods: MINLP solution

0 references

Object-oriented software for quadratic programming

0 references

SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization

0 references

SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization

0 references

Methods for convex and general quadratic programming

0 references

Towards globally optimal operation of water supply networks

0 references

Solving the Trust-Region Subproblem using the Lanczos Method

0 references

Trajectory-following methods for large-scale degenerate convex quadratic programming

0 references

GALAHAD, a library of thread-safe Fortran 90 packages for large-scale nonlinear optimization

0 references

A dual gradient-projection method for large-scale strictly convex quadratic problems

0 references

On solving trust-region and other regularised subproblems in optimization

0 references

An iterative working-set method for large-scale nonconvex quadratic programming

0 references

Minimizing a Quadratic Over a Sphere

0 references

A literature review on circle and sphere packing problems: models and methodologies

0 references

There Cannot be any Algorithm for Integer Programming with Quadratic Constraints

0 references

Q4464670

0 references

Cutting circles and polygons from area-minimizing rectangles

0 references

Cutting ellipses from area-minimizing rectangles

0 references

The unconstrained binary quadratic programming problem: a survey

0 references

Global optimization of bilinear programs with a multiparametric disaggregation technique

0 references

BiqCrunch

0 references

An Automatic Method of Solving Discrete Programming Problems

0 references

Decomposition strategy for the stochastic pooling problem

0 references

Global solution approach for a nonconvex MINLP problem in product portfolio optimization

0 references

The global solver in the LINDO API

0 references

A survey for the quadratic assignment problem

0 references

Solving long-term financial planning problems via global optimization

0 references

Q5306655

0 references

GLOMIQO: global mixed-integer quadratic optimizer

0 references

ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations

0 references

Large-scale linearly constrained optimization

0 references

A projected Lagrangian algorithm and its implementation for sparse nonlinear constraints

0 references

Complete search in continuous global optimization and constraint satisfaction

0 references

Global Optimization of the Scenario Generation and Portfolio Selection Problems

0 references

Q4353366

0 references

Q4945423

0 references

Column enumeration based decomposition techniques for a class of non-convex MINLP problems

0 references

Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations

0 references

A semidefinite framework for trust region subproblems with applications to large scale minimization

0 references

Portfolio optimization for wealth-dependent risk preferences

0 references

Exploiting vector space properties to strengthen the relaxation of bilinear programs arising in the global optimization of process networks

0 references

Large-scale standard pooling problems with constrained pools and fixed demands

0 references

Numerical solution of a time-optimal parabolic boundary-value control problem

0 references

Optimal Damping Control and Nonlinear Elliptic Systems

0 references

Global Optimization in Geometry — Circle Packing into the Square

0 references

Algorithms for an integer multicommodity network flow problem with node reliability considerations

0 references

Large-scale unit commitment under uncertainty

0 references

Q5807665

0 references

Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications

0 references

Global optimization of mixed-integer nonlinear programs: a theoretical and computational study

0 references

A polyhedral branch-and-cut approach to global optimization

0 references

Scatter Search and Local NLP Solvers: A Multistart Framework for Global Optimization

0 references

Quadratic programming is in NP

0 references

SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework

0 references

On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming

0 references

Solving pseudo-convex mixed integer optimization problems by cutting plane techniques

0 references

Q5691079

0 references

describes a project that uses

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

MaRDI publication profile

0 references

Identifiers

zbMATH Open document ID

1435.90099

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

10.1007/S12532-018-0147-4

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2281448