Copertina

Solving Regularized Multifacility Location Problems with Unknown Number of Centers via Difference-of-Convex Optimization

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Geremew, W., Long, V. S. T., Nam, N. M., Solano-Herrera, A.
Natura:	Preprint
Pubblicazione:	2026
Soggetti:	Optimization and Control 49J52, 68Q25, 90C26, 90C90, 90C31, 90C35
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

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

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

A Level Set Method with Secant Iterations for the Least-Squares Constrained Nuclear Norm Minimization
di: Ma, Chiyu, et al.
Pubblicazione: (2026)

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

Kurdyka-Łojasiewicz exponent via Hadamard parametrization
di: Ouyang, Wenqing, et al.
Pubblicazione: (2024)

Kurdyka-Łojasiewicz exponent via square transformation
di: Ouyang, Wenqing
Pubblicazione: (2025)

Interpolation Conditions for Linear Operators and Applications to Performance Estimation Problems
di: Bousselmi, Nizar, et al.
Pubblicazione: (2023)

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

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

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

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

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

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

Isolated Calmness in Regularized Convex Optimization
di: Nghia, Tran T. A., et al.
Pubblicazione: (2026)

Exact Solution to Data-Driven Inverse Optimization of MILPs in Finite Time via Gradient-Based Methods
di: Kitaoka, Akira
Pubblicazione: (2024)

Barrier Algorithms for Constrained Non-Convex Optimization
di: Dvurechensky, Pavel, et al.
Pubblicazione: (2024)

On Differential Stability of a Class of Convex Optimization Problems
di: Yen, Nguyen Dong, et al.
Pubblicazione: (2024)

Qualitative and Generalized Differentiation Properties of Optimal Value Functions with Applications to Duality
di: Long, V. S. T., et al.
Pubblicazione: (2025)

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

A constraint-based approach to function interpolation, with application to performance estimation for weakly convex optimisation
di: Rubbens, Anne, et al.
Pubblicazione: (2024)

Riemannian Adaptive Regularized Newton Methods with Hölder Continuous Hessians
di: Zhang, Chenyu, et al.
Pubblicazione: (2023)

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

Interval-Valued Optimization Problems for Strongly LU-E-Invex and Strongly LU-E-Preinvex Functions
di: Tauheed, et al.
Pubblicazione: (2026)

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

Further Development in Convex Conic Reformulation of Geometric Nonconvex Conic Optimization Problems
di: Arima, Naohiko, et al.
Pubblicazione: (2023)

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

Lagrange Multipliers, Duality, and Sensitivity in Set-Valued Convex Programming via Pointed Closed Convex Processes
di: García-Castaño, Fernando, et al.
Pubblicazione: (2024)

The Non-Substitution Theorem, Uniqueness of Solution and Convex combinations of basic optimal solutions for linear optimization
di: Lahiri, Somdeb
Pubblicazione: (2024)

On the resolution of $\ell_1$-norm minimization via a two-metric adaptive projection method
di: Wu, Hanju, et al.
Pubblicazione: (2025)

Accelerating preconditioned ADMM via degenerate proximal point mappings
di: Sun, Defeng, et al.
Pubblicazione: (2024)

Extending Exact Convex Relaxations of Quadratically Constrained Quadratic Programs
di: Kojima, Masakazu, et al.
Pubblicazione: (2025)

A Set-Valued Lagrange Theorem based on a Process for Convex Vector Programming
di: García-Castaño, Fernando, et al.
Pubblicazione: (2024)

Stable Recovery of Regularized Linear Inverse Problems
di: Nghia, Tran T. A., et al.
Pubblicazione: (2024)

A Projection-Free Method for Solving Convex Bilevel Optimization Problems
di: Giang-Tran, Khanh-Hung, et al.
Pubblicazione: (2023)

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

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

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

Tractable downfall of basis pursuit in structured sparse optimization
di: Marmary, Maya V., et al.
Pubblicazione: (2025)

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

Finding directional stationary points of DC programs
di: Thi, Hoai An Le, et al.
Pubblicazione: (2026)