Pith. sign in

REVIEW 1 cited by

A Differentiable Augmented Lagrangian Method for Bilevel Nonlinear Optimization

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1902.03319 v2 pith:KDYGH4D6 submitted 2019-02-08 cs.RO math.OC

classification cs.ROmath.OC
keywords optimizationproblemsbilevelalgorithmaugmentedlagrangianmanynonlinear
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Many problems in modern robotics can be addressed by modeling them as bilevel optimization problems. In this work, we leverage augmented Lagrangian methods and recent advances in automatic differentiation to develop a general-purpose nonlinear optimization solver that is well suited to bilevel optimization. We then demonstrate the validity and scalability of our algorithm with two representative robotic problems, namely robust control and parameter estimation for a system involving contact. We stress the general nature of the algorithm and its potential relevance to many other problems in robotics.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Differentiable GPU-Parallelized Task and Motion Planning

    cs.RO 2024-11 conditional novelty 7.0 of 10

    cuTAMP combines GPU-parallelized sampling and differentiable optimization to solve long-horizon task and motion planning problems on constrained manipulation tasks, outperforming serial baselines.

Pith tools