Convex constrained programmes with unattained infima

DOI10.1006/JMAA.1999.6407zbMATH Open0945.90039OpenAlexW2014178370MaRDI QIDQ1301883FDOQ1301883

Authors: W. T. Obuchowska 

Publication date: 12 September 1999

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jmaa.1999.6407

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

zbMATH Keywords

logarithmic penalty functionminimization of convex function \(f(x)\) over the convex region

Mathematics Subject Classification ID

Convex programming (90C25)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Convex Functions with Unbounded Level Sets and Applications to Duality Theory
• Unboundedness of a convex quadratic function subject to concave and convex quadratic constraints
• Title not available (Why is that?)
• Cone of recession and unboundedness of convex functions
• Numerical decomposition of a convex function
• Projections of Convex Programs with Unattained Infima

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)