Cover Image

Conditions for representation of a function of many arguments as the difference of convex functions

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Proudnikov, Igor
Format:	Preprint
Published:	2017
Subjects:	Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

The Necessary and Sufficient Conditions for Representing Lipschitz Bivariate Functions as a Difference of Two Convex Functions(corrected)
by: Proudnikov, Igor
Published: (2012)

Higher-order tensor methods for minimizing difference of convex functions
by: Necoara, Ion
Published: (2024)

Approximation analysis for the minimization problem of difference-of-convex functions with Moreau envelopes
by: Tang, Yan, et al.
Published: (2024)

On extending the class of convex functions
by: Mohan, Shravan
Published: (2025)

Hypodifferentials of nonsmooth convex functions and their applications to nonsmooth convex optimization
by: Dolgopolik, M. V.
Published: (2023)

Subdifferentials of convex matrix-valued functions
by: Dolgopolik, M. V.
Published: (2023)

Frank--Wolfe algorithms for piecewise star-convex functions with a nonsmooth difference-of-convex structure
by: Millán, R. Díaz, et al.
Published: (2023)

On the Moreau envelope properties of weakly convex functions
by: Renaud, Marien, et al.
Published: (2025)

Frank-Wolfe algorithm for star-convex functions
by: Millan, R. Diaz, et al.
Published: (2025)

Convex analysis for composite functions without K-convexity
by: Vielma, Juan Pablo
Published: (2026)

The sparseness of g-convex functions
by: Wang, Yu, et al.
Published: (2024)

A proximal algorithm incorporating difference of convex functions optimization for solving a class of single-ratio fractional programming
by: Qi, Anna, et al.
Published: (2025)

Random minibatch subgradient algorithms for convex problems with functional constraints
by: Nedich, Angelia, et al.
Published: (2019)

A convex, finite and lower semicontinuous function with empty subdifferential
by: Wachsmuth, Gerd
Published: (2024)

Gaining or losing perspective for convex multivariate functions on box domains
by: Xu, Luze, et al.
Published: (2024)

Global and local approaches for the minimization of a sum of pointwise minima of convex functions
by: Van Dessel, Guillaume, et al.
Published: (2025)

Primal-Dual algorithms for Abstract convex functions with respect to quadratic functions
by: Bednarczuk, Ewa, et al.
Published: (2026)

Stochastic halfspace approximation method for convex optimization with nonsmooth functional constraints
by: Singh, Nitesh Kumar, et al.
Published: (2024)

A preconditioned third-order implicit-explicit algorithm with a difference of varying convex functions and extrapolation
by: Wu, Kelin, et al.
Published: (2025)

Closest univariate convex linear-quadratic function approximation with minimal number of Pieces
by: Kundu, Namrata, et al.
Published: (2025)

Numerical analysis of the convex relaxation of the barrier parameter functional of self-concordant barriers
by: Pirau, Vitali, et al.
Published: (2025)

Contractive difference-of-convex algorithms
by: He, Songnian, et al.
Published: (2025)

Some properties of sets, functions, and multi-objective optimization problems using p-convexity
by: Vera, Cristian
Published: (2026)

Worst-case convergence analysis of relatively inexact gradient descent on smooth convex functions
by: Vernimmen, Pierre, et al.
Published: (2025)

Polyak-Łojasiewicz inequality is essentially no more general than strong convexity for $C^2$ functions
by: Nejma, Aziz Ben
Published: (2025)

Computing AD-compatible subgradients of convex relaxations of implicit functions
by: Song, Yingkai, et al.
Published: (2025)

On the equivalence between functionally affine LPV state-space representations and LFT models
by: Petreczky, Mihály, et al.
Published: (2025)

Error bounds, PL condition, and quadratic growth for weakly convex functions, and linear convergences of proximal point methods
by: Liao, Feng-Yi, et al.
Published: (2023)

How does the contraction property fail for convex functions on normed spaces?
by: Ohta, Shin-ichi
Published: (2023)

Primal-dual algorithm for weakly convex functions under sharpness conditions
by: Bednarczuk, Ewa, et al.
Published: (2024)

Quasi-difference-convexity: Modernization of Quasi-differentiable Optimization
by: Pang, Jong-Shi, et al.
Published: (2025)

Exact worst-case convergence rates of gradient descent: a complete analysis for all constant stepsizes over nonconvex and convex functions
by: Rotaru, Teodor, et al.
Published: (2024)

Discrete-time gradient flows for unbounded convex functions on Gromov hyperbolic spaces
by: Ohta, Shin-ichi
Published: (2025)

Calculus rules for proximal ε-subdifferentials and inexact proximity operators for weakly convex functions
by: Bednarczuk, Ewa, et al.
Published: (2022)

Nonlinear conjugate gradient for smooth convex functions
by: Karimi, Sahar, et al.
Published: (2021)

Optimal $L^p$-approximation of convex sets by convex subsets
by: Fattah, Zakaria, et al.
Published: (2025)

A smoothing moving balls approximation method for a class of conic-constrained difference-of-convex optimization problems
by: Xu, Jiefeng, et al.
Published: (2025)

On the nature of Bregman functions
by: Pauwels, Edouard
Published: (2023)

On a group of invariances in a class of functions
by: Mohan, Shravan
Published: (2026)

On the mixed monotonicity of polynomial functions
by: Tahir, Adam M
Published: (2023)