Eric Hanson

Good point about the dependency. The name checking code actually isn’t super light because it uses various not-totally-trivial distance measures. The code in RegistryCI uses VisualStringDistances (which uses UnbalancedOptimalTransport and...

Ah, it's some kind of macro escaping issue: ```julia julia> _one(x) = exactly(1, x) _one (generic function with 1 method) julia> find_graphics_with_arg = @compile _one("\\includegraphics[") * capture(zero_or_more(NON_LINEBREAK)) * _one("]{") *...

> Although, your actual issue is different :) Because you are trying to define a convenience function which you don't need. exactly(1, x) is equivalent to just concatenating a string...

Relatedly (and also kind of related to #44) I think it would be nice to have an `OptimizationResults` type that gets returned that would hold onto the problem data along...

the current docs are kind of centered around the constructor functions rather than the structs, since usually users should use the former. I think though it definitely is nice to...

I like it! IMO not too verbose. In fact I think the reformulations could be more verbose. I think the examples are quite useful, and I like the mini table...

true, and we have done that in the past (though often the other way, deleting slow or buggy atoms in favor of reformulations)

hm, interesting. Some thoughts * I agree with merging number of dense elements and sparse to just number of coefficients * I agree with deferring MOI stuff to MOI. Could...

I think ```julia julia> problem summary ├─ # variables : 1 (1_000 scalar elements) ├─ # constraints : 1_000 (1_000 scalar elements) ├─ # coefficients : 1000 ├─ # atoms...

what about something more distinct from the tree printing? ```julia julia> p = minimize(nuclearnorm(y), y == A) ┌──────────────┬────────────────────────┐ │ variables │ 1 (24 scalar elements) │ │ constraints │ 1...