Nikos Kazazakis
  • Member for 2 years, 5 months
  • Last seen this week
4 answers
22 votes
3k views
2 bookmarks
Find feasible point in polynomial time in linear programming
1 answers
16 votes
1k views
1 bookmarks
IPOPT with HSL vs MUMPS
1 answers
13 votes
477 views
2 bookmarks
How to formulate a problem to prove/disprove convexity?
1 answers
12 votes
701 views
Which ML algorithms work by solving constrained optimisation problems?
2 answers
12 votes
183 views
1 bookmarks
Linearisation techniques for MINLPs
2 answers
11 votes
487 views
1 bookmarks
Dedicated solver for convex problems
0 answers
10 votes
99 views
Is there a library of infeasible MINLP problems?
0 answers
8 votes
91 views
1 bookmarks
Automatic detection of SOS variables and constraints
3 answers
7 votes
184 views
1 bookmarks
Ways to strengthen QCQP relaxations
1 answers
7 votes
778 views
Why is the Ellipsoid Method of polynomial complexity?
0 answers
6 votes
89 views
Benefits of removing slack variables during presolve
0 answers
5 votes
80 views
How to communicate number of integer combinations to a user
1 answers
4 votes
226 views
Algorithms for sparse linear systems
1 answers
2 votes
126 views
How to detect unbounded problems