Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Introducing the Convex.jl Problem Depot #328

Merged
merged 12 commits into from
Oct 28, 2019
6 changes: 3 additions & 3 deletions LICENSE.md
Original file line number Diff line number Diff line change
Expand Up @@ -24,9 +24,9 @@ The Convex.jl package is licensed under the Simplified "2-clause" BSD License:
> (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
> OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
The file benchmark/benchmarks/benchmark.jl contains some utilities copied
from the MathOptInterface.jl package (https://github.com/JuliaOpt/MathOptInterface.jl)
which is licensed under the MIT License:
The file src/problem_depot/problem_depot.jl contains some utilities copied from
the MathOptInterface.jl package (https://github.com/JuliaOpt/MathOptInterface.jl)
which is licensed under the following MIT License:

>Copyright (c) 2017: Miles Lubin and contributors Copyright (c) 2017: Google Inc.
>
Expand Down
2 changes: 2 additions & 0 deletions Project.toml
Original file line number Diff line number Diff line change
Expand Up @@ -4,10 +4,12 @@ version = "0.12.5"

[deps]
AbstractTrees = "1520ce14-60c1-5f80-bbc7-55ef81b5835c"
BenchmarkTools = "6e4b80f9-dd63-53aa-95a3-0cdb28fa8baf"
LinearAlgebra = "37e2e46d-f89d-539d-b4ee-838fcccc9c8e"
MathProgBase = "fdba3010-5040-5b88-9595-932c9decdf73"
OrderedCollections = "bac558e1-5e72-5ebc-8fee-abe8a469f55d"
SparseArrays = "2f01184e-e22b-5df5-ae63-d93ebab69eaf"
Test = "8dfed614-e22c-5e08-85e1-65c5234f0b40"

[compat]
AbstractTrees = "^0.2.1"
Expand Down
32 changes: 22 additions & 10 deletions benchmark/benchmarks.jl
Original file line number Diff line number Diff line change
Expand Up @@ -2,20 +2,32 @@ using Pkg
tempdir = mktempdir()
Pkg.activate(tempdir)
Pkg.develop(PackageSpec(path=joinpath(@__DIR__, "..")))
Pkg.add(["BenchmarkTools", "SCS", "ECOS", "PkgBenchmark"])
Pkg.add(["BenchmarkTools", "PkgBenchmark"])
Pkg.resolve()

using Convex: Convex
using SCS: SCSSolver
using ECOS: ECOSSolver
using Convex: Convex, ProblemDepot
using BenchmarkTools


include("benchmarks/benchmarks.jl") # defines module Benchmarks

const SUITE = BenchmarkGroup()

SUITE["SCS"] = Benchmarks.suite(p -> Convex.solve!(p, SCSSolver(verbose=0)))
SUITE["ECOS"] = Benchmarks.suite(p -> Convex.solve!(p, ECOSSolver(verbose=0));
exclude = [r"sdp", r"SDP"])
SUITE["formulation"] = Benchmarks.suite(Convex.conic_problem)
problems = [
"constant_fix!_with_complex_numbers",
"affine_dot_multiply_atom",
"affine_hcat_atom",
"affine_trace_atom",
"exp_entropy_atom",
"exp_log_perspective_atom",
"socp_norm_2_atom",
"socp_quad_form_atom",
"socp_sum_squares_atom",
"lp_norm_inf_atom",
"lp_maximum_atom",
"sdp_and_exp_log_det_atom",
"sdp_norm2_atom",
"sdp_lambda_min_atom",
"sdp_sum_largest_eigs",
"mip_integer_variables",
]

SUITE["formulation"] = ProblemDepot.benchmark_suite(Convex.conic_problem, problems)
164 changes: 0 additions & 164 deletions benchmark/benchmarks/affine_benchmarks.jl

This file was deleted.

56 changes: 0 additions & 56 deletions benchmark/benchmarks/benchmarks.jl

This file was deleted.

58 changes: 0 additions & 58 deletions benchmark/benchmarks/sdp_benchmarks.jl

This file was deleted.

1 change: 1 addition & 0 deletions docs/make.jl
Original file line number Diff line number Diff line change
Expand Up @@ -15,6 +15,7 @@ makedocs(;
"FAQ" => "faq.md",
"Optimizing in a Loop" => "loop.md",
"Advanced" => "advanced.md",
"Problem Depot" => "problem_depot.md",
"Contributing" => "contributing.md",
"Credits" => "credits.md"
],
Expand Down
Loading