Cover Image

Finding directional stationary points of DC programs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Thi, Hoai An Le, Huynh, Van Ngai, Dinh, Tao Pham
Format:	Preprint
Published:	2026
Subjects:	Optimization and Control 49J52, 90C26, 90C30
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On the existence and the stability of solutions in nonconvex vector optimization
by: Van Nghi, Tran, et al.
Published: (2025)

Optimization Problems with Difference of Tangentially Convex Functions under Uncertainty
by: Mashkoorzadeh, Feryal, et al.
Published: (2026)

Revisiting the Geometrically Decaying Step Size: Linear Convergence for Smooth or Non-Smooth Functions
by: Kim, Jihun
Published: (2025)

Weak sharp minima at infinity and solution stability in mathematical programming via asymptotic analysis
by: Lara, Felipe, et al.
Published: (2024)

Approximate optimality conditions and sensitivity analysis in nearly convex optimization
by: Van Tuyen, Nguyen, et al.
Published: (2024)

Second-Order Optimality Conditions for Sparse Differentiable Optimization Problems via Limiting Second-Order Subdifferentials
by: Huyen, Luu Thi Thu, et al.
Published: (2026)

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

Directional Subdifferentials at Infinity and Its Applications
by: Kien, Le Ngoc, et al.
Published: (2025)

Approximate directional stationarity and associated qualification conditions
by: Käming, Isabella, et al.
Published: (2026)

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

On second-order optimality conditions for $C^{1,1}$ optimization problems via Lagrangian functions
by: An, Duong Thi Viet, et al.
Published: (2024)

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

On the directional asymptotic approach in optimization theory
by: Benko, Matúš, et al.
Published: (2024)

Stationarity in nonsmooth optimization between geometrical motivation and topological relevance
by: Shikhman, Vladimir
Published: (2024)

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

Douglas-Rachford splitting and ADMM for nonconvex optimization: Accelerated and Newton-type linesearch algorithms
by: Themelis, Andreas, 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)

Projected subgradient methods for paraconvex optimization: Application to robust low-rank matrix recovery
by: Rahimi, Morteza, et al.
Published: (2024)

(Adaptive) Scaled gradient methods beyond locally Holder smoothness: Lyapunov analysis, convergence rate and complexity
by: Ghaderi, Susan, et al.
Published: (2025)

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

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

Using second-order information in gradient sampling methods for nonsmooth optimization
by: Gebken, Bennet
Published: (2022)

A note on the convergence of deterministic gradient sampling in nonsmooth optimization
by: Gebken, Bennet
Published: (2023)

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

A third order dynamical system for generalized monotone equation
by: Hai, Pham Viet, et al.
Published: (2024)

Isolated calmness of perturbation mappings in generalized nonlinear programming and local superlinear convergence of Newton-type methods
by: Benko, Matúš, et al.
Published: (2024)

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

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

On second-order Karush--Kuhn--Tucker optimality conditions for $C^{1,1}$ vector optimization problems
by: Van Tuyen, Nguyen
Published: (2025)

Nonmonotone subgradient methods based on a local descent lemma
by: Aragón-Artacho, Francisco J., et al.
Published: (2025)

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

Clarke's tangent cones, subgradients, optimality conditions and the Lipschitzness at infinity
by: Nguyen, Minh Tung, et al.
Published: (2022)

Exact penalty functions in optimization with unbounded constraint sets
by: Jiao, Liguo, et al.
Published: (2025)

Characterizations of the Aubin property of the KKT-mapping in composite optimization by SC derivatives and quadratic bundles
by: Gfrerer, Helmut, et al.
Published: (2026)

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

Convergence Rates for the Alternating Minimization Algorithm in Structured Nonsmooth and Nonconvex Optimization
by: Bento, Glaydston C., et al.
Published: (2026)

Projected gradient descent accumulates at Bouligand stationary points
by: Olikier, Guillaume, et al.
Published: (2024)

Perturbation analysis of a class of composite optimization problems
by: Tang, Peipei, et al.
Published: (2024)

A new problem qualification based on approximate KKT conditions for Lipschitzian optimization with application to bilevel programming
by: Käming, Isabella, et al.
Published: (2024)

On Difference-of-SOS and Difference-of-Convex-SOS Decompositions for Polynomials
by: Niu, Yi-Shuai, et al.
Published: (2018)