Alternatives and similar repositories for primal-dual-linesearch

Users that are interested in primal-dual-linesearch are comparing it to the libraries listed below

• cvxgrp / a2dr
  Anderson accelerated Douglas-Rachford splitting
  ☆29Updated 4 years ago
• yingcongtan / deep_inv_opt
  An Open Source Deep Learning Framework for Solving Inverse Optimization Problem
  ☆8Updated 5 years ago
• gpeyre / 2021-NonCvxPro
  ☆11Updated 4 years ago
• martinResearch / PySparseLP
  python algorithms to solve sparse linear programming problems
  ☆30Updated last year
• cvxgrp / cone_prog_refine
  Cone program refinement
  ☆10Updated 5 years ago
• locuslab / newton_admm
  A Newton ADMM based solver for Cone programming.
  ☆39Updated 7 years ago
• optml / ac-dc
  Automatically exported from code.google.com/p/ac-dc
  ☆14Updated 9 years ago
• numericalalgorithmsgroup / dfogn
  DFO-GN: Derivative-Free Optimization using Gauss-Newton
  ☆24Updated last year
• cvxgrp / cvxflow
  ☆67Updated 7 years ago
• nbonneel / network_simplex
  Fast optimal transport code
  ☆57Updated 5 years ago
• felixlen / trlib
  Trust Region Subproblem Solver Library
  ☆19Updated 10 months ago
• cvxgrp / ncvx
  ☆76Updated 3 years ago
• cvxgrp / dmcp
  A CVXPY extension for multi-convex programming
  ☆46Updated 2 years ago
• PavelTrutman / polyopt
  Polynomial optimization problem solver. Uses relaxation to convert the problem into Semidefinite programming. Can be also used just as Se…
  ☆20Updated 7 years ago
• simonbowly / lp-generators
  Generators for linear programming instances with controllable difficulty and solution properties.
  ☆16Updated 4 years ago
• gpeyre / 2017-ot-beginners
  Optimal Transport for Dummies - Code, slides and article
  ☆32Updated 8 years ago
• LPMP / BDD
  An integer linear program solver using a Lagrange decomposition into binary decision diagrams. Lagrange multipliers are updated through d…
  ☆59Updated last year
• cvxgrp / dccp
  A CVXPY extension for convex-concave programming
  ☆128Updated last year
• cvxgrp / cvxpyrepair
  Code for "Automatic repair of convex optimization problems".
  ☆13Updated 5 years ago
• cvxopt / chompack
  Library for chordal matrix computations
  ☆25Updated 6 years ago
• bobye / WBC_Matlab
  Efficient Wasserstein Barycenter in MATLAB (for "Fast Discrete Distribution Clustering Using Wasserstein Barycenter with Sparse Support" …
  ☆25Updated 5 years ago
• osqp / osqpth
  The differentiable OSQP solver layer for PyTorch
  ☆60Updated 2 years ago
• bodono / scs-python
  Python interface for SCS
  ☆43Updated last month
• facebookresearch / baspacho
  Direct solver for sparse SPD matrices for nonlinear optimization. Implements supernodal Cholesky decomposition algorithm, and supports GP…
  ☆91Updated 2 weeks ago
• bernhard-schmitzer / optimal-transport
  A collection of adaptive sparse multi-scale solvers for optimal transport and related optimization problems.
  ☆53Updated 3 years ago
• foges / pogs
  Proximal Operator Graph Solver
  ☆88Updated 2 years ago
• JihoYang / maxFlowminCut
  GPU accelerated first order primal-dual algorithm for solving convex optimization problems, and its application in maximum flow minimum c…
  ☆17Updated 4 years ago
• moskomule / hypergrad
  Simple and extensible hypergradient for PyTorch
  ☆16Updated 2 years ago
• Timeroot / CLQO
  Solver for Unconstrained Binary Quadratic Optimization (UBQO, BQO, QUBO) and Max 2-SAT, based on semidefinite relaxation with constraint …
  ☆15Updated 2 years ago
• antonior92 / ip-nonlinear-solver
  A trust-region interior-point method for general nonlinear programing problems (GSoC 2017).
  ☆37Updated 7 years ago