Imagen de Portada

On Subdifferentials Via a Generalized Conjugation Scheme: An Application to DC Problems and Optimality Conditions

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Fajardo, M. D., Vidal-Nunez, J.
Formato:	Preprint
Publicado:	2025
Materias:	Optimization and Control 52A20, 26B25, 90C25, 49N15
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

A new insight into Lagrange duality on DC optimization
por: Fajardo, M. D., et al.
Publicado: (2025)

Lagrange duality on DC evenly convex optimization problems via a generalized conjugation scheme
por: Fajardo, M. D., et al.
Publicado: (2024)

On Fenchel c-conjugate dual problems for DC optimization: characterizing weak, strong and stable strong duality
por: Fajardo, M. D., et al.
Publicado: (2025)

Set-valued evenly convex functions: characterizations and c-conjugacy
por: Fajardo, M. D.
Publicado: (2025)

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

Optimality conditions via exact penalty functions
por: Ivanov, Vsevolod Ivanov
Publicado: (2026)

Optimal Methods for Unknown Piecewise Smooth Problems I: Convex Optimization
por: Lin, Zhenwei, et al.
Publicado: (2026)

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

Error Bounds for a Class of Cone-Convex Inclusion Problems
por: Huy, Nguyen Quang, et al.
Publicado: (2025)

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

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

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

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

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

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

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

On the longest chain of faces of the completely positive and copositive cones
por: Nishijima, Mitsuhiro
Publicado: (2023)

Sparsification of sums with respect to convex cones
por: Saunderson, James
Publicado: (2025)

On the equivalence of $c$-potentiability and $c$-path boundedness in the sense of Artstein-Avidan, Sadovsky, and Wyczesany
por: Bartz, Sedi, et al.
Publicado: (2025)

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

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

On Characterizations of $σ$-Quasiconvexity
por: Bao, Nguyen Xuan Duy, et al.
Publicado: (2025)

Solving Regularized Multifacility Location Problems with Unknown Number of Centers via Difference-of-Convex Optimization
por: Geremew, W., et al.
Publicado: (2026)

Optimal error bounds in the absence of constraint qualifications with applications to the $p$-cones and beyond
por: Lindstrom, Scott B., et al.
Publicado: (2021)

Sparsity of Quadratically Regularized Optimal Transport: Scalar Case
por: González-Sanz, Alberto, et al.
Publicado: (2024)

Properties of the complementarity set for the cone of copositive matrices
por: Kostyukova, O. I.
Publicado: (2024)

First and Second Order Necessary and Sufficient Optimality Conditions of Fritz John Type for Vector Problems over Cones
por: Ivanov, Vsevolod I.
Publicado: (2024)

A Symplectic Discretization Based Proximal Point Algorithm for Convex Minimization
por: Yuan, Ya-xiang, et al.
Publicado: (2024)

Enhanced computation of the proximity operator for perspective functions
por: Briceño-Arias, Luis M., et al.
Publicado: (2023)

Projection onto cones generated by epigraphs of perspective functions
por: Briceño-Arias, Luis M., et al.
Publicado: (2024)

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

Bridging Batch and Streaming Estimations to System Identification under Adversarial Attacks
por: Kim, Jihun, et al.
Publicado: (2025)

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

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

Monotone Causality in Opportunistically Stochastic Shortest Path Problems
por: Gaspard, Mallory E., et al.
Publicado: (2023)

Nonsmooth Convex Optimization using the Specular Gradient Method with Root-Linear Convergence
por: Jung, Kiyuob, et al.
Publicado: (2024)

A quadratically convergent proximal algorithm for nonnegative tensor decomposition
por: Vervliet, Nico, et al.
Publicado: (2020)

Quadratically Regularized Optimal Transport: Existence and Multiplicity of Potentials
por: Nutz, Marcel
Publicado: (2024)

Stability and Sample Complexity of Divergence Regularized Optimal Transport
por: Bayraktar, Erhan, et al.
Publicado: (2022)

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