Extremal problems on complements of convex sets

DOI10.1007/BF01130093MaRDI QIDQ1899895zbMATH OpenFDO

Authors A. S. Strekalovskiĭ

Publication date 2 November 1995

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

zbMATH Keywords

nonconvex optimizationoptimality conditionsLagrange multiplier rulenonconvex optimal controlglobal extremum

Mathematics Subject Classification ID

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

Recommendations

• On nonconvex optimal control problems
• Publication:4292950
• On global extremum conditions in one non-convex minimization problem
• Publication:3718495
• On global maximum of a convex terminal functional in optimal control problems

Cites work

• scientific article; zbMATH DE number 3816450 (Why is no real title available?)
• scientific article; zbMATH DE number 3725308 (Why is no real title available?)
• scientific article; zbMATH DE number 47153 (Why is no real title available?)
• Optimization and nonsmooth analysis

Cited in

(9)

• scientific article; zbMATH DE number 3855829 (Why is no real title available?)
• Global optimization and multi knapsack: a percolation algorithm.
• Duality and optimality conditions for reverse convex programs via a convex decomposition
• A note on duality in reverse convex optimization
• Krein-Milman-type problems for compact matricially convex sets
• scientific article; zbMATH DE number 3948011 (Why is no real title available?)
• Bounds on the minimum of convex functions on Euclidean combinatorial sets
• Extremal set theory for the binomial norm
• Reverse convex problems: an approach based on optimality conditions

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1899895)