Subgradient methods for two-stage lexicographic optimization with an infinite number of constraints

DOI10.1007/BF01128287zbMath0825.65047MaRDI QIDQ1343001

S. K. Zavriev

Publication date: 15 January 1995

Published in: Computational Mathematics and Modeling (Search for Journal in Brave)

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonsmooth analysis (49J52) Mathematical programming (90C99)

Cites Work

• Semi-infinite quadratic programming
• A stochastic method of discrepancies for seeking max-min
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Subgradient methods for two-stage lexicographic optimization with an infinite number of constraints