Update http to https and broken websites update (#2346)

* http -> https + broken websites update

* Update jump-logo-with-text.svg

* Update jump-logo-with-text.svg

* Undo changes

LICENSE.md

@@ -363,7 +363,7 @@ The JuMP Julia module is licensed under the **[MPL]** version 2.0:
 
       This Source Code Form is subject to the terms of the Mozilla Public
       License, v. 2.0. If a copy of the MPL was not distributed with this
-      file, You can obtain one at http://mozilla.org/MPL/2.0/.
+      file, You can obtain one at https://mozilla.org/MPL/2.0/.
 
     If it is not possible or desirable to put the notice in a particular
     file, then You may include the notice in a location (such as a LICENSE

NEWS.md

@@ -192,10 +192,10 @@ Breaking changes:
   [MathProgBase](https://github.com/JuliaOpt/MathProgBase.jl) (MPB) to
   [MathOptInterface](https://github.com/JuliaOpt/MathOptInterface.jl)
   (MOI). MOI addresses many longstanding design issues. (See @mlubin's
-  [slides](http://www.juliaopt.org/meetings/bordeaux2018/lubin.pdf) from
+  [slides](https://www.juliaopt.org/meetings/bordeaux2018/lubin.pdf) from
   JuMP-dev 2018.) JuMP 0.19 is compatible only with solvers that have been
   updated for MOI. See the
-  [installation guide](http://www.juliaopt.org/JuMP.jl/dev/installation/)
+  [installation guide](https://www.juliaopt.org/JuMP.jl/dev/installation/)
   for a list of solvers that have and have not yet been updated.
 
 - Most solvers have been renamed to `PackageName.Optimizer`. For example,
@@ -209,12 +209,12 @@ Breaking changes:
   rewritten (inspired by `AxisArrays`) and renamed `Containers.DenseAxisArray`,
   and you can now request a container type with the `container=` keyword to the
   macros. See the corresponding
-  [documentation](http://www.juliaopt.org/JuMP.jl/dev/variables/#Variable-containers-1)
+  [documentation](https://www.juliaopt.org/JuMP.jl/dev/variables/#Variable-containers-1)
   for more details.
 
 - The statuses returned by solvers have changed. See the possible status
   values
-  [here](http://www.juliaopt.org/MathOptInterface.jl/stable/apireference.html#Termination-Status-1).
+  [here](https://www.juliaopt.org/MathOptInterface.jl/stable/apireference.html#Termination-Status-1).
   The MOI statuses are much richer than the MPB statuses and can be used to
   distinguish between previously indistinguishable cases (e.g. did the solver
   have a feasible solution when it stopped because of the time limit?).
@@ -253,7 +253,7 @@ Breaking changes:
 
 - The sign conventions for duals has changed in some cases for consistency with
   conic duality (see the
-  [documentation](http://www.juliaopt.org/MathOptInterface.jl/v0.6.2/apimanual.html#Duals-1)).
+  [documentation](https://www.juliaopt.org/MathOptInterface.jl/v0.6.2/apimanual.html#Duals-1)).
   The `shadow_price` helper method returns duals with signs that match
   conventional LP interpretations of dual values as sensitivities of the
   objective value to relaxations of constraints.
@@ -270,7 +270,7 @@ Breaking changes:
 - The `lowerbound`, `upperbound`, and `basename` keyword arguments to the `@variable`
   macro have been renamed to `lower_bound`, `upper_bound`, and `base_name`,
   for consistency with JuMP's new
-  [style recommendations](http://www.juliaopt.org/JuMP.jl/dev/style/).
+  [style recommendations](https://www.juliaopt.org/JuMP.jl/dev/style/).
 
 - We rely on broadcasting syntax to apply accessors to collections of
   variables, e.g., `value.(x)` instead of `getvalue(x)` for collections. (Use
@@ -308,7 +308,7 @@ New features:
 
 - Direct mode and manual mode provide explicit control over when copies of a
   model are stored and/or regenerated. See the corresponding
-  [documentation](http://www.juliaopt.org/JuMP.jl/dev/solvers/).
+  [documentation](https://www.juliaopt.org/JuMP.jl/dev/solvers/).
 
 There are known regressions from JuMP 0.18 that will be addressed in a future
 release (0.19.x or later):

README.md

@@ -1,7 +1,7 @@
 ![JuMP logo](https://www.juliaopt.org/images/jump-logo-with-text.svg "JuMP logo")
 ---
 
-[![Powered by NumFOCUS](https://img.shields.io/badge/powered%20by-NumFOCUS-orange.svg?style=flat&colorA=E1523D&colorB=007D8A)](http://numfocus.org)
+[![Powered by NumFOCUS](https://img.shields.io/badge/powered%20by-NumFOCUS-orange.svg?style=flat&colorA=E1523D&colorB=007D8A)](https://numfocus.org)
 
 JuMP is a domain-specific modeling language for **[mathematical optimization]**
 embedded in **[Julia]**. It currently supports a number of open-source and
@@ -12,9 +12,9 @@ commercial solvers ([Artelys Knitro], [BARON], [Bonmin], [Cbc], [CDCS], [CDD],
 **[linear programming]**, **[(mixed) integer programming]**,
 **[second-order conic programming]**, **[semidefinite programming]**, and **[nonlinear programming]**.
 
-[mathematical optimization]: http://en.wikipedia.org/wiki/Mathematical_optimization
-[Julia]: http://julialang.org/
-[Artelys Knitro]: http://artelys.com/en/optimization-tools/knitro
+[mathematical optimization]: https://en.wikipedia.org/wiki/Mathematical_optimization
+[Julia]: https://julialang.org/
+[Artelys Knitro]: https://artelys.com/en/optimization-tools/knitro
 [BARON]: http://archimedes.cheme.cmu.edu/?q=baron
 [Bonmin]: https://projects.coin-or.org/Bonmin
 [Cbc]: https://github.com/coin-or/Cbc
@@ -23,16 +23,16 @@ commercial solvers ([Artelys Knitro], [BARON], [Bonmin], [Cbc], [CDCS], [CDD],
 [Clp]: https://github.com/coin-or/Clp
 [COSMO]: https://github.com/oxfordcontrol/COSMO.jl
 [Couenne]: https://projects.coin-or.org/Couenne
-[CPLEX]: http://www-01.ibm.com/software/commerce/optimization/cplex-optimizer/
+[CPLEX]: https://www.ibm.com/analytics/cplex-optimizer
 [CSDP]: https://projects.coin-or.org/Csdp/
 [ECOS]: https://github.com/ifa-ethz/ecos
-[FICO Xpress]: http://www.fico.com/en/products/fico-xpress-optimization-suite
+[FICO Xpress]: https://www.fico.com/en/products/fico-xpress-optimization-suite
 [GLPK]: http://www.gnu.org/software/glpk/
-[Gurobi]: http://www.gurobi.com/
+[Gurobi]: https://www.gurobi.com/
 [Ipopt]: https://github.com/coin-or/Ipopt
 [Juniper]: https://github.com/lanl-ansi/Juniper.jl
-[MOSEK]: http://mosek.com/
-[NLopt]: http://ab-initio.mit.edu/wiki/index.php/NLopt
+[MOSEK]: https://mosek.com/
+[NLopt]: https://nlopt.readthedocs.io/en/latest/
 [OSQP]: https://osqp.org/
 [ProxSDP]: https://github.com/mariohsouto/ProxSDP.jl
 [SCIP]: https://scip.zib.de/
@@ -41,11 +41,11 @@ commercial solvers ([Artelys Knitro], [BARON], [Bonmin], [Cbc], [CDCS], [CDD],
 [SDPT3]: https://blog.nus.edu.sg/mattohkc/softwares/sdpt3/
 [SeDuMi]: http://sedumi.ie.lehigh.edu/
 [Tulip]: https://github.com/ds4dm/Tulip.jl
-[linear programming]: http://en.wikipedia.org/wiki/Linear_programming
-[(mixed) integer programming]: http://en.wikipedia.org/wiki/Integer_programming
-[second-order conic programming]: http://en.wikipedia.org/wiki/Second-order_cone_programming
+[linear programming]: https://en.wikipedia.org/wiki/Linear_programming
+[(mixed) integer programming]: https://en.wikipedia.org/wiki/Integer_programming
+[second-order conic programming]: https://en.wikipedia.org/wiki/Second-order_cone_programming
 [semidefinite programming]: https://en.wikipedia.org/wiki/Semidefinite_programming
-[nonlinear programming]: http://en.wikipedia.org/wiki/Nonlinear_programming
+[nonlinear programming]: https://en.wikipedia.org/wiki/Nonlinear_programming
 
 JuMP makes it easy to specify and **solve optimization problems without expert knowledge**, yet at the same time allows experts to implement advanced algorithmic techniques such as exploiting efficient hot-starts in linear programming or using callbacks to interact with branch-and-bound solvers. JuMP is also **fast** - benchmarking has shown that it can create problems at similar speeds to special-purpose commercial tools such as AMPL while maintaining the expressiveness of a generic high-level programming language. JuMP can be easily embedded in complex work flows including simulations and web servers.
 
@@ -57,14 +57,14 @@ Our documentation includes an installation guide, quick-start guide, and referen
 a list of the significant breaking changes in the JuMP 0.19 release.**
 
 **Latest Release**: 0.21.5 (`release-0.21` branch)
-  * [Documentation](http://jump.dev/JuMP.jl/v0.21.5/)
+  * [Documentation](https://jump.dev/JuMP.jl/v0.21.5/)
   * [Examples](https://github.com/jump-dev/JuMP.jl/tree/release-0.21/examples)
   * Testing status:
     * TravisCI: [![Build Status](https://travis-ci.com/jump-dev/JuMP.jl.svg?branch=release-0.21)](https://travis-ci.org/JuliaOpt/JuMP.jl)
 
 
 **Development version** (`master` branch):
-  * [Documentation](http://jump.dev/JuMP.jl/dev/)
+  * [Documentation](https://jump.dev/JuMP.jl/dev/)
   * [Examples](https://github.com/jump-dev/JuMP.jl/tree/master/examples)
   * Testing status:
     * TravisCI: [![Build Status](https://travis-ci.com/jump-dev/JuMP.jl.svg?branch=master)](https://travis-ci.org/JuliaOpt/JuMP.jl)
@@ -138,7 +138,7 @@ If you find JuMP useful in your work, we kindly request that you cite the follow
 }
 ```
 
-For an earlier work where we presented a prototype implementation of JuMP, see [here](http://dx.doi.org/10.1287/ijoc.2014.0623):
+For an earlier work where we presented a prototype implementation of JuMP, see [here](https://dx.doi.org/10.1287/ijoc.2014.0623):
 
 ```bibtex
 @article{LubinDunningIJOC,
@@ -153,11 +153,11 @@ For an earlier work where we presented a prototype implementation of JuMP, see [
 }
 ```
 
-A preprint of this paper is [freely available](http://arxiv.org/abs/1312.1431).
+A preprint of this paper is [freely available](https://arxiv.org/abs/1312.1431).
 
 ---
 
-![NumFOCUS logo](http://jump.dev/JuMP.jl/dev/assets/numfocus-logo.png)
+![NumFOCUS logo](https://jump.dev/JuMP.jl/dev/assets/numfocus-logo.png)
 
 JuMP is a Sponsored Project of NumFOCUS, a 501(c)(3) nonprofit charity in the
 United States. NumFOCUS provides JuMP with fiscal, legal, and administrative

docs/src/callbacks.md

@@ -57,7 +57,7 @@ explicitly include in the initial formulation. When a MIP solver reaches a new
 solution, for example with a heuristic or by solving a problem at a node in
 the branch-and-bound tree, it will give the user the chance to provide
 constraint(s) that would make the current solution infeasible. For some more
-information about lazy constraints, see this [blog post by Paul Rubin](http://orinanobworld.blogspot.com/2012/08/user-cuts-versus-lazy-constraints.html).
+information about lazy constraints, see this [blog post by Paul Rubin](https://orinanobworld.blogspot.com/2012/08/user-cuts-versus-lazy-constraints.html).
 
 A lazy constraint callback can be set using the following syntax:
 
@@ -89,7 +89,7 @@ solver reaches a new node in the branch-and-bound tree, it will give the user
 the chance to provide cuts to make the current relaxed (fractional) solution
 infeasible in the hopes of obtaining an integer solution. For more details
 about the difference between user cuts and lazy constraints see the
-aforementioned [blog post](http://orinanobworld.blogspot.com/2012/08/user-cuts-versus-lazy-constraints.html).
+aforementioned [blog post](https://orinanobworld.blogspot.com/2012/08/user-cuts-versus-lazy-constraints.html).
 
 A user-cut callback can be set using the following syntax:
 

docs/src/constraints.md

@@ -123,7 +123,7 @@ Subject to
 
 ## [Duality](@id constraint_duality)
 
-JuMP adopts the notion of [conic duality from MOI](http://jump.dev/MathOptInterface.jl/v0.9.1/apimanual/#Duals-1).
+JuMP adopts the notion of [conic duality from MOI](https://jump.dev/MathOptInterface.jl/v0.9.1/apimanual/#Duals-1).
 For linear programs, a feasible dual on a `>=` constraint is nonnegative and a
 feasible dual on a `<=` constraint is nonpositive. If the constraint is an
 equality constraint, it depends on which direction is binding.
@@ -365,13 +365,13 @@ julia> @constraint(model, A * x - b in MOI.Nonnegatives(2))
 
 In addition to the `Nonnegatives` set, MOI defines a number of
 other vector-valued sets such as `Nonpositives`. See the
-[MOI documentation](http://jump.dev/MathOptInterface.jl/v0.9.1/apireference/#Sets-1)
+[MOI documentation](https://jump.dev/MathOptInterface.jl/v0.9.1/apireference/#Sets-1)
 for more information.
 
 Note also that for the first time we have used an explicit *function-in-set*
 description of the constraint. Read more about this representation for
 constraints in the
-[MOI documentation](http://jump.dev/MathOptInterface.jl/v0.9.1/apimanual/#Constraints-by-function-set-pairs-1).
+[MOI documentation](https://jump.dev/MathOptInterface.jl/v0.9.1/apimanual/#Constraints-by-function-set-pairs-1).
 
 ## Constraints on a single variable
 
@@ -455,7 +455,7 @@ julia> @constraint(model, [t, u, x[1], x[2]] in RotatedSecondOrderCone())
 
 In addition to the second order cone and rotated second order cone,
 MOI defines a number of other conic sets such as the exponential
-and power cones. See the [MathOptInterface documentation](http://jump.dev/MathOptInterface.jl/v0.9.1/apireference/#Sets-1)
+and power cones. See the [MathOptInterface documentation](https://jump.dev/MathOptInterface.jl/v0.9.1/apireference/#Sets-1)
 for more information.
 
 ## Constraints on a collection of variables

docs/src/extensions.md

@@ -22,7 +22,7 @@ Extending JuMP
 # TODO: create new bridge
 ```
 
-See the [bridge section in the MOI manual](http://jump.dev/MathOptInterface.jl/v0.9.1/apimanual/#Automatic-reformulation-1).
+See the [bridge section in the MOI manual](https://jump.dev/MathOptInterface.jl/v0.9.1/apimanual/#Automatic-reformulation-1).
 
 ```@docs
 add_bridge

docs/src/index.md

@@ -1,7 +1,7 @@
 ![JuMP logo](assets/jump-logo-with-text.svg)
 ===
 
-[![Powered by NumFOCUS](https://img.shields.io/badge/powered%20by-NumFOCUS-orange.svg?style=flat&colorA=E1523D&colorB=007D8A)](http://numfocus.org)
+[![Powered by NumFOCUS](https://img.shields.io/badge/powered%20by-NumFOCUS-orange.svg?style=flat&colorA=E1523D&colorB=007D8A)](https://numfocus.org)
 
 ```@meta
 # These comments do not display in the HTML output.
@@ -17,12 +17,12 @@
     a comprehensive list of changes between the two versions, many of which
     are breaking. This documentation is for JuMP/MathOptInterface.
     For the documentation of JuMP 0.18, see
-    [here](http://jump.dev/JuMP.jl/0.18/).
+    [here](https://jump.dev/JuMP.jl/0.18/).
 
 [JuMP](https://github.com/jump-dev/JuMP.jl) is a domain-specific modeling
 language for [mathematical
-optimization](http://en.wikipedia.org/wiki/Mathematical_optimization) embedded
-in [Julia](http://julialang.org/). It currently supports a number of open-source
+optimization](https://en.wikipedia.org/wiki/Mathematical_optimization) embedded
+in [Julia](https://julialang.org/). It currently supports a number of open-source
 and commercial solvers (see below) for a variety of problem classes, including
 **linear programming**, **mixed-integer programming**, **second-order conic
 programming**, **semidefinite programming**, and **nonlinear programming**.
@@ -34,7 +34,7 @@ JuMP's features include:
 -   Speed
     -   Benchmarking has shown that JuMP can create problems at similar speeds
         to special-purpose modeling languages such as
-        [AMPL](http://www.ampl.com/).
+        [AMPL](https://ampl.com/).
     -   JuMP communicates with most solvers in memory, avoiding the need to
         write intermediary files.
 -   Solver independence
@@ -43,19 +43,19 @@ JuMP's features include:
         package, making it easy to change between a number of open-source and
         commercial optimization software packages ("solvers").
     -   Currently supported solvers include
-        [Artelys Knitro](http://artelys.com/en/optimization-tools/knitro),
+        [Artelys Knitro](https://artelys.com/en/optimization-tools/knitro),
         [Bonmin](https://projects.coin-or.org/Bonmin),
         [Cbc](https://projects.coin-or.org/Cbc),
         [Clp](https://projects.coin-or.org/Clp),
         [Couenne](https://projects.coin-or.org/Couenne),
-        [CPLEX](http://www-01.ibm.com/software/commerce/optimization/cplex-optimizer/),
+        [CPLEX](https://www.ibm.com/analytics/cplex-optimizer),
         [ECOS](https://github.com/ifa-ethz/ecos),
-        [FICO Xpress](http://www.fico.com/en/products/fico-xpress-optimization-suite),
+        [FICO Xpress](https://www.fico.com/en/products/fico-xpress-optimization-suite),
         [GLPK](http://www.gnu.org/software/glpk/),
-        [Gurobi](http://www.gurobi.com),
+        [Gurobi](https://www.gurobi.com),
         [Ipopt](https://projects.coin-or.org/Ipopt),
-        [MOSEK](http://www.mosek.com/),
-        [NLopt](http://ab-initio.mit.edu/wiki/index.php/NLopt), and
+        [MOSEK](https://www.mosek.com/),
+        [NLopt](https://nlopt.readthedocs.io/en/latest/), and
         [SCS](https://github.com/cvxgrp/scs).
 -   Access to advanced algorithmic techniques
     -   Including efficient LP re-solves which previously required using
@@ -120,7 +120,7 @@ doi = {10.1137/15M1020575},
 ```
 
 For an earlier work where we presented a prototype implementation of JuMP, see
-[here](http://dx.doi.org/10.1287/ijoc.2014.0623):
+[here](https://dx.doi.org/10.1287/ijoc.2014.0623):
 
 ``` sourceCode
 @article{LubinDunningIJOC,
@@ -135,23 +135,23 @@ doi = {10.1287/ijoc.2014.0623},
 }
 ```
 
-A preprint of this paper is [freely available](http://arxiv.org/abs/1312.1431).
+A preprint of this paper is [freely available](https://arxiv.org/abs/1312.1431).
 
 ---
 
 ![NumFOCUS logo](assets/numfocus-logo.png)
 
-JuMP is a Sponsored Project of NumFOCUS, a 501(c)(3) nonprofit charity in the 
-United States. NumFOCUS provides JuMP with fiscal, legal, and administrative 
-support to help ensure the health and sustainability of the project. Visit 
+JuMP is a Sponsored Project of NumFOCUS, a 501(c)(3) nonprofit charity in the
+United States. NumFOCUS provides JuMP with fiscal, legal, and administrative
+support to help ensure the health and sustainability of the project. Visit
 [numfocus.org](https://numfocus.org) for more information.
 
-You can support JuMP by [donating](https://numfocus.salsalabs.org/donate-to-jump/index.html). 
+You can support JuMP by [donating](https://numfocus.salsalabs.org/donate-to-jump/index.html).
 
-Donations to JuMP are managed by NumFOCUS. For donors in the United States, 
-your gift is tax-deductible to the extent provided by law. As with any donation, 
+Donations to JuMP are managed by NumFOCUS. For donors in the United States,
+your gift is tax-deductible to the extent provided by law. As with any donation,
 you should consult with your tax adviser about your particular tax situation.
 
-JuMP's largest expense is the annual JuMP-dev workshop. Donations will help us 
-provide travel support for JuMP-dev attendees and take advantage of other 
+JuMP's largest expense is the annual JuMP-dev workshop. Donations will help us
+provide travel support for JuMP-dev attendees and take advantage of other
 opportunities that arise to support JuMP development.