On convex optimization without convex representation

DOI10.1007/s11590-011-0323-1zbMath1229.90125arXiv1006.5137MaRDI QIDQ644504

Jean-Bernard Lasserre

Publication date: 4 November 2011

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

Full work available at URL: https://arxiv.org/abs/1006.5137

zbMATH Keywords

convex optimization; log-barrier

Mathematics Subject Classification ID

90C25: Convex programming

Related Items

ϵ-Efficient solutions in semi-infinite multiobjective optimization, Convex inner approximations of nonconvex semialgebraic sets applied to fixed-order controller design, Barrier method in nonsmooth convex optimization without convex representation, Optimality conditions and a barrier method in optimization with convex geometric constraint, Constraint qualifications for convex optimization without convexity of constraints: new connections and applications to best approximation, Necessary and sufficient KKT optimality conditions in non-convex optimization

Cites Work

• On representations of the feasible set in convex optimization
• A geometrical insight on pseudoconvexity and pseudomonotonicity
• Characterization of the barrier parameter of homogeneous convex cones
• Lectures on Modern Convex Optimization
• Barrier Functions in Interior Point Methods
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item