A new dual problem for nondifferentiable convex programming

DOI10.1007/BF02015344MaRDI QIDQ811398zbMATH OpenOpenAlexFDO

Authors 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

• scientific article; zbMATH DE number 4041659 (Why is no real title available?)
• scientific article; zbMATH DE number 3711742 (Why is no real title available?)
• scientific article; zbMATH DE number 3791104 (Why is no real title available?)
• scientific article; zbMATH DE number 3562783 (Why is no real title available?)
• scientific article; zbMATH DE number 3634008 (Why is no real title available?)
• Geometry of optimality conditions and constraint qualifications: The convex case
• Regularity conditions for constrained extremum problems

Cited in

(4)

• scientific article; zbMATH DE number 4025177 (Why is no real title available?)
• New duality results for evenly convex optimization problems
• The duality of certain non-convex extremal problems
• scientific article; zbMATH DE number 883252 (Why is no real title available?)

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

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