Barrier method in nonsmooth convex optimization without convex representation

DOI10.1007/s11590-014-0811-1zbMath1323.90050OpenAlexW2051968184MaRDI QIDQ497445

Joydeep Dutta

Publication date: 24 September 2015

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-014-0811-1

zbMATH Keywords

nonsmooth optimizationconvex optimizationbarrier function

Mathematics Subject Classification ID

Convex programming (90C25)

Related Items

Optimality conditions and a barrier method in optimization with convex geometric constraint, A barrier method in convex vector optimization with generalized inequality constraints

Cites Work

• Erratum to: ``On convex optimization without convex representation
• On convex optimization without convex representation
• Convex analysis and nonlinear optimization. Theory and examples.
• On representations of the feasible set in convex optimization
• Optimality conditions in convex optimization revisited
• Optimization and nonsmooth analysis
• Generalized Gradients and Applications
• Nonlinear Programming
• Foundations of Optimization
• Convex Analysis