Convex constrained programmes with unattained infima
From MaRDI portal
Recommendations
- On the minimizing trajectory of convex functions with unbounded level sets
- scientific article; zbMATH DE number 3847229
- A finite method for globally minimizing concave functions over unbounded polyhedral convex sets and its applications
- An unconstrained convex programming approach to convex semi-infinite programming
- scientific article; zbMATH DE number 2132064
Cites work
- scientific article; zbMATH DE number 439380 (Why is no real title available?)
- scientific article; zbMATH DE number 192986 (Why is no real title available?)
- scientific article; zbMATH DE number 3238721 (Why is no real title available?)
- scientific article; zbMATH DE number 3307153 (Why is no real title available?)
- scientific article; zbMATH DE number 3399051 (Why is no real title available?)
- Cone of recession and unboundedness of convex functions
- Convex Functions with Unbounded Level Sets and Applications to Duality Theory
- Numerical decomposition of a convex function
- Projections of Convex Programs with Unattained Infima
- Unboundedness of a convex quadratic function subject to concave and convex quadratic constraints
Cited in
(4)- Unboundedness in reverse convex and concave integer programming
- On boundedness of (quasi-)convex integer optimization problems
- Conditions for boundedness in concave programming under reverse convex and convex constraints
- On generalizations of the Frank-Wolfe theorem to convex and quasi-convex programmes
This page was built for publication: Convex constrained programmes with unattained infima
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1301883)