<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Brian Plancher</title>
    <link>https://plancherb1.github.io/authors/rolandschwan/</link>
    <description>Recent content on Brian Plancher</description>
    <generator>Hugo -- gohugo.io</generator>
    <language>en-us</language>
    <copyright>&amp;copy; {year} Brian Plancher</copyright>
    <lastBuildDate>Mon, 26 Oct 2026 00:00:00 +0000</lastBuildDate>
    <atom:link href="https://plancherb1.github.io/authors/rolandschwan/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title></title>
      <link>https://plancherb1.github.io/authors/rolandschwan/</link>
      <pubDate>Mon, 26 Oct 2026 00:00:00 +0000</pubDate>
      <guid>https://plancherb1.github.io/authors/rolandschwan/</guid>
      <description></description>
    </item>
    <item>
      <title>Efficient ADMM for Soft-Constrained Quadratic Programs via Generalized Slack Projections</title>
      <link>https://plancherb1.github.io/publication/osqpslack/</link>
      <pubDate>Mon, 26 Oct 2026 00:00:00 +0000</pubDate>
      <guid>https://plancherb1.github.io/publication/osqpslack/</guid>
      <description>we propose an Alternating Direction Method of Multipliers (ADMM) scheme for a broad class of convex slack penalty functions, including all ℓk-norms, without increasing the problem size. The only change to the ADMM scheme is a modified slack projection function, while the remaining algorithm stays the same. We demonstrate our approach on numerical examples, showing significant speedups, and show its flexibility on an energy optimization problem.</description>
    </item>
  </channel>
</rss>
