Cover Image

Optimization landscape of $\ell_0$-Bregman relaxations

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Chirinos-Rodríguez, Jonathan, Févotte, Cédric, Soubies, Emmanuel
Format:	Preprint
Published:	2025
Subjects:	Optimization and Control 15A29, 49J99, 90C27, 90C26, 65K10
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A Tunneling Method for Nonlinear Multi-objective Optimization Problems
by: Adhikary, Bikram, et al.
Published: (2024)

Global Descent Method for Non-convex Multi-objective Optimization Problems
by: Adhikary, Bikram, et al.
Published: (2025)

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

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

An Adaptive Order Caputo Fractional Gradient Descent Method for Multi-objective Optimization Problems
by: Shaw, Barsha, et al.
Published: (2025)

$\ell_0$-Norm Multiobjective Optimization Models Motivated by Applications to Proton Therapy
by: Cong, Xiaoda, et al.
Published: (2025)

Robust optimality and duality for composite uncertain multiobjective optimization in Asplund spaces with its applications
by: Saadati, Maryam, et al.
Published: (2022)

Bregman Proximal Linearized ADMM for Minimizing Separable Sums Coupled by a Difference of Functions
by: Pham, Tan Nhat, 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 Symplectic Discretization Based Proximal Point Algorithm for Convex Minimization
by: Yuan, Ya-xiang, et al.
Published: (2024)

Nonlinear Separation Theorems for Co-Radiant Sets and Optimality Conditions for Approximate and Proper Approximate Solutions in Vector Optimization
by: García-Castaño, Fernando, et al.
Published: (2025)

One-parameter Filled Function Method for Non-convex Multi-objective Optimization Problems
by: Adhikary, Bikram, et al.
Published: (2026)

Sublinear Scalarizations for Proper and Approximate Proper Efficient Points in Nonconvex Vector Optimization
by: García-Castaño, Fernando, et al.
Published: (2024)

Optimization Problems with Nearly Convex Objective Functions and Nearly Convex Constraint Sets
by: Thieu, Nguyen Nang, et al.
Published: (2026)

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

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

Optimization on the Oblique Manifold for Sparse Simplex Constraints via Multiplicative Updates
by: Esposito, Flavia, et al.
Published: (2025)

Subgradient Regularization: A Descent-Oriented Subgradient Method for Nonsmooth Optimization
by: Li, Hanyang, et al.
Published: (2025)

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

Optimality conditions via exact penalty functions
by: Ivanov, Vsevolod Ivanov
Published: (2026)

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

A full splitting algorithm for structured difference-of-convex programs
by: Bot, Radu Ioan, et al.
Published: (2025)

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

ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization
by: Kabgani, Alireza, et al.
Published: (2025)

Asymptotic Convergence and Stability of Adaptive Gradient Methods in Smooth Non-convex Optimization
by: Jin, Ruinan, et al.
Published: (2026)

The iterates of FISTA convergence even under inexact computations and stochastic gradients
by: Salzo, Saverio
Published: (2025)

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

Shadow splitting methods for nonconvex optimisation: epi-approximation, convergence and saddle point avoidance
by: Atenas, Felipe
Published: (2025)

Understanding the Douglas-Rachford splitting method through the lenses of Moreau-type envelopes
by: Atenas, Felipe
Published: (2023)

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

A truncated epsilon-subdifferential method for global DC optimization
by: Bagirov, Adil M., et al.
Published: (2025)

Riemannian Trust Region Methods for SC$^1$ Minimization
by: Zhang, Chenyu, et al.
Published: (2023)

Inexact Limited Memory Bundle Method
by: Lampainen, Jenni, et al.
Published: (2026)

Moreau envelope and proximal-point methods under the lens of high-order regularization
by: Kabgani, Alireza, et al.
Published: (2025)

First- and Second-Order Stochastic Adaptive Regularization with Cubics: High Probability Iteration and Sample Complexity
by: Scheinberg, Katya, et al.
Published: (2023)

An Inexact Regularized Proximal Newton Method without Line Search
by: Dahl, Simeon vom, 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)

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

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)