Alternatives and similar repositories for BFGS-NelderMead-TrustRegion

Users that are interested in BFGS-NelderMead-TrustRegion are comparing it to the libraries listed below

• martinResearch / PySparseLP
  python algorithms to solve sparse linear programming problems
  ☆30Updated last year
• yingcongtan / deep_inv_opt
  An Open Source Deep Learning Framework for Solving Inverse Optimization Problem
  ☆8Updated 5 years ago
• yrlu / non-convex
  Self-contained implementation of non-convex optimization algorithms in python. Steepest Descent, Conjugate Gradient, Newton's Method, Qua…
  ☆81Updated 3 years ago
• PythonOptimizers / NLP.py
  A Python environment for large-scale optimization.
  ☆30Updated 7 years ago
• numericalalgorithmsgroup / dfogn
  DFO-GN: Derivative-Free Optimization using Gauss-Newton
  ☆24Updated last year
• cshjin / awesome-nonconvex-optimization
  A collection of papers and readings for non-convex optimization
  ☆31Updated 6 years ago
• krislock / ExpVecEDM
  MATLAB code for solving the Euclidean Distance Matrix completion problem.
  ☆10Updated 7 years ago
• lindonroberts / trust-region
  Python trust-region subproblem solvers for nonlinear optimization
  ☆27Updated 11 months ago
• osqp / osqpth
  The differentiable OSQP solver layer for PyTorch
  ☆62Updated 2 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
• jkaardal / pyipm
  An interior-point method written in python for solving constrained and unconstrained nonlinear optimization problems.
  ☆82Updated 3 years ago
• cvxgrp / dmcp
  A CVXPY extension for multi-convex programming
  ☆46Updated 2 years ago
• cvxgrp / a2dr
  Anderson accelerated Douglas-Rachford splitting
  ☆29Updated 4 years ago
• gpeyre / 2021-NonCvxPro
  ☆11Updated 4 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
• LPMP / LPMP
  Solving LPs with convergent message passing
  ☆66Updated 2 years ago
• cvxgrp / qcqp
  A CVXPY extension for handling nonconvex QCQP via Suggest-and-Improve framework
  ☆115Updated 5 years ago
• martius-lab / CombOptNet
  Source code for the Paper: CombOptNet: Fit the Right NP-Hard Problem by Learning Integer Programming Constraints}
  ☆73Updated 3 years ago
• cvxgrp / diffcp
  Differentiation through cone programs
  ☆101Updated 4 months ago
• oxfordcontrol / Bayesian-Optimization
  Reference implementation of Optimistic Expected Improvement.
  ☆49Updated 5 years ago
• bapaden / ipopt-cmake-demo
  Just one of the ipopt examples wrapped up with cmake
  ☆13Updated 7 years ago
• ravi-lanka-4 / CoPiEr
  Co-training for Policy Learning
  ☆13Updated 5 years ago
• gilbertgede / PyIntropt
  A Python Interior Point Optimization Solver
  ☆12Updated 11 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
• pdfo / pdfo
  Powell's Derivative-Free Optimization solvers.
  ☆103Updated last month
• YimingYAN / cppipm
  C++ implementation of the Interior Point Methods (CPPIPM)
  ☆44Updated 7 years ago
• cjones6 / cubic_reg
  Implementation of Nesterov and Polyak's (2006) cubic regularization algorithm and Cartis et al's (2011) adaptive cubic regularization alg…
  ☆18Updated 3 years ago
• jstraub / dpMMlowVar
  Bayesian nonparametric small-variance asymptotic clustering algorithms
  ☆20Updated 8 years ago
• stellatogrp / l2ws_qp
  ☆14Updated 2 years ago
• antonior92 / ip-nonlinear-solver
  A trust-region interior-point method for general nonlinear programing problems (GSoC 2017).
  ☆37Updated 7 years ago