Image de couverture de livre

A truncated epsilon-subdifferential method for global DC optimization

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Bagirov, Adil M., Joki, Kaisa, Makela, Marko M., Taheri, Sona
Format:	Preprint
Publié:	2025
Sujets:	Optimization and Control 90C26, 90C59, 49J52, 65K05
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Inexact Limited Memory Bundle Method
par: Lampainen, Jenni, et autres
Publié: (2026)

A relaxed version of Ryu's three-operator splitting method for structured nonconvex optimization
par: Alcantara, Jan Harold, et autres
Publié: (2025)

Moreau envelope and proximal-point methods under the lens of high-order regularization
par: Kabgani, Alireza, et autres
Publié: (2025)

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

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

ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization
par: Kabgani, Alireza, et autres
Publié: (2025)

ItsOPT: An inexact two-level smoothing framework for nonconvex optimization via high-order Moreau envelope
par: Kabgani, Alireza, et autres
Publié: (2024)

Subgradient Regularization: A Descent-Oriented Subgradient Method for Nonsmooth Optimization
par: Li, Hanyang, et autres
Publié: (2025)

Riemannian Trust Region Methods for SC$^1$ Minimization
par: Zhang, Chenyu, et autres
Publié: (2023)

A divergence-based condition to ensure quantile improvement in black-box global optimization
par: Guilmeau, Thomas, et autres
Publié: (2024)

First-order majorization-minimization meets high-order majorant: Boosted inexact high-order forward-backward method
par: Kabgani, Alireza, et autres
Publié: (2025)

Quasar-Convex Optimization: Fundamental Properties and High-Order Proximal-Point Methods
par: Ahookhosh, Masoud, et autres
Publié: (2026)

Nonmonotone subgradient methods based on a local descent lemma
par: Aragón-Artacho, Francisco J., et autres
Publié: (2025)

MGProx: A nonsmooth multigrid proximal gradient method with adaptive restriction for strongly convex optimization
par: Ang, Andersen, et autres
Publié: (2023)

An interior-point trust-region method for nonsmooth regularized bound-constrained optimization
par: Leconte, Geoffroy, et autres
Publié: (2024)

Convergence analysis of a primal-dual optimization-by-continuation algorithm
par: Loris, Ignace, et autres
Publié: (2023)

Finding directional stationary points of DC programs
par: Thi, Hoai An Le, et autres
Publié: (2026)

An interior proximal gradient method for nonconvex optimization
par: De Marchi, Alberto, et autres
Publié: (2022)

A new problem qualification based on approximate KKT conditions for Lipschitzian optimization with application to bilevel programming
par: Käming, Isabella, et autres
Publié: (2024)

Analyzing the speed of convergence in nonsmooth optimization via the Goldstein subdifferential with application to descent methods
par: Gebken, Bennet
Publié: (2024)

Optimality conditions via exact penalty functions
par: Ivanov, Vsevolod Ivanov
Publié: (2026)

A globalization of L-BFGS and the Barzilai-Borwein method for nonconvex unconstrained optimization
par: Mannel, Florian
Publié: (2024)

Steering exact penalty DCA for nonsmooth DC optimization problems with equality and inequality constraints
par: Dolgopolik, M. V.
Publié: (2021)

Projected subgradient methods for paraconvex optimization: Application to robust low-rank matrix recovery
par: Rahimi, Morteza, et autres
Publié: (2024)

A penalty barrier framework for nonconvex constrained optimization
par: De Marchi, Alberto, et autres
Publié: (2024)

Minimization Over the Nonconvex Sparsity Constraint Using A Hybrid First-order method
par: Yang, Xiangyu, et autres
Publié: (2021)

Local properties and augmented Lagrangians in fully nonconvex composite optimization
par: De Marchi, Alberto, et autres
Publié: (2023)

On a globally convergent semismooth* Newton method in nonsmooth nonconvex optimization
par: Gfrerer, H.
Publié: (2024)

RA-DCA: A Randomized Active-Set DCA for Directional Stationarity in Max-Structured DC Programs
par: Niu, Yi-Shuai
Publié: (2026)

A Symplectic Discretization Based Proximal Point Algorithm for Convex Minimization
par: Yuan, Ya-xiang, et autres
Publié: (2024)

Approximate optimality conditions and sensitivity analysis in nearly convex optimization
par: Van Tuyen, Nguyen, et autres
Publié: (2024)

Oracle complexities of augmented Lagrangian methods for nonsmooth manifold optimization
par: Deng, Kangkang, et autres
Publié: (2024)

A fresh look into variational analysis of $\mathcal C^2$-partly smooth functions
par: Hang, Nguyen T. V., et autres
Publié: (2024)

Weak sharp minima at infinity and solution stability in mathematical programming via asymptotic analysis
par: Lara, Felipe, et autres
Publié: (2024)

On the existence and the stability of solutions in nonconvex vector optimization
par: Van Nghi, Tran, et autres
Publié: (2025)

Kinetic description and convergence analysis of genetic algorithms for global optimization
par: Borghi, Giacomo, et autres
Publié: (2023)

Convergence of ZH-type nonmonotone descent method for Kurdyka-Łojasiewicz optimization problems
par: Qian, Yitian, et autres
Publié: (2024)

Douglas-Rachford splitting and ADMM for nonconvex optimization: Accelerated and Newton-type linesearch algorithms
par: Themelis, Andreas, et autres
Publié: (2020)

A Conjugate Gradient Method for Nonlinear Programming Problems using Caputo Fractional Gradients
par: Shawa, Barsha, et autres
Publié: (2025)

Tractable downfall of basis pursuit in structured sparse optimization
par: Marmary, Maya V., et autres
Publié: (2025)