activity
20152026
most citedBregman Proximal Framework for Deep Linear Neural Networks

5 citations · 9 across the 19 of their papers we have counts for

collaborators
Showing math.OCShow all

17 papers · 1 filter

math.OC2026

On the Regularity of Generalized Conjugate Functions

Konstantinos Oikonomidis, Emanuel Laude, Panagiotis Patrinos

We investigate regularity properties of generalized conjugate functions induced by a general coupling function and the associated generalized proximal mapping. Our main results pro…

math.OC2026

All roads lead to Rome: Path-following Augmented Lagrangian Methods via Bregman Proximal Regularization

Emanuel Laude

We study Bregman proximal augmented Lagrangian methods with second-order oracles for convex convex-composite optimization problems. The outer loop is an instance of the Bregman pro…

math.OC2025

Forward-backward splitting under the light of generalized convexity

Konstantinos Oikonomidis, Emanuel Laude, Panagiotis Patrinos

In this paper we present a unifying framework for continuous optimization methods grounded in the concept of generalized convexity. Utilizing the powerful theory of -convexity,…

math.OC2025

Nonlinearly Preconditioned Gradient Methods under Generalized Smoothness

Konstantinos Oikonomidis, Jan Quan, Emanuel Laude +1

We analyze nonlinearly preconditioned gradient methods for solving smooth minimization problems. We introduce a generalized smoothness property, based on the notion of abstract con…

math.OC2024

The inexact power augmented Lagrangian method for constrained nonconvex optimization

Alexander Bodard, Konstantinos Oikonomidis, Emanuel Laude +1

This work introduces an unconventional inexact augmented Lagrangian method where the augmenting term is a Euclidean norm raised to a power between one and two. The proposed algorit…

math.OC2024

Adaptive proximal gradient methods are universal without approximation

Konstantinos A. Oikonomidis, Emanuel Laude, Puya Latafat +2

We show that adaptive proximal gradient methods for convex problems are not restricted to traditional Lipschitzian assumptions. Our analysis reveals that a class of linesearch-free…