On convex optimization without convex representation
From MaRDI portal
Publication:644504
Abstract: We consider the convex optimization problem P: min {f(x): x in K} where "f" is convex continuously differentiable, and K is a compact convex set in Rn with representation {x: g_j(x) >=0, j=1,;;,m} for some continuously differentiable functions (g_j). We discuss the case where the g_j's are not all concave (in contrast with convex programming where they all are). In particular, even if the g_j's are not concave, we consider the log-barrier function phi_mu with parameter mu, associated with P, usually defined for concave functions (g_j). We then show that any limit point of any sequence (x_mu) of stationary points of phi_mu, mu ->0, is a Karush-Kuhn-Tucker point of problem P and a global minimizer of f on K.
Recommendations
- On representations of the feasible set in convex optimization
- Barrier method in nonsmooth convex optimization without convex representation
- scientific article; zbMATH DE number 14495
- scientific article; zbMATH DE number 399385
- Optimality conditions and a barrier method in optimization with convex geometric constraint
Cites work
- A geometrical insight on pseudoconvexity and pseudomonotonicity
- Barrier Functions in Interior Point Methods
- Characterization of the barrier parameter of homogeneous convex cones
- Convexity and optimization in \({\mathbb R^n}\)
- scientific article; zbMATH DE number 4164577 (Why is no real title available?)
- scientific article; zbMATH DE number 590363 (Why is no real title available?)
- scientific article; zbMATH DE number 665693 (Why is no real title available?)
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- scientific article; zbMATH DE number 1138782 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 2121575 (Why is no real title available?)
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- On representations of the feasible set in convex optimization
Cited in
(14)- 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
- Optimality conditions for nonconvex problems over nearly convex feasible sets
- A barrier method in convex vector optimization with generalized inequality constraints
- On the relation between the extended supporting hyperplane algorithm and Kelley's cutting plane algorithm
- Necessary and sufficient KKT optimality conditions in non-convex optimization
- Convexity without vector space structure
- \(\epsilon\)-Efficient solutions in semi-infinite multiobjective optimization
- Barrier method in nonsmooth convex optimization without convex representation
- Barrier method for convex optimization problem without regularity of constraint functions
- Karush-Kuhn-Tucker optimality conditions and duality for multiobjective semi-infinite programming via tangential subdifferentials
- Convex inner approximations of nonconvex semialgebraic sets applied to fixed-order controller design
- New qualification conditions for convex optimization without convex representation
- On representations of the feasible set in convex optimization
This page was built for publication: On convex optimization without convex representation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q644504)
