Nonconvex embedded optimization: code generation for fast real-time optimization + ROS support
-
Updated
Sep 2, 2024 - Rust
Nonconvex embedded optimization: code generation for fast real-time optimization + ROS support
Open-L2O: A Comprehensive and Reproducible Benchmark for Learning to Optimize Algorithms
A next-gen solver for optimization with nonconvex objective and constraints. Reimplements filterSQP and IPOPT (barrier) in a modern and generic way, and unlocks a variety of novel methods. Competitive against filterSQP, IPOPT, SNOPT, MINOS and CONOPT.
Simulation code for "Fast Converging Algorithm for Weighted Sum Rate Maximization in Multicell MISO Downlink" by Le-Nam Tran, Muhammad Fainan Hanif, Antti Tolli, Markku Juntti, IEEE Signal Processing Letters 19.12 (2012): 872-875
Semi-random funky stuff, mainly for my PhD experiments and articles. Contains calculations and algorithm implementations for various applied mathematics and astrophysics articles I worked on.
Nonconvex Exterior Point Operator Splitting
Proximal Augmented Lagrangian method for Quadratic Programs
Coordinate and Incremental Aggregated Optimization Algorithms
Build a Recurrent Neural Network solving Optimization Problems
Optimized and benchmarked parallel Genetic Algorithm with inequality constraints, and a scipy-like interface
Solving Convex and Nonconvex Optimization Problems
HarvesterOpt is a Matlab code to maximize the energy recovered by a bistable energy harvester.
Simulation code for "A Conic Quadratic Programming Approach to Physical Layer Multicasting for Large-Scale Antenna Arrays." by L.-N. Tran, M. F. Hanif, M. Juntti., IEEE Signal Processing Letters 21.1 (2014): 114-117
Quantum control algorithms for multiple examples based on the package Qutip
Fix and Bound: An efficient approach for solving large-scale BoxQPs
Code and results for quantum optimal control based on switching time optimization
R package for fast optimizing type I/II error, recall/precision and F1 score.
Proof-of-concept implementation of a method by Song and Khan (2022) for computing convex relaxations for parametric ordinary differential equations.
CEopt is a Matlab routine for nonconvex optimization using the Cross-Entropy method and augmented Lagrangian formulation.
Add a description, image, and links to the nonconvex-optimization topic page so that developers can more easily learn about it.
To associate your repository with the nonconvex-optimization topic, visit your repo's landing page and select "manage topics."