Convexification of nonsmooth monotone functions

DOI10.1007/s10957-006-9160-2zbMath1171.90502OpenAlexW2045449663WikidataQ57445486 ScholiaQ57445486MaRDI QIDQ933812

B. E. Eshmatov

Publication date: 25 July 2008

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-006-9160-2

zbMATH Keywords

nonsmooth optimizationsemismooth functionsGlobal Optimizationconvexification methods

Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30) Nonsmooth analysis (49J52)

Related Items (3)

On convexification for a class of global optimization problems ⋮ Some results on augmented Lagrangians in constrained global optimization via image space analysis ⋮ A branch-and-bound based method for solving monotone optimization problems

Cites Work

• Unnamed Item
• On the convexification of nonlinear programming problems: An applications-oriented survey
• Fractional programming: Applications and algorithms
• Minimization of ratios
• On generalized means and generalized convex functions
• Monotonic Optimization: Problems and Solution Approaches
• An alogrithm for monotonic global optimization problems^∗
• On second derivatives for nonsmooth functions
• Optimization and nonsmooth analysis
• On the computational utility of posynomial geometric programming solution methods
• Fractional Programming. II, On Dinkelbach's Algorithm
• Semismooth and Semiconvex Functions in Constrained Optimization
• Deterministic algorithms for constrained concave minimization: A unified critical survey
• A new approach to optimization under monotonic constraint
• A convexification method for a class of global optimization problems with applications to reliability optimization
• Convexification, concavification and monotonization in global optimization

This page was built for publication: Convexification of nonsmooth monotone functions