:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Laude, Emanuel, Themelis, Andreas, Patrinos, Panagiotis
Format:	Preprint
Published:	2021
Subjects:	Optimization and Control
Online Access:	https://arxiv.org/abs/2112.08886
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Forward-backward splitting under the light of generalized convexity
by: Oikonomidis, Konstantinos, et al.
Published: (2025)

Anisotropic Proximal Point Algorithm
by: Laude, Emanuel, et al.
Published: (2023)

Anisotropic Proximal Gradient
by: Laude, Emanuel, et al.
Published: (2022)

On the Regularity of Generalized Conjugate Functions
by: Oikonomidis, Konstantinos, et al.
Published: (2026)

Nonlinearly Preconditioned Gradient Methods under Generalized Smoothness
by: Oikonomidis, Konstantinos, et al.
Published: (2025)

Adaptive proximal gradient methods are universal without approximation
by: Oikonomidis, Konstantinos A., et al.
Published: (2024)

The inexact power augmented Lagrangian method for constrained nonconvex optimization
by: Bodard, Alexander, et al.
Published: (2024)

Global Convergence Analysis of the Power Proximal Point and Augmented Lagrangian Method
by: Oikonomidis, Konstantinos A., et al.
Published: (2023)

Adaptive proximal algorithms for convex optimization under local Lipschitz continuity of the gradient
by: Latafat, Puya, et al.
Published: (2023)

Gauss-Newton meets PANOC: A fast and globally convergent algorithm for nonlinear optimal control
by: Pas, Pieter, et al.
Published: (2022)

On the convergence of proximal gradient methods for convex simple bilevel optimization
by: Latafat, Puya, et al.
Published: (2023)

Lasry-Lions Envelopes and Nonconvex Optimization: A Homotopy Approach
by: Simões, Miguel, et al.
Published: (2021)

A new envelope function for nonsmooth DC optimization
by: Themelis, Andreas, et al.
Published: (2020)

Escaping saddle points without Lipschitz smoothness: the power of nonlinear preconditioning
by: Bodard, Alexander, et al.
Published: (2025)

Douglas-Rachford splitting and ADMM for nonconvex optimization: Accelerated and Newton-type linesearch algorithms
by: Themelis, Andreas, et al.
Published: (2020)

QPALM: A Proximal Augmented Lagrangian Method for Nonconvex Quadratic Programs
by: Hermans, Ben, et al.
Published: (2020)

A Bregman forward-backward linesearch algorithm for nonconvex composite optimization: superlinear convergence to nonisolated local minima
by: Ahookhosh, Masoud, et al.
Published: (2019)

Block-coordinate and incremental aggregated proximal gradient methods for nonsmooth nonconvex problems
by: Latafat, Puya, et al.
Published: (2019)

All roads lead to Rome: Path-following Augmented Lagrangian Methods via Bregman Proximal Regularization
by: Laude, Emanuel
Published: (2026)

On the convergence of adaptive first order methods: proximal gradient and alternating minimization algorithms
by: Latafat, Puya, et al.
Published: (2023)

Rethinking PCA Through Duality
by: Quan, Jan, et al.
Published: (2025)

A Lasry-Lions envelope approach for mathematical programs with complementarity constraints
by: Wang, Jia, et al.
Published: (2025)

Bregman Finito/MISO for nonconvex regularized finite sum minimization without Lipschitz gradient continuity
by: Latafat, Puya, et al.
Published: (2021)

PANOC-lite: A simpler and more efficient algorithm for composite minimization
by: Bodard, Alexander, et al.
Published: (2026)

Exact worst-case convergence rates of gradient descent: a complete analysis for all constant stepsizes over nonconvex and convex functions
by: Rotaru, Teodor, et al.
Published: (2024)

A quadratically convergent proximal algorithm for nonnegative tensor decomposition
by: Vervliet, Nico, et al.
Published: (2020)

Probabilistic Safety under Arbitrary Disturbance Distributions using Piecewise-Affine Control Barrier Functions
by: Teuwen, Matisse, et al.
Published: (2025)

Newton methods beyond Hessian Lipschitz continuity: A nonlinear preconditioning approach
by: Bodard, Alexander, et al.
Published: (2026)

Linesearch-free adaptive Bregman proximal gradient for convex minimization without relative smoothness
by: Ou, Hongjia, et al.
Published: (2025)

A mirror inertial forward-reflected-backward splitting: Global convergence and linesearch extension beyond convexity and Lipschitz smoothness
by: Wang, Ziyuan, et al.
Published: (2022)

Risk-Sensitive Model Predictive Control for Interaction-Aware Planning -- A Sequential Convexification Algorithm
by: Wang, Renzi, et al.
Published: (2025)

Nonlinearly Preconditioned Gradient Methods: Momentum and Stochastic Analysis
by: Oikonomidis, Konstantinos, et al.
Published: (2025)

Tight Analysis of Difference-of-Convex Algorithm (DCA) Improves Convergence Rates for Proximal Gradient Descent
by: Rotaru, Teodor, et al.
Published: (2025)

Second-order methods for provably escaping strict saddle points in composite nonconvex and nonsmooth optimization
by: Bodard, Alexander, et al.
Published: (2025)

Improved convergence rates for the Difference-of-Convex algorithm
by: Rotaru, Teodor, et al.
Published: (2024)

SPIRAL: A superlinearly convergent incremental proximal algorithm for nonconvex finite sum minimization
by: Behmandpoor, Pourya, et al.
Published: (2022)

Blocked Cholesky factorization updates of the Riccati recursion using hyperbolic Householder transformations
by: Pas, Pieter, et al.
Published: (2025)

Parametric Nonconvex Optimization via Convex Surrogates
by: Wang, Renzi, et al.
Published: (2026)

EM++: A parameter learning framework for stochastic switching systems
by: Wang, Renzi, et al.
Published: (2024)

Tight Convergence Rates in Gradient Mapping for the Difference-of-Convex Algorithm
by: Rotaru, Teodor, et al.
Published: (2025)