On two simple decompositions of Lipschitz functions

DOI10.1080/02331930701779880zbMATH Open1134.90503OpenAlexW1969026007MaRDI QIDQ3498591FDOQ3498591

Authors: Sanjo Zlobec 

Publication date: 15 May 2008

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331930701779880

Recommendations

• scientific article; zbMATH DE number 5510565
• Characterization of convexifiable functions
• Lipschitz programming via increasing convex-along-rays functions^*
• Convex minimization under Lipschitz constraints
• On the Liu-Floudas convexification of smooth programs

zbMATH Keywords

convex functionordinary differential equationLipschitz functionmonotone functionsymmetric matrixdeterminantal inequalitycanonical form of mathematical program

Mathematics Subject Classification ID

Inequalities involving eigenvalues and eigenvectors (15A42) Nonlinear programming (90C30) Sensitivity, stability, parametric optimization (90C31) Determinants, permanents, traces, other special matrix functions (15A15) Geometric methods in ordinary differential equations (34A26) Linear inequalities of matrices (15A39)

Cites Work

• A remark on the GOP algorithm for global optimization
• On the Liu-Floudas convexification of smooth programs
• Saddle-point optimality: a look beyond convexity
• Characterization of convexifiable functions
• Nonconvex optimization: gradient flows and deformation
• Convexifiable functions in integral calculus

Cited In (3)

• On the Liu-Floudas convexification of smooth programs
• A generalization of the classical \(\alpha \)BB convex underestimation via diagonal and nondiagonal quadratic terms
• Paradoxical decompositions using Lipschitz functions

This page was built for publication: On two simple decompositions of Lipschitz functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3498591)