All Projects → jump-dev → Convex.jl

jump-dev / Convex.jl

Licence: other
A Julia package for disciplined convex programming

Programming Languages

julia
2034 projects

Labels

Projects that are alternatives of or similar to Convex.jl

stiff3
Adaptive solver for stiff systems of ODEs using semi-implicit Runge-Kutta method of third order
Stars: ✭ 13 (-96.88%)
Mutual labels:  solver
ConstraintSolver.jl
ConstraintSolver in Julia: Blog posts ->
Stars: ✭ 107 (-74.34%)
Mutual labels:  solver
Mather
zzllrr mather(an offline tool for Math learning, education and research)小乐数学,离线可用的数学学习(自学或教学)、研究辅助工具。计划覆盖数学全部学科的解题、作图、演示、探索工具箱。目前是演示Demo版(抛转引玉),但已经支持数学公式编辑显示,部分作图功能,部分学科,如线性代数、离散数学的部分解题功能。最终目标是推动专业数学家、编程专家、教育工作者、科普工作者共同打造出更加专业级的Mather数学工具
Stars: ✭ 270 (-35.25%)
Mutual labels:  solver
focus-outside
📦 一个很棒的 clickOutside 库,它解决了 iframe 无法触发 clickOutside 的问题,并且它支持分组绑定处理。A good clickOutside library, which solves the problem that iframe cannot trigger clickOutside, and it supports grouping binding processing.
Stars: ✭ 74 (-82.25%)
Mutual labels:  solver
osqp
The Operator Splitting QP Solver
Stars: ✭ 929 (+122.78%)
Mutual labels:  solver
Opennars
OpenNARS for Research 3.0+
Stars: ✭ 264 (-36.69%)
Mutual labels:  solver
FirstOrderSolvers.jl
Large scale convex optimization solvers in julia
Stars: ✭ 20 (-95.2%)
Mutual labels:  solver
Ik
Minimal Inverse Kinematics library
Stars: ✭ 340 (-18.47%)
Mutual labels:  solver
reinforce-js
[INACTIVE] A collection of various machine learning solver. The library is an object-oriented approach (baked with Typescript) and tries to deliver simplified interfaces that make using the algorithms pretty simple.
Stars: ✭ 20 (-95.2%)
Mutual labels:  solver
Dagsfm
Distributed and Graph-based Structure from Motion
Stars: ✭ 269 (-35.49%)
Mutual labels:  solver
Nonograms
A very fast japan crosswords (aka nonograms) solver and generator
Stars: ✭ 52 (-87.53%)
Mutual labels:  solver
GenesisZ
Mine the Genesis Block for your Zcashy altcoin
Stars: ✭ 22 (-94.72%)
Mutual labels:  solver
Angourimath
Open-source symbolic algebra library for C# and F#. One of the most powerful in .NET
Stars: ✭ 266 (-36.21%)
Mutual labels:  solver
qpmad
ROS-compatible Eigen-based Goldfarb-Idnani quadratic programming solver
Stars: ✭ 41 (-90.17%)
Mutual labels:  solver
Nerdamer
a symbolic math expression evaluator for javascript
Stars: ✭ 322 (-22.78%)
Mutual labels:  solver
Totsu
First-order conic solver for convex optimization problems
Stars: ✭ 18 (-95.68%)
Mutual labels:  solver
RECS
A solver for nonlinear, dynamic, stochastic, rational expectations equilibrium models
Stars: ✭ 15 (-96.4%)
Mutual labels:  solver
Handeye calib camodocal
Easy to use and accurate hand eye calibration which has been working reliably for years (2016-present) with kinect, kinectv2, rgbd cameras, optical trackers, and several robots including the ur5 and kuka iiwa.
Stars: ✭ 364 (-12.71%)
Mutual labels:  solver
Pyamg
Algebraic Multigrid Solvers in Python
Stars: ✭ 335 (-19.66%)
Mutual labels:  solver
Texasholdemsolverjava
A Java implemented Texas holdem and short deck Solver
Stars: ✭ 244 (-41.49%)
Mutual labels:  solver

Convex.jl

Build Status Coverage

Convex.jl is a Julia package for Disciplined Convex Programming. Convex.jl can solve linear programs, mixed-integer linear programs, and DCP-compliant convex programs using a variety of solvers, including Mosek, Gurobi, ECOS, SCS, and GLPK, through MathOptInterface. It also supports optimization with complex variables and coefficients.

Installation: julia> Pkg.add("Convex")

Quick Example

To run this example, first install Convex and at least one solver, such as SCS:

using Pkg
Pkg.add("Convex")
Pkg.add("SCS")

Now let's solve a least-squares problem with inequality constraints.

# Let us first make the Convex.jl module available
using Convex, SCS

# Generate random problem data
m = 4;  n = 5
A = randn(m, n); b = randn(m, 1)

# Create a (column vector) variable of size n x 1.
x = Variable(n)

# The problem is to minimize ||Ax - b||^2 subject to x >= 0
# This can be done by: minimize(objective, constraints)
problem = minimize(sumsquares(A * x - b), [x >= 0])

# Solve the problem by calling solve!
solve!(problem, SCS.Optimizer)

# Check the status of the problem
problem.status # :Optimal, :Infeasible, :Unbounded etc.

# Get the optimal value
problem.optval

More Examples

A number of examples can be found here. The basic usage notebook gives a simple tutorial on problems that can be solved using Convex.jl. All examples can be downloaded as a zip file from here.

Citing this package

If you use Convex.jl for published work, we encourage you to cite the software using the following BibTeX citation:

@article{convexjl,
 title = {Convex Optimization in {J}ulia},
 author = {Udell, Madeleine and Mohan, Karanveer and Zeng, David and Hong, Jenny and Diamond, Steven and Boyd, Stephen},
 year = {2014},
 journal = {SC14 Workshop on High Performance Technical Computing in Dynamic Languages},
 archivePrefix = "arXiv",
 eprint = {1410.4821},
 primaryClass = "math-oc",
}

Convex.jl was previously called CVX.jl.

Note that the project description data, including the texts, logos, images, and/or trademarks, for each open source project belongs to its rightful owner. If you wish to add or remove any projects, please contact us at [email protected].