Optimality conditions and a barrier method in optimization with convex geometric constraint

DOI10.1007/s11590-018-1232-3zbMath1422.90034OpenAlexW2783335941MaRDI QIDQ1653288

Radu Strugariu, Marius Durea

Publication date: 3 August 2018

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

Full work available at URL: https://doi.org/10.1007/s11590-018-1232-3

zbMATH Keywords

barrier methodnon-degeneracy conditionconstraints qualification conditions

Mathematics Subject Classification ID

Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46)

Related Items

A barrier method in convex vector optimization with generalized inequality constraints

Cites Work

• Erratum to: ``On convex optimization without convex representation
• Barrier method in nonsmooth convex optimization without convex representation
• On convex optimization without convex representation
• On representations of the feasible set in convex optimization
• Optimality conditions in convex optimization revisited
• An Introduction to Nonlinear Optimization Theory
• Functional Analysis, Calculus of Variations and Optimal Control
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item