Trending Research

FATROP : A Fast Constrained Optimal Control Problem Solver for Robot Trajectory Optimization and Control

meco-group/fatrop 29 Mar 2023

Trajectory optimization is a powerful tool for robot motion planning and control.

Optimization and Control Robotics

75
0.16 stars / hour

On the Differentiability of the Primal-Dual Interior-Point Method

kevin-tracy/qpax 17 Jun 2024

Primal-Dual Interior-Point methods are capable of solving constrained convex optimization problems to tight tolerances in a fast and robust manner.

Optimization and Control

25
0.09 stars / hour

Unifying nonlinearly constrained nonconvex optimization

cvanaret/Uno 19 Jun 2024

Derivative-based iterative methods for nonlinearly constrained nonconvex optimization usually share common algorithmic components, such as strategies for computing a descent direction and mechanisms that promote global convergence.

Optimization and Control 49M15, 65K05, 90C30, 90C51, 90C55

200
0.07 stars / hour

Implementing Hadamard Matrices in SageMath

sagemath/sage 29 Jun 2023

The Hadamard conjecture states that Hadamard matrices of order $n$ exist whenever $n$ is $1$, $2$, or a multiple of $4$.

Combinatorics

1,164
0.07 stars / hour

Asynchronous and Parallel Distributed Pose Graph Optimization

mit-acl/dpgo 6 Mar 2020

We present Asynchronous Stochastic Parallel Pose Graph Optimization (ASAPP), the first asynchronous algorithm for distributed pose graph optimization (PGO) in multi-robot simultaneous localization and mapping.

Optimization and Control Multiagent Systems Robotics

174
0.06 stars / hour

Multilevel domain decomposition-based architectures for physics-informed neural networks

benmoseley/FBPINNs 8 Jun 2023

Our numerical results show that the proposed multilevel FBPINNs consistently and significantly outperform PINNs across a range of problems with high frequency and multi-scale solutions.

Numerical Analysis Numerical Analysis

242
0.05 stars / hour

Kangaroo Methods for Solving the Interval Discrete Logarithm Problem

jeanlucpons/kangaroo 28 Jan 2015

In this thesis, I improve the running time of methods that use more than four kangaroos significantly, and almost beat the fastest kangaroo algorithm, by presenting a seven kangaroo method with an expected average running time of $\big(1. 7195 + o(1)\big)\sqrt{N} \pm O(1)$ group operations.

Number Theory Data Structures and Algorithms

215
0.04 stars / hour

Efficient Zero-Order Robust Optimization for Real-Time Model Predictive Control with acados

acados/acados 8 Nov 2023

The recently proposed zero-order robust optimization (zoRO) algorithm mitigates the computational cost of uncertainty-aware MPC by propagating the uncertainties outside of the MPC problem.

Optimization and Control

705
0.04 stars / hour

Universal Average-Case Optimality of Polyak Momentum

d2l-ai/d2l-en 19 Aug 2020

Polyak momentum (PM), also known as the heavy-ball method, is a widely used optimization method that enjoys an asymptotic optimal worst-case complexity on quadratic objectives.

Optimization and Control

22,252
0.03 stars / hour

Meta-learners for Estimating Heterogeneous Treatment Effects using Machine Learning

kailiang-zhong/DESCN 12 Jun 2017

There is growing interest in estimating and analyzing heterogeneous treatment effects in experimental and observational studies.

Statistics Theory Methodology Statistics Theory

52
0.03 stars / hour