Mathematical Optimization in Julia. Local, global, gradient-based and derivative-free. Linear, Quadratic, Convex, Mixed-Integer, and Nonlinear Optimization in one simple, fast, and differentiable interface.
-
Updated
Oct 7, 2024 - Julia
Mathematical Optimization in Julia. Local, global, gradient-based and derivative-free. Linear, Quadratic, Convex, Mixed-Integer, and Nonlinear Optimization in one simple, fast, and differentiable interface.
A next-gen solver for nonconvex optimization. Uno is a Lagrange-Newton solver that unifies barrier and SQP methods in a modern and generic way, and implements different globalization flavors (line search/trust region and merit function/filter method/funnel method). Competitive against filterSQP, IPOPT, SNOPT, MINOS and CONOPT.
Art of finding minimum. Python implementations from scratch.
The project involves projective geometry, geometric transformations, modelling of cameras, feature extraction, stereo vision, recognition and deep learning, 3d-modelling, geometry of surfaces and their silhouettes, tracking, and visualisation.
Add a description, image, and links to the local-optimization topic page so that developers can more easily learn about it.
To associate your repository with the local-optimization topic, visit your repo's landing page and select "manage topics."