Extremal problems on complements of convex sets

DOI10.1007/BF01130093zbMath0833.90093MaRDI QIDQ1899895

Alexander S. Strekalovsky

Publication date: 2 November 1995

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

zbMATH Keywords

optimality conditionsnonconvex optimizationLagrange multiplier rulenonconvex optimal controlglobal extremum

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Programming in abstract spaces (90C48)

Related Items (3)

Reverse convex problems: an approach based on optimality conditions ⋮ Duality and optimality conditions for reverse convex programs via a convex decomposition ⋮ Global optimization and multi knapsack: a percolation algorithm.

Cites Work

• Optimization and nonsmooth analysis
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Extremal problems on complements of convex sets