A new dual problem for nondifferentiable convex programming

DOI10.1007/BF02015344zbMath0734.90068OpenAlexW2055885935MaRDI QIDQ811398

Shizheng Li

Publication date: 1990

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02015344

zbMATH Keywords

strong dualityweak dualitynondifferentiable convex programming

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Regularity conditions for constrained extremum problems
• Geometry of optimality conditions and constraint qualifications: The convex case

This page was built for publication: A new dual problem for nondifferentiable convex programming