Skip to content
#

non-convex-optimization

Here are 39 public repositories matching this topic...

A cutting-edge implementation of Particle Swarm Optimization (PSO) tailored for navigating and optimizing complex non-convex functions. This project encapsulates an advanced algorithmic approach, leveraging swarm intelligence to efficiently converge on global minima in multimodal landscapes.

  • Updated Nov 24, 2023
  • Jupyter Notebook

In compressed decentralized optimization settings, there are benefits to having multiple gossip steps between subsequent gradient iterations, even when the cost of doing so is appropriately accounted for e.g. by means of reducing the precision of compressed information.

  • Updated Jan 11, 2022
  • Python

Improve this page

Add a description, image, and links to the non-convex-optimization topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the non-convex-optimization topic, visit your repo's landing page and select "manage topics."

Learn more