On two simple decompositions of Lipschitz functions

DOI10.1080/02331930701779880zbMath1134.90503OpenAlexW1969026007MaRDI QIDQ3498591

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

convex functionordinary differential equationsymmetric matrixLipschitz functionmonotone functiondeterminantal inequalitycanonical form of mathematical program

Mathematics Subject Classification ID

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

Related Items (1)

A generalization of the classical \(\alpha \)BB convex underestimation via diagonal and nondiagonal quadratic terms

Cites Work

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

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