New qualification conditions for convex optimization without convex representation

DOI10.1007/s11590-019-01441-wOpenAlexW2956695653WikidataQ127724174 ScholiaQ127724174MaRDI QIDQ828724

F. Bazargan, Hossein Mohebi

Publication date: 5 May 2021

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

Full work available at URL: https://doi.org/10.1007/s11590-019-01441-w

zbMATH Keywords

Lagrange multipliersconvex optimizationnecessary and sufficient optimality conditionsbest approximationconstraint qualificationkarush-Kuhn-Tucker conditionsnon-convex constraint

Mathematics Subject Classification ID

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

Related Items (1)

Nonsmooth Constraint Qualifications for Nonconvex Inequality Systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Constraint qualifications in convex vector semi-infinite optimization
• On convex optimization without convex representation
• On representations of the feasible set in convex optimization
• Generalizations of Slater's constraint qualification for infinite convex programs
• Constraint qualifications for convex optimization without convexity of constraints: new connections and applications to best approximation
• Characterizing best approximation from a convex set without convex representation
• Fenchel duality and the strong conical hull intersection property
• Optimality conditions in convex optimization revisited
• The strong conical hull intersection property for convex programming
• A Global Approach to Nonlinearly Constrained Best Approximation
• Convex analysis and monotone operator theory in Hilbert spaces
• Best approximation in inner product spaces

This page was built for publication: New qualification conditions for convex optimization without convex representation