HackerReposA FIELD GUIDE TO OPEN SOURCE
ProSponsor the shelf♧ 0
← Back to top all-time
YimingYAN
QP-Test-Problems
MATLAB2017–2017
YimingYAN / QP-Test-Problems · Archived

QP-Test-Problems

Maros and Meszaros Convex QP test problems in MAT format

2Distinct people
2Mentions
0Explicit recommenders
14GitHub stars
REPOSITORY AT A GLANCE

What to know before exploring

What it is

Maros and Meszaros Convex QP test problems in MAT format

GitHub

Where it is used

No documented product use has been verified yet.

What people are saying

No recommendation phrase was found in the indexed comments.

No classified warning is attached to this page. Read the discussions before treating silence as approval.

Also in these discussions

Mentioned in the same Hacker News threads. That is not proof they are substitutes.

This week on Hacker News

Nov 8–Nov 15 UTC · Direct repository links and separately labeled related project stories. Indexed through 11/15/2026, 5:58:02 AM UTC.

No direct repository links were found in the indexed HN discussions over the past seven days. Older discussions are available below.

Mentions over time

HN mentions by hour2 dated mentions

Observed mentions: 2017-11-27 16:38:33 UTC to 2017-11-28 01:47:29 UTC.

012017-11-27 16:00:00 UTC to 2017-11-27 17:00:00 UTC (exclusive): 1 mentions; 0 submissions, 1 commentsNov 27, 16:002017-11-27 17:00:00 UTC to 2017-11-27 18:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2017-11-27 18:00:00 UTC to 2017-11-27 19:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2017-11-27 19:00:00 UTC to 2017-11-27 20:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2017-11-27 20:00:00 UTC to 2017-11-27 21:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 commentsNov 27, 20:002017-11-27 21:00:00 UTC to 2017-11-27 22:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2017-11-27 22:00:00 UTC to 2017-11-27 23:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2017-11-27 23:00:00 UTC to 2017-11-28 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2017-11-28 00:00:00 UTC to 2017-11-28 01:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2017-11-28 01:00:00 UTC to 2017-11-28 02:00:00 UTC (exclusive): 1 mentions; 0 submissions, 1 commentsNov 28, 01:00

Counts come from the repository’s dated source evidence. Index cutoff: 2026-11-02 08:16:59 UTC.

View mention counts and date ranges
UTC ranges include their start and exclude their end. Select a period to filter the source evidence.
PeriodStart (UTC)End (exclusive, UTC)MentionsSubmissionsComments
Nov 27, 16:002017-11-27 16:00:00 UTC2017-11-27 17:00:00 UTC101
Nov 27, 17:002017-11-27 17:00:00 UTC2017-11-27 18:00:00 UTC000
Nov 27, 18:002017-11-27 18:00:00 UTC2017-11-27 19:00:00 UTC000
Nov 27, 19:002017-11-27 19:00:00 UTC2017-11-27 20:00:00 UTC000
Nov 27, 20:002017-11-27 20:00:00 UTC2017-11-27 21:00:00 UTC000
Nov 27, 21:002017-11-27 21:00:00 UTC2017-11-27 22:00:00 UTC000
Nov 27, 22:002017-11-27 22:00:00 UTC2017-11-27 23:00:00 UTC000
Nov 27, 23:002017-11-27 23:00:00 UTC2017-11-28 00:00:00 UTC000
Nov 28, 00:002017-11-28 00:00:00 UTC2017-11-28 01:00:00 UTC000
Nov 28, 01:002017-11-28 01:00:00 UTC2017-11-28 02:00:00 UTC101

What Hacker News says

1 sources
We compared our OSQP solver to other general-purpose solvers. That's why we chose GUROBI and Mosek. There are also examples of control problems for which it is possible to design very efficient tailored methods. However our point is not to compare our solver to specific methods for certain classes (like libsvm). In the benchmarks we are comparing examples with randomly generated data because we were interested in ~1400 problems in a range from 100 to 10 million nonzeros. The examples are not just random QPs, but data are generated in a reasonable manner and they have the same structure as problems people would actually solve in practice. In the arXiv paper we described in detail how we generated and checked optimality for the examples. As mentioned in the README of the repository that you checked out (https://github.com/oxfordcontrol/osqp
Read the rest
_benchmarks) we used the conversion scripts from here: https://github.com/YimingYAN/QP-Test-Problems If you know better ways to convert the Maros problems (or other QP/LP benchmarks) to mat files or other formats compatible with Python, please let me know. I would be happy to try them.
In Show HN: OSQP: a new first-order solver for large-scale quadratic programs

MAKE YOURSELF AT HOME

A few shortcuts

/
Search the collection
?
Open this guide
Esc
Close dialogs and navigation

Your saved repositories and interests stay in this browser.