activity
20162026
most citedForward-backward quasi-Newton methods for nonsmooth optimization problems

125 citations · 684 across the 34 of their papers we have counts for

collaborators
Showing 2022Show all

5 papers · 1 filter

math.OC2022★ 2 cited

Gauss-Newton meets PANOC: A fast and globally convergent algorithm for nonlinear optimal control

Pieter Pas, Andreas Themelis, Panagiotis Patrinos

PANOC is an algorithm for nonconvex optimization that has recently gained popularity in real-time control applications due to its fast, global convergence. The present work propose…

math.OC2022

A mirror inertial forward-reflected-backward splitting: Global convergence and linesearch extension beyond convexity and Lipschitz smoothness

Ziyuan Wang, Andreas Themelis, Hongjia Ou +1

This work investigates a Bregman and inertial extension of the forward-reflected-backward algorithm [Y. Malitsky and M. Tam, SIAM J. Optim., 30 (2020), pp. 1451--1472] applied to s…

math.OC2022★ 1 cited

An interior proximal gradient method for nonconvex optimization

Alberto De Marchi, Andreas Themelis

We consider structured minimization problems subject to smooth inequality constraints and present a flexible algorithm that combines interior point (IP) and proximal gradient schem…

math.OC2022★ 1 cited

SPIRAL: A superlinearly convergent incremental proximal algorithm for nonconvex finite sum minimization

Pourya Behmandpoor, Puya Latafat, Andreas Themelis +2

We introduce SPIRAL, a SuPerlinearly convergent Incremental pRoximal ALgorithm, for solving nonconvex regularized finite sum problems under a relative smoothness assumption. Each i…

math.OC2022★ 5 cited

Flock navigation with dynamic hierarchy and subjective weights using nonlinear MPC

Aneek Nag, Shuo Huang, Andreas Themelis +1

We propose a model predictive control (MPC) based approach to a flock control problem with obstacle avoidance capability in a leader-follower framework, utilizing the future trajec…