Convex constrained programmes with unattained infima

DOI10.1006/jmaa.1999.6407zbMath0945.90039OpenAlexW2014178370MaRDI QIDQ1301883

Wiesława 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

zbMATH Keywords

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

Mathematics Subject Classification ID

Related Items (4)

Unboundedness in reverse convex and concave integer programming ⋮ On generalizations of the Frank-Wolfe theorem to convex and quasi-convex programmes ⋮ On boundedness of (quasi-)convex integer optimization problems ⋮ Conditions for boundedness in concave programming under reverse convex and convex constraints

Cites Work

• Numerical decomposition of a convex function
• Unboundedness of a convex quadratic function subject to concave and convex quadratic constraints
• Projections of Convex Programs with Unattained Infima
• Convex Functions with Unbounded Level Sets and Applications to Duality Theory
• Cone of recession and unboundedness of convex functions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Convex constrained programmes with unattained infima