Calculating the cone of directions of constancy

DOI10.1007/BF00932906zbMath0362.90132OpenAlexW2084163039MaRDI QIDQ1240157

Henry Wolkowicz

Publication date: 1978

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00932906

Mathematics Subject Classification ID

Mathematical programming (90C99)

Cites Work

• Characterization of optimality in convex programming without a constraint qualification
• On A characterization of optimality in convex programming
• Unnamed Item

Related Items (7)

Regularizing the abstract convex program ⋮ Method of reduction in convex programming ⋮ Unnamed Item ⋮ Preprocessing and Regularization for Degenerate Semidefinite Programs ⋮ Geometry of optimality conditions and constraint qualifications: The convex case ⋮ Characterizing an optimal input in perturbed convex programming ⋮ Numerical decomposition of a convex function

This page was built for publication: Calculating the cone of directions of constancy