On two simple decompositions of Lipschitz functions

DOI10.1080/02331930701779880MaRDI QIDQ3498591zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

canonical form of mathematical programconvex functiondeterminantal inequalityLipschitz functionmonotone functionordinary differential equationsymmetric matrix

Mathematics Subject Classification ID

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

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

Cites work

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

Cited in

(4)

• Paradoxical decompositions using Lipschitz functions
• A generalization of the classical BB convex underestimation via diagonal and nondiagonal quadratic terms
• On the Liu-Floudas convexification of smooth programs
• Lipschitz programming via increasing convex-along-rays 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)