Cover Image

A new insight into Lagrange duality on DC optimization

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Fajardo, M. D., Vidal-Nunez, J.
Format:	Preprint
Published:	2025
Subjects:	Optimization and Control 52A20, 26B25, 90C25, 49N15
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

On Subdifferentials Via a Generalized Conjugation Scheme: An Application to DC Problems and Optimality Conditions
by: Fajardo, M. D., et al.
Published: (2025)

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

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

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

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

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

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

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

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

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

(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)

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

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

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

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

Sparsification of sums with respect to convex cones
by: Saunderson, James
Published: (2025)

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

Structure Preserving Approximation of Semiconcave Functions
by: Kunisch, Karl, et al.
Published: (2026)

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

On the equivalence of $c$-potentiability and $c$-path boundedness in the sense of Artstein-Avidan, Sadovsky, and Wyczesany
by: Bartz, Sedi, 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)

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

Semi-analytical Approach to Trajectory Optimization for Stacker Cranes Regarding Energy Saving
by: Zöllner, R., et al.
Published: (2025)

Generalized outer linearizations and extremal properties of rotational epi-symmetrizations
by: Hoehner, Steven, et al.
Published: (2026)

Characterizations of Pseudolinear and Semi-strictly Quasilinear Functions
by: Ivanov, Vsevolod I.
Published: (2025)

The algebraic degree of sparse polynomial optimization
by: Lindberg, Julia, et al.
Published: (2023)

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

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

Local Nonconvexity Indices for \(C^{1,1}\) Functions via Generalized Hessians
by: Palaisti, Marina
Published: (2026)

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

On Characterizations of (Almost) Strictly Convex Functions
by: Bauschke, Heinz H., et al.
Published: (2026)

On Lagrange multipliers of constrained optimization in Hilbert spaces
by: Tan, Zhiyu
Published: (2023)

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

On the Strong Quasiconvexity of Norms and Distance Functions
by: Long, V. S. T., et al.
Published: (2026)

Copositive and completely positive cones over symmetric cones of rank at least 5
by: Nishijima, Mitsuhiro
Published: (2026)

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

Zeroth-order Random Subspace Algorithm for Non-smooth Convex Optimization
by: Nozawa, Ryota, et al.
Published: (2024)