Alternatives and similar repositories for primal-dual-linesearch:

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

• gpeyre / 2021-NonCvxPro
  ☆11Updated 3 years ago
• 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
• martinResearch / PySparseLP
  python algorithms to solve sparse linear programming problems
  ☆28Updated last year
• bobye / WBC_Matlab
  Efficient Wasserstein Barycenter in MATLAB (for "Fast Discrete Distribution Clustering Using Wasserstein Barycenter with Sparse Support" …
  ☆25Updated 5 years ago
• uclaopt / TMAC
  TMAC: A Toolbox of Modern Async-Parallel, Coordinate, Splitting, and Stochastic Methods
  ☆46Updated 8 years ago
• gpeyre / 2017-ot-beginners
  Optimal Transport for Dummies - Code, slides and article
  ☆32Updated 7 years ago
• bldeng / AA-ADMM
  Anderson Acceleration for ADMM
  ☆32Updated 5 years ago
• felixlen / trlib
  Trust Region Subproblem Solver Library
  ☆19Updated 8 months 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
• bernhard-schmitzer / optimal-transport
  A collection of adaptive sparse multi-scale solvers for optimal transport and related optimization problems.
  ☆53Updated 3 years ago
• simonbowly / lp-generators
  Generators for linear programming instances with controllable difficulty and solution properties.
  ☆16Updated 4 years ago
• gpeyre / 2017-EJAM-quantum-ot
  G. Peyré, L. Chizat, F-X. Vialard, J. Solomon, Quantum Optimal Transport for Tensor Field Processing, Arxiv, 2016
  ☆10Updated 8 years ago
• gpeyre / 2013-SIIMS-ot-splitting
  N. Papadakis, G. Peyré, E. Oudet. Optimal Transport with Proximal Splitting. SIAM Journal on Imaging Sciences, 7(1), pp. 212–238, 2014.
  ☆11Updated 8 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
• locuslab / newton_admm
  A Newton ADMM based solver for Cone programming.
  ☆38Updated 7 years ago
• nbonneel / network_simplex
  Fast optimal transport code
  ☆56Updated 5 years ago
• bodono / scs-python
  Python interface for SCS
  ☆43Updated 2 weeks ago
• cvxgrp / nonexp_global_aa1
  Globally Convergent Type-I Anderson Acceleration for Non-Smooth Fixed-Point Iterations
  ☆20Updated 6 years ago
• numericalalgorithmsgroup / dfogn
  DFO-GN: Derivative-Free Optimization using Gauss-Newton
  ☆24Updated last year
• LPMP / BDD
  An integer linear program solver using a Lagrange decomposition into binary decision diagrams. Lagrange multipliers are updated through d…
  ☆59Updated 11 months ago
• antonior92 / ip-nonlinear-solver
  A trust-region interior-point method for general nonlinear programing problems (GSoC 2017).
  ☆37Updated 7 years ago
• davidstutz / ipiano
  Implementation of the iPiano algorithm for non-convex and non-smooth optimization as described in [1].
  ☆12Updated 6 years ago
• oxfordcontrol / CDCS
  An open-source MATLAB® ADMM solver for partially decomposable conic optimization programs.
  ☆63Updated 5 years ago
• osqp / osqpth
  The differentiable OSQP solver layer for PyTorch
  ☆59Updated 2 years ago
• cvxgrp / cvxflow
  ☆67Updated 6 years ago
• stephenbeckr / convex-optimization-class
  APPM 5630 at CU Boulder
  ☆48Updated this week
• tum-vision / prost
  A fast and flexible convex optimization framework based on proximal splitting
  ☆40Updated 4 years ago
• yuekai / pnopt
  Proximal Newton OPTimizer
  ☆22Updated 10 years ago
• cvxgrp / cvxpyrepair
  Code for "Automatic repair of convex optimization problems".
  ☆13Updated 5 years ago