interior-point-method

Linear optimization software

High-performance interior-point-method QP and QCQP solvers

Incremental Potential Contact (IPC) is for robust and accurate time stepping of nonlinear elastodynamics. IPC guarantees intersection- and inversion-free trajectories regardless of materials, time-step sizes, velocities, or deformation severity.

Clarabel.rs: Interior-point solver for convex conic optimisation problems in Rust.

A next-gen SQP & barrier solver for nonlinearly constrained optimization

Efficient optimal control solvers for robotic systems.

HPC solver for nonlinear optimization problems

Clarabel.jl: Interior-point solver for convex conic optimisation problems in Julia.

Interior-point solver in pure Julia

qpSWIFT is a light-weight sparse quadratic programming solver

A Proximal Interior Point Quadratic Programming solver

C++ interface for hpipm, a high-performance interior point MPC solver

An interior-point method written in python for solving constrained and unconstrained nonlinear optimization problems.

A linearity-exploiting sparse nonlinear constrained optimization problem solver that uses the interior-point method.

Clarabel.cpp: C/C++ interface to the Clarabel Interior-point solver for convex conic optimisation problems.

This book offers a theoretical and computational presentation of a variety of linear programming algorithms and methods with an emphasis on the revised simplex method and its components. A theoretical background and mathematical formulation is included for each algorithm as well as comprehensive numerical examples and corresponding MATLAB® code. The MATLAB® implementations presented in this book are sophisticated and allow users to find solutions to large-scale benchmark linear programs. Each algorithm is followed by a computational study on benchmark problems that analyze the computational behavior of the presented algorithms. As a solid companion to existing algorithmic-specific literature, this book will be useful to researchers, scientists, mathematical programmers, and students with a basic knowledge of linear algebra and calculus. The clear presentation enables the reader to understand and utilize all components of simplex-type methods, such as presolve techniques, scaling techniques, pivoting rules, basis update methods, and sensitivity analysis.

C++ implementation of the Interior Point Methods (CPPIPM)

interior point method for linear programming

A trust-region interior-point method for general nonlinear programing problems (GSoC 2017).

Quadratic Objective Conic Optimizer