On saddle points and optima for non-smooth and non-convex programs

DOI10.1080/02331939708844351zbMath0888.90131OpenAlexW2083111506MaRDI QIDQ4372098

No author found.

Publication date: 21 January 1998

Published in: Optimization (Search for Journal in Brave)

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

zbMATH Keywords

dualitysaddle pointsClarke's subdifferentialoptimanon-smooth and non-convex programs

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Nonsmooth analysis (49J52)

Related Items (1)

A one-layer recurrent neural network for non-smooth convex optimization subject to linear inequality constraints

Cites Work

• Equivalence of saddle-points and optima for non-concave programmes
• Equivalence of saddle-points and optima, and duality for a class of non- smooth non-convex problems
• On sufficiency of the Kuhn-Tucker conditions
• Strong and Weak Convexity of Sets and Functions
• Optimization and nonsmooth analysis
• Convexlike alternative theorems and mathematical programming
• Convex Analysis

This page was built for publication: On saddle points and optima for non-smooth and non-convex programs