:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Author:	Salzo, Saverio
Format:	Preprint
Published:	2025
Subjects:	Optimization and Control 65K05, 90C25, 90C15, 49M27
Online Access:	https://arxiv.org/abs/2511.12665
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Complexity of an inexact stochastic SQP algorithm for equality constrained optimization
by: O'Neill, Michael J., et al.
Published: (2026)

A distributed proximal splitting method with linesearch for locally Lipschitz gradients
by: Atenas, Felipe, et al.
Published: (2024)

A finitely convergent circumcenter method for the Convex Feasibility Problem
by: Behling, Roger, et al.
Published: (2023)

Flexible block-iterative analysis for the Frank-Wolfe algorithm
by: Braun, Gábor, et al.
Published: (2024)

First-order majorization-minimization meets high-order majorant: Boosted inexact high-order forward-backward method
by: Kabgani, Alireza, et al.
Published: (2025)

A cut-and-project perspective for linearized Bregman iterations
by: Dai, Yu-Hong, et al.
Published: (2024)

A Proximal Stochastic Gradient Method with Adaptive Step Size and Variance Reduction for Convex Composite Optimization
by: Fang, Changjie, et al.
Published: (2025)

On the Convergence Rates of Iterative Regularization Algorithms for Composite Bi-Level Optimization
by: Shtern, Shimrit, et al.
Published: (2025)

The Golden Ratio Proximal ADMM with Norm Independent Step-Sizes for Separable Convex Optimization
by: Soe, Santanu, et al.
Published: (2025)

Parallel Polyhedral Projection Method for the Convex Feasibility Problem
by: Barros, Pablo, et al.
Published: (2025)

Fejér* monotonicity in optimization algorithms
by: Behling, Roger, et al.
Published: (2024)

Adaptive Multilevel Newton: A Quadratically Convergent Optimization Method
by: Tsipinakis, Nick, et al.
Published: (2025)

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

On the Convergence and Complexity of Proximal Gradient and Accelerated Proximal Gradient Methods under Adaptive Gradient Estimation
by: Bollapragada, Raghu, et al.
Published: (2025)

Accelerated Proximal Gradient Methods in the affine-quadratic case: Strong convergence and limit identification
by: Moursi, Walaa M., et al.
Published: (2025)

MGProx: A nonsmooth multigrid proximal gradient method with adaptive restriction for strongly convex optimization
by: Ang, Andersen, et al.
Published: (2023)

GLL-type Nonmonotone Descent Methods Revisited under Kurdyka-Łojasiewicz Property
by: Qian, Yitian, et al.
Published: (2025)

A Single-loop Proximal Subgradient Algorithm for A Class Structured Fractional Programs
by: Han, Deren, et al.
Published: (2025)

A full splitting algorithm for fractional programs with structured numerators and denominators
by: Boţ, Radu Ioan, et al.
Published: (2023)

Fast Reflected Forward-Backward algorithm: achieving fast convergence rates for convex optimization with linear cone constraints
by: Bot, Radu Ioan, et al.
Published: (2024)

ProxSTORM -- A Stochastic Trust-Region Algorithm for Nonsmooth Optimization
by: Baraldi, Robert J., et al.
Published: (2025)

Retrospective Approximation Sequential Quadratic Programming for Stochastic Optimization with General Deterministic Nonlinear Constraints
by: Berahas, Albert S., et al.
Published: (2025)

The Grimmer--Shu--Wang Certificate and the Drori--Teboulle Minimax Constant-Stepsize Bound for $N\ge 3$
by: Zhang, Lixing
Published: (2026)

ItsOPT: An inexact two-level smoothing framework for nonconvex optimization via high-order Moreau envelope
by: Kabgani, Alireza, et al.
Published: (2024)

A relaxed version of Ryu's three-operator splitting method for structured nonconvex optimization
by: Alcantara, Jan Harold, et al.
Published: (2025)

Learning the hub graphical Lasso model with the structured sparsity via an efficient algorithm
by: Wang, Chengjing, et al.
Published: (2023)

Bregman Proximal Linearized ADMM for Minimizing Separable Sums Coupled by a Difference of Functions
by: Pham, Tan Nhat, et al.
Published: (2024)

A proximal splitting algorithm for generalized DC programming with applications in signal recovery
by: Pham, Tan Nhat, et al.
Published: (2024)

Convergence of ZH-type nonmonotone descent method for Kurdyka-Łojasiewicz optimization problems
by: Qian, Yitian, et al.
Published: (2024)

A proximal subgradient algorithm with extrapolation for structured nonconvex nonsmooth problems
by: Pham, Tan Nhat, et al.
Published: (2022)

Augmented Lagrangian methods for fully convex composite optimization
by: De Marchi, Alberto, et al.
Published: (2025)

Mathematical programs with complementarity constraints and application to hyperparameter tuning for nonlinear support vector machines
by: Ward, Samuel, et al.
Published: (2025)

A Two Stepsize SQP Method for Nonlinear Equality Constrained Stochastic Optimization
by: O'Neill, Michael J.
Published: (2024)

Non-Convex Self-Concordant Functions: Practical Algorithms and Complexity Analysis
by: Goldfarb, Donald, et al.
Published: (2025)

A Cubic Regularization Method for Multiobjective Optimization
by: Gonçalves, Douglas S., et al.
Published: (2025)

A General Recipe for Parameter-Free Nonconvex Optimization via Higher-Order Regularization
by: Marumo, Naoki, et al.
Published: (2026)

Practical Regularized Quasi-Newton Methods with Inexact Function Values
by: Hamaguchi, Hiroki, et al.
Published: (2026)

Dynamic FISTA for Convex Composite Bi-Level Optimization
by: Merchav, Roey, et al.
Published: (2024)

An extension of the projected gradient method to a Banach space setting with application in structural topology optimization
by: Blank, Luise, et al.
Published: (2015)

Extragradient method with feasible inexact projection to variational inequality problem
by: Millán, R. Díaz, et al.
Published: (2023)